Submission #5792688
Source Code Expand
#include <algorithm> #include <bitset> #include <cassert> #include <cstring> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <vector> using namespace std; typedef long long ll; typedef pair<ll, ll> pii; typedef pair<int, pii> pipii; int par[100005]; int find(int x) { return par[x] == x ? x : (par[x] = find(par[x])); } bool merge(int x, int y) { x = find(x); y = find(y); if(x == y) return false; par[x] = y; return true; } void solve() { int n, m; cin >> n >> m; for(int i = 1; i <= n; i++) par[i] = i; map<int, vector<int>> dp; for(int i = 1; i <= n; i++) { int t; cin >> t; while(t--) { int now; cin >> now; dp[now].push_back(i); } } int comps = n; for(auto x: dp) { vector<int> y = x.second; for(int i = 1; i < y.size(); i++) comps -= merge(y[i-1], y[i]); } if(comps == 1) cout << "YES\n"; else cout << "NO\n"; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); /* int t; cin >> t; for(int i = 1; i <= t; i++) { cout << "Case #" << i << ": "; solve(); } */ }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | xiaowuc1 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1258 Byte |
Status | AC |
Exec Time | 54 ms |
Memory | 7168 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 | 384 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 | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 2 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 1 ms | 256 KB |
02-01.txt | AC | 54 ms | 7168 KB |
02-02.txt | AC | 24 ms | 1280 KB |
02-03.txt | AC | 48 ms | 5120 KB |
02-04.txt | AC | 51 ms | 5248 KB |
02-05.txt | AC | 37 ms | 2304 KB |
02-06.txt | AC | 52 ms | 5248 KB |
02-07.txt | AC | 37 ms | 2432 KB |
02-08.txt | AC | 14 ms | 1508 KB |
02-09.txt | AC | 16 ms | 1912 KB |
02-10.txt | AC | 29 ms | 6524 KB |
02-11.txt | AC | 29 ms | 6524 KB |
02-12.txt | AC | 38 ms | 5760 KB |
02-13.txt | AC | 38 ms | 5760 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |