Submission #1695694
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; struct union_find { std::vector<int> rank, par; int v_size; union_find() {} // 初期化 union_find(int n) { v_size = n; rank.resize(n, 0); par.resize(n); for(int i=0;i<n;i++) { par[i] = i; } } // 木の根を求める 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); if (x == y) return; if(rank[x] < rank[y]) { par[x] = y; } else { par[y] = x; if(rank[x] == rank[y]) rank[x]++; } } // xとyが同じ集合に属するか否か bool same(int x, int y) { return find(x) == find(y); } // グループの個数を数える int count() { std::set<int> st; for(int i=0;i<v_size;i++) { st.insert(find(i)); } return st.size(); } }; int main() { cin.tie(0); ios::sync_with_stdio(false); ll n, m; cin >> n >> m; union_find uf(n); vector<int> v[m]; for(int i=0;i<n;i++) { int k; cin >> k; for(int j=0;j<k;j++) { int li; cin >> li; li--; v[li].push_back(i); } } for(int i=0;i<m;i++) { for(int j=1;j<v[i].size();j++) { uf.unite(v[i][0], v[i][j]); //cout << "i: " << i << " j: " << j <<" " << v[i][j] << endl; } } if(uf.count() > 1) cout << "NO" << endl; else cout << "YES" << endl; /* for(int i=0;i<n;i++) cout << "find(i): " << uf.find(i) << endl; */ }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | hkr |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1694 Byte |
Status | AC |
Exec Time | 24 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 | 1 ms | 256 KB |
01-03.txt | AC | 2 ms | 384 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 2 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 | 19 ms | 4608 KB |
02-02.txt | AC | 18 ms | 1664 KB |
02-03.txt | AC | 20 ms | 2944 KB |
02-04.txt | AC | 24 ms | 4480 KB |
02-05.txt | AC | 20 ms | 1920 KB |
02-06.txt | AC | 24 ms | 4480 KB |
02-07.txt | AC | 20 ms | 2048 KB |
02-08.txt | AC | 15 ms | 1536 KB |
02-09.txt | AC | 18 ms | 4092 KB |
02-10.txt | AC | 16 ms | 3712 KB |
02-11.txt | AC | 16 ms | 3712 KB |
02-12.txt | AC | 17 ms | 3584 KB |
02-13.txt | AC | 17 ms | 3456 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |