Submission #3222246
Source Code Expand
#include <cstdio> #include <iostream> #include <string> #include <vector> #include <sstream> #include <map> #include <set> #include <queue> #include <algorithm> #include <cmath> #include <cstdlib> #include <cstring> #include <typeinfo> #include <numeric> #include <functional> #include <unordered_map> #include <bitset> using namespace std; using ll = long long; using ull = unsigned long long; const ll INF = 1e16; const ll MOD = 1e9 + 7; #define REP(i, n) for(ll i = 0; i < n; i++) class unionfind { private: vector<long long> par; vector<long long> rank; public: void init(long long n); long long find(long long x); void unite(long long x, long long y); bool same(long long x, long long y); }; // 初期化 void unionfind::init(long long n) { for (long long i = 0; i < n; i++) { par.push_back(i); rank.push_back(0); } } // 木の根を求める long long unionfind::find(long long x) { if (par[x] == x) { return x; } else { return par[x] = find(par[x]); } } // xとyの属する集合を併合 void unionfind::unite(long long x, long long 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が同じ集合に属していたらtrue bool unionfind::same(long long x, long long y) { return find(x) == find(y); } int main() { ll n, m; cin >> n >> m; unionfind uni; uni.init(n + m); REP(i, n){ ll k; cin >> k; REP(j, k){ ll l; cin >> l; l--; uni.unite(i, l); } } REP(i, n){ if(!uni.same(0, i)){ cout << "NO" << endl; return 0; } } cout << "YES" << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | chocobo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1871 Byte |
Status | WA |
Exec Time | 48 ms |
Memory | 3564 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | 0 / 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 | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | WA | 2 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | WA | 2 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 2 ms | 256 KB |
02-01.txt | AC | 33 ms | 2156 KB |
02-02.txt | WA | 39 ms | 2036 KB |
02-03.txt | WA | 32 ms | 1396 KB |
02-04.txt | AC | 43 ms | 3564 KB |
02-05.txt | AC | 40 ms | 2036 KB |
02-06.txt | AC | 43 ms | 3564 KB |
02-07.txt | AC | 42 ms | 2036 KB |
02-08.txt | WA | 34 ms | 2036 KB |
02-09.txt | AC | 48 ms | 3564 KB |
02-10.txt | AC | 38 ms | 2036 KB |
02-11.txt | WA | 38 ms | 2036 KB |
02-12.txt | AC | 37 ms | 2036 KB |
02-13.txt | WA | 37 ms | 2036 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |