Submission #993835
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <utility> #include <map> using namespace std; #define rep(i, n) for (int i = 0; i < (int)n; i++) #define brep(i, n) for (int i = (int)n - 1; i >= 0; i--) #define orep(i, n) for (int i = 1; i <= (int)n; i++) #define vec vector #define pb push_back #define mp make_pair #define pii pair<int, int> #define ll long long vec<int> dp; vec<vec<int>> road; void bfs(int p) { dp[p] = 1; rep(i, road[p].size()) { if (dp[road[p][i]]) continue; bfs(road[p][i]); } } int main(void) { int n, m; cin >> n >> m; vec<vec<int>> lang(m); vec<vec<int>> input(n); rep(i, n) { int k; cin >> k; input[i].resize(k); rep(j, k) { int get; cin >> get; get--; lang[get].pb(i); input[i][j] = get; } } dp.resize(n); rep(i, n) dp[i] = 0; road.resize(n); rep(i, m) { if (lang[i].empty()) continue; int keep = lang[i][0]; orep(j, lang[i].size() - 1) { road[keep].pb(lang[i][j]); road[lang[i][j]].pb(keep); } } rep(i, n) { rep(j, input[i].size()) { road[i].pb(lang[input[i][j]][0]); road[lang[input[i][j]][0]].pb(i); } } bfs(0); int flag = 1; rep(i, n) if (!dp[i]) flag = 0; if (flag) cout << "YES" << endl; else cout << "NO" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | elkurin |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1354 Byte |
Status | AC |
Exec Time | 85 ms |
Memory | 15352 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 3 ms | 256 KB |
01-02.txt | AC | 3 ms | 256 KB |
01-03.txt | AC | 3 ms | 384 KB |
01-04.txt | AC | 3 ms | 384 KB |
01-05.txt | AC | 3 ms | 384 KB |
01-06.txt | AC | 3 ms | 384 KB |
01-07.txt | AC | 3 ms | 384 KB |
01-08.txt | AC | 3 ms | 384 KB |
01-09.txt | AC | 3 ms | 384 KB |
01-10.txt | AC | 3 ms | 384 KB |
02-01.txt | AC | 56 ms | 7168 KB |
02-02.txt | AC | 73 ms | 13440 KB |
02-03.txt | AC | 58 ms | 6144 KB |
02-04.txt | AC | 82 ms | 11392 KB |
02-05.txt | AC | 82 ms | 11904 KB |
02-06.txt | AC | 82 ms | 11392 KB |
02-07.txt | AC | 85 ms | 12672 KB |
02-08.txt | AC | 60 ms | 12792 KB |
02-09.txt | AC | 77 ms | 15352 KB |
02-10.txt | AC | 59 ms | 10104 KB |
02-11.txt | AC | 59 ms | 10104 KB |
02-12.txt | AC | 59 ms | 9984 KB |
02-13.txt | AC | 59 ms | 10112 KB |
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | AC | 2 ms | 256 KB |