Submission #1678135
Source Code Expand
#include <iostream> #include <vector> using namespace std; int dfs(int now, vector<vector<int> > &adjlist, vector<bool> &used, int m){ used[now] = true; int result = now < m ? 0 : 1; for(int i = 0; i < (int)adjlist[now].size(); i++){ if(!used[adjlist[now][i]]){ result += dfs(adjlist[now][i], adjlist, used, m); } } return result; } int main(void){ int n, m; cin >> n >> m; int k, l; vector<vector<int> > adjlist(n + m); for(int i = 0; i < n; i++){ cin >> k; for(int j = 0; j < k; j++){ cin >> l; --l; adjlist[i + m].push_back(l); adjlist[l].push_back(i + m); } } vector<bool> used(n + m, false); int result = dfs(0, adjlist, used, m); if(result == n){ cout << "YES" << endl; } else{ cout << "NO" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | taniyota |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 845 Byte |
Status | WA |
Exec Time | 66 ms |
Memory | 8440 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | 0 / 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 | 1 ms | 256 KB |
01-02.txt | AC | 2 ms | 256 KB |
01-03.txt | AC | 2 ms | 384 KB |
01-04.txt | AC | 2 ms | 256 KB |
01-05.txt | AC | 2 ms | 256 KB |
01-06.txt | WA | 2 ms | 256 KB |
01-07.txt | WA | 2 ms | 256 KB |
01-08.txt | AC | 2 ms | 256 KB |
01-09.txt | AC | 2 ms | 256 KB |
01-10.txt | WA | 2 ms | 384 KB |
02-01.txt | WA | 48 ms | 5504 KB |
02-02.txt | AC | 55 ms | 6272 KB |
02-03.txt | AC | 51 ms | 5120 KB |
02-04.txt | AC | 66 ms | 7040 KB |
02-05.txt | AC | 59 ms | 6528 KB |
02-06.txt | AC | 60 ms | 7040 KB |
02-07.txt | AC | 64 ms | 6144 KB |
02-08.txt | AC | 42 ms | 6136 KB |
02-09.txt | WA | 56 ms | 8440 KB |
02-10.txt | AC | 48 ms | 6136 KB |
02-11.txt | AC | 50 ms | 6136 KB |
02-12.txt | AC | 50 ms | 6016 KB |
02-13.txt | AC | 49 ms | 6016 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |