Submission #7071670
Source Code Expand
#include<bits/stdc++.h> using namespace std; int main(){ int N,M; cin >> N >> M; vector<int> to[1000000]; vector<bool> visited(1000000,false); // 0 ~ 1e5番台が人を、 1e5 + 1 ~ 2e5番代を言語が有するものとする for(int i = 0; i < N; i++){ int k; cin >> k; for(int j = 0; j < k; j++){ int l; cin >> l; to[i].push_back(l+100000); to[l+100000].push_back(i);} //人から言語に、言語から人に二部グラフを張る(解説準拠) } queue<int> Q; Q.push(0); visited[0] = true; //BFSで0から全部の人に訪れることができるか調べる while(!Q.empty()){ int p = Q.front(); Q.pop(); for(int i = 0; i < (int)to[p].size(); i++){ int q = to[p][i]; if(visited[q]){ continue;} Q.push(q); visited[q] = true;} } for(int i = 0; i < N; i++){ if(!visited[i]){cout << "NO" <<endl; return 0;} } cout << "YES" << endl; return 0;}
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | youyin |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 984 Byte |
Status | AC |
Exec Time | 70 ms |
Memory | 27768 KB |
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 | 9 ms | 23808 KB |
01-02.txt | AC | 9 ms | 23808 KB |
01-03.txt | AC | 9 ms | 23808 KB |
01-04.txt | AC | 10 ms | 23808 KB |
01-05.txt | AC | 10 ms | 23808 KB |
01-06.txt | AC | 10 ms | 23808 KB |
01-07.txt | AC | 10 ms | 23808 KB |
01-08.txt | AC | 9 ms | 23808 KB |
01-09.txt | AC | 10 ms | 23808 KB |
01-10.txt | AC | 10 ms | 23808 KB |
02-01.txt | AC | 55 ms | 26624 KB |
02-02.txt | AC | 57 ms | 27648 KB |
02-03.txt | AC | 53 ms | 25984 KB |
02-04.txt | AC | 70 ms | 26880 KB |
02-05.txt | AC | 63 ms | 27136 KB |
02-06.txt | AC | 69 ms | 27008 KB |
02-07.txt | AC | 66 ms | 27392 KB |
02-08.txt | AC | 47 ms | 27512 KB |
02-09.txt | AC | 60 ms | 27768 KB |
02-10.txt | AC | 52 ms | 27640 KB |
02-11.txt | AC | 52 ms | 27640 KB |
02-12.txt | AC | 54 ms | 27264 KB |
02-13.txt | AC | 55 ms | 27264 KB |
sample-01.txt | AC | 9 ms | 23808 KB |
sample-02.txt | AC | 9 ms | 23808 KB |