Submission #993019
Source Code Expand
#include <iostream> #include <vector> #include <stdlib.h> #include <math.h> #include <algorithm> #include <queue> using namespace std; bool ok[1001][1001]; int main() { int l[1000]; bool reached[1001]; int n, m; cin >> n >> m; int k; for (int i = 0; i < m; i++) { reached[i] = true; } for (int i = 0; i < n; i++) { cin >> k; for (int x = 0; x < k; x++) { cin >> l[x]; reached[l[x]] = false; } // sort(l, l + k); for (int dist = 0; dist < k-1; dist++) { for (int sorce = dist + 1; sorce < k; sorce++) { int x = l[dist]; int y = l[sorce]; ok[x][y] = true; ok[y][x] = true; } } } queue<int> queue; queue.push(1); reached[1] = true; while (!queue.empty()) { int target; target = queue.front(); queue.pop(); for (int i = 1; i <= m; i++) { if (target == i) { continue; } if (ok[target][i] == false) { continue; } if (reached[i] == true) { //ignore } else { queue.push(i); reached[i] = true; } } } for (int i = 1; i <= m; i++) { if (reached[i] == false) { cout << "NO" << endl; return 0; } } cout << "YES" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | ysakasin |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 1227 Byte |
Status | WA |
Exec Time | 897 ms |
Memory | 1408 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 6 ms | 888 KB |
01-02.txt | AC | 5 ms | 1408 KB |
01-03.txt | AC | 4 ms | 256 KB |
01-04.txt | AC | 4 ms | 256 KB |
01-05.txt | AC | 4 ms | 384 KB |
01-06.txt | WA | 4 ms | 1152 KB |
01-07.txt | WA | 4 ms | 768 KB |
01-08.txt | AC | 4 ms | 1152 KB |
01-09.txt | WA | 4 ms | 768 KB |
01-10.txt | WA | 4 ms | 256 KB |
02-01.txt | RE | 897 ms | 256 KB |
02-02.txt | AC | 112 ms | 1280 KB |
02-03.txt | RE | 113 ms | 256 KB |
02-04.txt | RE | 113 ms | 256 KB |
02-05.txt | RE | 113 ms | 256 KB |
02-06.txt | RE | 113 ms | 256 KB |
02-07.txt | RE | 114 ms | 256 KB |
02-08.txt | AC | 93 ms | 256 KB |
02-09.txt | RE | 113 ms | 256 KB |
02-10.txt | RE | 113 ms | 256 KB |
02-11.txt | RE | 113 ms | 256 KB |
02-12.txt | RE | 112 ms | 256 KB |
02-13.txt | RE | 114 ms | 256 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 3 ms | 256 KB |