Submission #1538663
Source Code Expand
#include <iostream> #include <algorithm> #include <time.h> #include <stack> #include <string> #include <cstring> #include <cstdio> #include <cmath> #include <vector> #include <queue> #include <map> #include <set> #include <cassert> using namespace std; const int N = 100005; const int inf = 1000 * 1000 * 1000; const int mod = 1000 * 1000 * 1000 + 7; int n,m,sz; bool used[N] , mark[N]; vector <int> g[N] , glezu[N]; queue <int> q; int main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int q; scanf("%d",&q); while(q--){ int lezu; scanf("%d",&lezu); g[i].push_back(lezu); glezu[lezu].push_back(i); } } sz++; used[1] = true; q.push(1); while(!q.empty()){ int mard = q.front(); q.pop(); for(int i=0;i<(int)g[mard].size();i++){ int lezu = g[mard][i]; if(mark[lezu])continue; mark[lezu] = true; for(int j=0;j<(int)glezu[lezu].size();j++){ int Mard = glezu[lezu][j]; if(used[Mard] == false){ used[Mard] = true; q.push(Mard); sz++; } } } } if(sz == n) cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | LeMur |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1399 Byte |
Status | AC |
Exec Time | 34 ms |
Memory | 8952 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:30:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&q); ^ ./Main.cpp:33:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&lezu); ^
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 200 / 200 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt |
dataset1 | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt |
dataset2 | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 3 ms | 4992 KB |
01-02.txt | AC | 3 ms | 4992 KB |
01-03.txt | AC | 3 ms | 4992 KB |
01-04.txt | AC | 3 ms | 4992 KB |
01-05.txt | AC | 3 ms | 4992 KB |
01-06.txt | AC | 3 ms | 4992 KB |
01-07.txt | AC | 3 ms | 4992 KB |
01-08.txt | AC | 3 ms | 4992 KB |
01-09.txt | AC | 3 ms | 4992 KB |
01-10.txt | AC | 3 ms | 4992 KB |
02-01.txt | AC | 27 ms | 7680 KB |
02-02.txt | AC | 28 ms | 8832 KB |
02-03.txt | AC | 26 ms | 7168 KB |
02-04.txt | AC | 34 ms | 8192 KB |
02-05.txt | AC | 31 ms | 8448 KB |
02-06.txt | AC | 34 ms | 8192 KB |
02-07.txt | AC | 32 ms | 8576 KB |
02-08.txt | AC | 26 ms | 8696 KB |
02-09.txt | AC | 28 ms | 8952 KB |
02-10.txt | AC | 24 ms | 8824 KB |
02-11.txt | AC | 24 ms | 8824 KB |
02-12.txt | AC | 24 ms | 8576 KB |
02-13.txt | AC | 24 ms | 8576 KB |
sample-01.txt | AC | 3 ms | 4992 KB |
sample-02.txt | AC | 3 ms | 4992 KB |