Submission #7452296
Source Code Expand
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <sstream>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define FOR(i,a,b) for(int i=a; i<(int)(b); i++)
#define ALL(x) (x).begin(),(x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort(ALL(x))
#define CLR(a) memset((a), 0 ,sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const double PI = acos(-1.0);
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
__attribute__((constructor))
void initial(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
// UnionFind
struct UnionFind{
VI par,sizes; // par[i]:iの親の番号
UnionFind(int n) : par(n), sizes(n,1){ // 最初は全てが根であるとして初期化
rep(i,n) par[i] = i;
}
int root(int x){
if(par[x]==x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x); int ry = root(y);
if(rx==ry) return;
if(sizes[rx]<sizes[ry]) swap(rx,ry);
par[ry] = rx;
sizes[rx] += sizes[ry];
}
bool same(int x, int y){
return root(x)==root(y);
}
int size(int x){
return sizes[root(x)];
}
};
signed main(){
int n,m; cin>>n>>m;
UnionFind uf(n+m);
rep(i,n){
int k; cin>>k;
rep(j,k){
int l; cin>>l;
uf.unite(l-1,m+i);
}
}
rep(i,n-1){
if(!uf.same(m+i,m+i+1)){
return cout<<"NO"<<endl, 0;
}
}
cout << "YES" << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
m_9719 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
2197 Byte |
Status |
AC |
Exec Time |
16 ms |
Memory |
1792 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 |
1 ms |
256 KB |
01-04.txt |
AC |
1 ms |
256 KB |
01-05.txt |
AC |
1 ms |
256 KB |
01-06.txt |
AC |
1 ms |
256 KB |
01-07.txt |
AC |
1 ms |
256 KB |
01-08.txt |
AC |
1 ms |
256 KB |
01-09.txt |
AC |
1 ms |
256 KB |
01-10.txt |
AC |
1 ms |
256 KB |
02-01.txt |
AC |
12 ms |
1152 KB |
02-02.txt |
AC |
15 ms |
1024 KB |
02-03.txt |
AC |
12 ms |
768 KB |
02-04.txt |
AC |
16 ms |
1536 KB |
02-05.txt |
AC |
15 ms |
1024 KB |
02-06.txt |
AC |
16 ms |
1536 KB |
02-07.txt |
AC |
16 ms |
1024 KB |
02-08.txt |
AC |
13 ms |
1024 KB |
02-09.txt |
AC |
16 ms |
1792 KB |
02-10.txt |
AC |
13 ms |
1024 KB |
02-11.txt |
AC |
13 ms |
1024 KB |
02-12.txt |
AC |
14 ms |
1024 KB |
02-13.txt |
AC |
13 ms |
1024 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |