Submission #3908368
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair
class UnionFind {
public:
int n;
vi par; //親
vi ran; //木の深さ
vi num; //要素数
UnionFind(int _n) {
n = _n;
par.resize(n); ran.resize(n); num.resize(n);
for (int i = 0; i < n; i++) {
par[i] = i; ran[i] = 0; num[i] = 1;
}
}
//木の根を求める
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x); y = find(y);
int numsum = num[x] + num[y];
if (x == y) {
return;
}
if (ran[x]<ran[y]) {
par[x] = y;
}
else {
par[y] = x;
if (ran[x] == ran[y]) {
ran[x]++;
}
}
num[x] = num[y] = numsum;
}
//xとyが同じ集合に属するか否か
bool same(int x, int y) {
return find(x) == find(y);
}
};
int main() {
int n, m;
cin >> n >> m;
vii l2u(m);
rep (i, n) {
int k;
cin >> k;
rep (j, k) {
int l;
cin >> l;
l--;
l2u[l].push_back(i);
}
}
UnionFind uf(n);
rep (i, m) {
rep (j, (int)l2u[i].size() - 1) {
int u1 = l2u[i][j];
int u2 = l2u[i][j + 1];
uf.unite(u1, u2);
}
}
if (uf.num[uf.find(0)] == n) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
fuppy0716 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3237 Byte |
Status |
AC |
Exec Time |
59 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, sample-01.txt, sample-02.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
1 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 |
45 ms |
4608 KB |
02-02.txt |
AC |
42 ms |
1920 KB |
02-03.txt |
AC |
43 ms |
2944 KB |
02-04.txt |
AC |
55 ms |
4608 KB |
02-05.txt |
AC |
46 ms |
2176 KB |
02-06.txt |
AC |
59 ms |
4608 KB |
02-07.txt |
AC |
47 ms |
2304 KB |
02-08.txt |
AC |
34 ms |
1892 KB |
02-09.txt |
AC |
49 ms |
4344 KB |
02-10.txt |
AC |
42 ms |
3708 KB |
02-11.txt |
AC |
42 ms |
3708 KB |
02-12.txt |
AC |
42 ms |
3712 KB |
02-13.txt |
AC |
43 ms |
3712 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |