Submission #992794
Source Code Expand
#include <bits/stdc++.h> typedef long long LL; #define SORT(c) sort((c).begin(),(c).end()) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) using namespace std; class UnionFind { vector<int> p; public: UnionFind (int n) : p(n, -1) {} int root(int x) { return p[x] < 0 ? x : p[x] = root(p[x]); } bool same(int x, int y) { return root(x) == root(y); } bool unite(int x, int y) { x = root(x); y = root(y); if (x == y) return false; if (p[y] < p[x]) swap(x, y); if (p[x] == p[y]) --p[x]; p[y] = x; return true; } }; int main(void) { int n,m; UnionFind uf(n); vector<int> la(-1,m+1); int answer=1; REP(i,n){ int k; cin >> k; REP(j,k){ int l; cin >> l; if(la[l]!=-1) if(uf.unite(la[l], i)) ++answer; } } cout << (answer==n ? "YES" : "NO") << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | siotouto |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 925 Byte |
Status | RE |
Exec Time | 113 ms |
Memory | 384 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 | RE | 113 ms | 384 KB |
01-02.txt | RE | 111 ms | 256 KB |
01-03.txt | RE | 111 ms | 256 KB |
01-04.txt | RE | 111 ms | 256 KB |
01-05.txt | RE | 112 ms | 256 KB |
01-06.txt | RE | 111 ms | 256 KB |
01-07.txt | RE | 112 ms | 256 KB |
01-08.txt | RE | 112 ms | 256 KB |
01-09.txt | RE | 112 ms | 256 KB |
01-10.txt | RE | 111 ms | 256 KB |
02-01.txt | RE | 112 ms | 256 KB |
02-02.txt | RE | 112 ms | 256 KB |
02-03.txt | RE | 111 ms | 256 KB |
02-04.txt | RE | 111 ms | 256 KB |
02-05.txt | RE | 112 ms | 256 KB |
02-06.txt | RE | 110 ms | 256 KB |
02-07.txt | RE | 111 ms | 256 KB |
02-08.txt | RE | 111 ms | 256 KB |
02-09.txt | RE | 112 ms | 256 KB |
02-10.txt | RE | 111 ms | 256 KB |
02-11.txt | RE | 112 ms | 256 KB |
02-12.txt | RE | 110 ms | 256 KB |
02-13.txt | RE | 112 ms | 256 KB |
sample-01.txt | RE | 111 ms | 256 KB |
sample-02.txt | RE | 110 ms | 256 KB |