Submission #7372368
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define MOD 1000000007 #define INF 1e9 template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } struct UnionFind{ vector<int> par; UnionFind(int n) : par(n,-1) { } void init(int n) { par.assign(n,-1); } int root(int x){ if(par[x]<0) return x; else return par[x]=root(par[x]); } bool issame(int x,int y){ return root(x)==root(y); } bool merge(int x,int y){ x=root(x); y=root(y); if(x==y) return false; if(par[x]>par[y]) swap(x,y); par[x]+=par[y]; par[y]=x; return true; } int size(int x){ return -par[root(x)]; } }; int main(){ int n,m; cin>>n>>m; UnionFind uf(n+m); for(int i=0;i<n;i++){ int k; cin>>k; for(int j=0;j<k;j++){ int l; cin>>l; uf.merge(l-1,m+i); } } for(int i=0;i<n-1;i++){ if(!uf.issame(m+i,m+i+1)){ cout<<"NO"<<endl; return 0; } } cout<<"YES"<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | hiroa |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1416 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 1024 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 | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 2 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 2 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 1 ms | 256 KB |
01-09.txt | AC | 2 ms | 256 KB |
01-10.txt | AC | 2 ms | 256 KB |
02-01.txt | AC | 31 ms | 640 KB |
02-02.txt | AC | 39 ms | 640 KB |
02-03.txt | AC | 32 ms | 512 KB |
02-04.txt | AC | 41 ms | 896 KB |
02-05.txt | AC | 40 ms | 640 KB |
02-06.txt | AC | 40 ms | 896 KB |
02-07.txt | AC | 42 ms | 640 KB |
02-08.txt | AC | 32 ms | 640 KB |
02-09.txt | AC | 46 ms | 1024 KB |
02-10.txt | AC | 37 ms | 640 KB |
02-11.txt | AC | 37 ms | 640 KB |
02-12.txt | AC | 36 ms | 640 KB |
02-13.txt | AC | 36 ms | 640 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |