Submission #992045
Source Code Expand
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<((x))<<endl
#define fi first
#define se second
#define INF 2147483600
class UnionFind {
public:
vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth
UnionFind(int sz) : par(sz, -1), rank(sz, 0){}
int find(int x){
if(par[x]<0) return x;
else return par[x] = find(par[x]);
}
void unite(int x, int y){
x=find(x); y=find(y);
if(x==y) return; // already belong to same tree
if(rank[x] < rank[y]){ // y becomes parent node
par[y] += par[x];
par[x] = y;
} else { // x becomes parent node
par[x] += par[y];
par[y] = x;
if(rank[x]==rank[y]) rank[x]++;
}
}
bool same(int x, int y){ return find(x) == find(y); }
int size(int x){ return -par[find(x)]; }
}; // END class UnionFind
int main(){
int n,m;
cin>>n>>m;
vector<vector<int> > lang2p(m, vector<int>());
rep(i,n){
int k;
scanf("%d", &k);
rep(j,k){
int l;
scanf("%d", &l);
l--;
lang2p[l].pb(i);
}
}
UnionFind uf(n);
rep(i,m) repl(j,1,lang2p[i].size()){
uf.unite(lang2p[i][j], lang2p[i][0]);
}
if(uf.size(0)==n){
cout<<"YES"<<endl;
} else {
cout<<"NO"<<endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
tossy |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1780 Byte |
Status |
AC |
Exec Time |
29 ms |
Memory |
4608 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:60:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &k);
^
./Main.cpp:63:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &l);
^
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 |
2 ms |
256 KB |
01-02.txt |
AC |
2 ms |
256 KB |
01-03.txt |
AC |
2 ms |
256 KB |
01-04.txt |
AC |
2 ms |
256 KB |
01-05.txt |
AC |
2 ms |
256 KB |
01-06.txt |
AC |
2 ms |
256 KB |
01-07.txt |
AC |
2 ms |
256 KB |
01-08.txt |
AC |
2 ms |
256 KB |
01-09.txt |
AC |
2 ms |
256 KB |
01-10.txt |
AC |
2 ms |
256 KB |
02-01.txt |
AC |
24 ms |
4608 KB |
02-02.txt |
AC |
21 ms |
1536 KB |
02-03.txt |
AC |
22 ms |
2944 KB |
02-04.txt |
AC |
29 ms |
4352 KB |
02-05.txt |
AC |
24 ms |
1920 KB |
02-06.txt |
AC |
29 ms |
4352 KB |
02-07.txt |
AC |
25 ms |
1920 KB |
02-08.txt |
AC |
19 ms |
1508 KB |
02-09.txt |
AC |
23 ms |
3832 KB |
02-10.txt |
AC |
21 ms |
3580 KB |
02-11.txt |
AC |
21 ms |
3580 KB |
02-12.txt |
AC |
21 ms |
3584 KB |
02-13.txt |
AC |
21 ms |
3456 KB |
sample-01.txt |
AC |
2 ms |
256 KB |
sample-02.txt |
AC |
2 ms |
256 KB |