Submission #1102144
Source Code Expand
#include <bits/stdc++.h> #define ll long long #define INF 999999999 #define MOD 1000000007 #define rep(i,n) for(int i=0;i<n;i++) using namespace std; typedef pair<int,int>P; const int MAX_N = 100005; vector<int> lan[MAX_N]; int par[MAX_N]; int nrank[MAX_N]; void initial(int n){ //初期化 for(int i=0;i<n;i++){ par[i] = i; nrank[i] = 0; } } int find(int x){ //木の根を求める if(par[x] == x){ 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; if(nrank[x] < nrank[y]){ par[x] = y; }else{ par[y] = x; if(nrank[x] == nrank[y]) nrank[x]++; } } bool same(int x,int y){ return find(x) == find(y); } int main() { int n,m,k,L; bool flag = true; cin >> n >> m; rep(i,n){ cin >> k; rep(j,k){ scanf("%d",&L); lan[L-1].push_back(i); } } initial(n); rep(i,m){ if(!lan[i].empty()){ rep(j,lan[i].size()-1){ if(lan[i].size()>=2){ unite(lan[i][j],lan[i][j+1]); } } } } rep(i,n-1){ if(!same(i,i+1)){ flag = false; break; } } if(flag){ cout << "YES" << "\n"; }else{ cout << "NO" << "\n"; } }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | kopricky |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1234 Byte |
Status | AC |
Exec Time | 41 ms |
Memory | 4736 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:57:18: 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 | 5 ms | 2560 KB |
01-02.txt | AC | 5 ms | 2560 KB |
01-03.txt | AC | 6 ms | 2560 KB |
01-04.txt | AC | 5 ms | 2560 KB |
01-05.txt | AC | 5 ms | 2560 KB |
01-06.txt | AC | 5 ms | 2560 KB |
01-07.txt | AC | 5 ms | 2560 KB |
01-08.txt | AC | 5 ms | 2560 KB |
01-09.txt | AC | 5 ms | 2560 KB |
01-10.txt | AC | 5 ms | 2560 KB |
02-01.txt | AC | 26 ms | 4608 KB |
02-02.txt | AC | 37 ms | 3968 KB |
02-03.txt | AC | 26 ms | 4096 KB |
02-04.txt | AC | 39 ms | 4352 KB |
02-05.txt | AC | 40 ms | 3968 KB |
02-06.txt | AC | 39 ms | 4352 KB |
02-07.txt | AC | 41 ms | 4096 KB |
02-08.txt | AC | 36 ms | 3940 KB |
02-09.txt | AC | 39 ms | 3832 KB |
02-10.txt | AC | 30 ms | 4732 KB |
02-11.txt | AC | 30 ms | 4732 KB |
02-12.txt | AC | 31 ms | 4736 KB |
02-13.txt | AC | 31 ms | 4608 KB |
sample-01.txt | AC | 5 ms | 2560 KB |
sample-02.txt | AC | 5 ms | 2560 KB |