Submission #1857086
Source Code Expand
#include<bits/stdc++.h> using namespace std; void dfs(vector<bool>& used, vector<vector<int> >& graph, int c){ if(used[c]) return; used[c] = true; for(int i = 0; i < graph[c].size(); i++){ dfs(used, graph, graph[c][i]); } } int main(void){ int n, m; cin >> n >> m; vector<vector<int> > graph(n + m + 1); //隣接リスト for(int i = 1; i <= n; i++){ int k; cin >> k; for(int j = 0; j < k; j++){ int l; cin >> l; graph[i].push_back(l); graph[l + n].push_back(i); } } /*for(int i = 1; i <= n + m; i++){ cout << i << ": "; for(int j = 0; j < graph[i].size(); j++){ cout << graph[i][j] << " "; } cout << endl; }*/ vector<bool> used(n + m + 1, false); dfs(used, graph, 1); bool flag = true; for(int i = 1; i <= n; i++){ if(used[i] == false){ flag = false; break; } } if(flag) cout << "YES" << endl; else cout << "NO" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | monkukui |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1131 Byte |
Status | WA |
Exec Time | 57 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 | WA | 1 ms | 256 KB |
01-02.txt | AC | 2 ms | 256 KB |
01-03.txt | AC | 2 ms | 384 KB |
01-04.txt | WA | 1 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 | WA | 2 ms | 256 KB |
01-10.txt | WA | 2 ms | 384 KB |
02-01.txt | AC | 46 ms | 5760 KB |
02-02.txt | AC | 47 ms | 6144 KB |
02-03.txt | AC | 46 ms | 4480 KB |
02-04.txt | WA | 55 ms | 7424 KB |
02-05.txt | WA | 51 ms | 5632 KB |
02-06.txt | AC | 57 ms | 7424 KB |
02-07.txt | WA | 53 ms | 6144 KB |
02-08.txt | AC | 40 ms | 6136 KB |
02-09.txt | WA | 54 ms | 8440 KB |
02-10.txt | WA | 45 ms | 6136 KB |
02-11.txt | AC | 44 ms | 6136 KB |
02-12.txt | WA | 44 ms | 6016 KB |
02-13.txt | AC | 45 ms | 6016 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |