Submission #991985
Source Code Expand
#include<iostream> #include<vector> #include<string> #include<algorithm> #include<map> #include<set> #include<utility> #include<cmath> #include<cstring> #include<queue> #include<stack> #include<cstdio> #include<sstream> #include<iomanip> #define loop(i,a,b) for(int i=a;i<b;i++) #define rep(i,a) loop(i,0,a) #define pb push_back #define mp make_pair #define all(in) in.begin(),in.end() #define shosu(x) fixed<<setprecision(x) using namespace std; //kaewasuretyuui typedef long long ll; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<pii> vp; typedef vector<vp> vvp; typedef vector<string> vs; typedef vector<double> vd; typedef pair<int,pii> pip; typedef vector<pip>vip; const double PI=acos(-1); const double EPS=1e-8; const int inf=1e8; struct UnionFind{ vector<int> data; UnionFind(int size) : data(size, -1) {} bool unionSet(int x,int y){ x=root(x);y=root(y); if(x==y)return 0; if(data[y]<data[x])swap(x,y); data[x]+=data[y],data[y]=x; return 1; } bool findSet(int x,int y){ return root(x)==root(y); } int root(int x){ return data[x]<0 ? x : data[x]=root(data[x]); } int size(int x){ return -data[root(x)]; } }; int main(){ int n,m; cin>>n>>m; UnionFind uf(n); vvi in(m); rep(i,n){ int a; cin>>a; rep(j,a){ int b; cin>>b; in[b-1].pb(i); } } // rep(i,m){rep(j,in[i].size())cout<<" "<<in[i][j];cout<<endl;} rep(i,m)if(in[i].size())rep(j,in[i].size()-1)uf.unionSet(in[i][j],in[i][j+1]); if(uf.size(0)==n)cout<<"YES"<<endl; else cout<<"NO"<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | ixmel_rd |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1710 Byte |
Status | AC |
Exec Time | 52 ms |
Memory | 4608 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 | 256 KB |
01-04.txt | AC | 3 ms | 256 KB |
01-05.txt | AC | 3 ms | 256 KB |
01-06.txt | AC | 3 ms | 256 KB |
01-07.txt | AC | 3 ms | 256 KB |
01-08.txt | AC | 3 ms | 256 KB |
01-09.txt | AC | 3 ms | 256 KB |
01-10.txt | AC | 3 ms | 256 KB |
02-01.txt | AC | 44 ms | 4608 KB |
02-02.txt | AC | 41 ms | 1280 KB |
02-03.txt | AC | 42 ms | 2816 KB |
02-04.txt | AC | 52 ms | 4224 KB |
02-05.txt | AC | 46 ms | 1536 KB |
02-06.txt | AC | 52 ms | 4224 KB |
02-07.txt | AC | 47 ms | 1664 KB |
02-08.txt | AC | 34 ms | 1152 KB |
02-09.txt | AC | 51 ms | 3580 KB |
02-10.txt | AC | 44 ms | 3456 KB |
02-11.txt | AC | 44 ms | 3456 KB |
02-12.txt | AC | 43 ms | 3328 KB |
02-13.txt | AC | 44 ms | 3328 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 3 ms | 256 KB |