結果
問題 | No.1640 簡単な色塗り |
ユーザー | tnakao0123 |
提出日時 | 2021-08-08 03:06:55 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 64 ms / 2,000 ms |
コード長 | 2,808 bytes |
コンパイル時間 | 972 ms |
コンパイル使用メモリ | 94,276 KB |
実行使用メモリ | 12,660 KB |
最終ジャッジ日時 | 2023-09-12 04:06:07 |
合計ジャッジ時間 | 9,875 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
7,028 KB |
testcase_01 | AC | 3 ms
6,552 KB |
testcase_02 | AC | 3 ms
7,116 KB |
testcase_03 | AC | 3 ms
6,992 KB |
testcase_04 | AC | 31 ms
9,244 KB |
testcase_05 | AC | 44 ms
12,508 KB |
testcase_06 | AC | 4 ms
7,124 KB |
testcase_07 | AC | 3 ms
7,044 KB |
testcase_08 | AC | 4 ms
7,140 KB |
testcase_09 | AC | 3 ms
6,744 KB |
testcase_10 | AC | 36 ms
10,520 KB |
testcase_11 | AC | 30 ms
9,900 KB |
testcase_12 | AC | 27 ms
9,552 KB |
testcase_13 | AC | 56 ms
12,520 KB |
testcase_14 | AC | 55 ms
12,316 KB |
testcase_15 | AC | 20 ms
8,924 KB |
testcase_16 | AC | 24 ms
9,376 KB |
testcase_17 | AC | 46 ms
11,464 KB |
testcase_18 | AC | 7 ms
7,476 KB |
testcase_19 | AC | 27 ms
9,652 KB |
testcase_20 | AC | 35 ms
10,400 KB |
testcase_21 | AC | 28 ms
9,904 KB |
testcase_22 | AC | 5 ms
7,464 KB |
testcase_23 | AC | 37 ms
10,720 KB |
testcase_24 | AC | 12 ms
8,204 KB |
testcase_25 | AC | 27 ms
9,608 KB |
testcase_26 | AC | 42 ms
11,064 KB |
testcase_27 | AC | 19 ms
8,872 KB |
testcase_28 | AC | 51 ms
12,092 KB |
testcase_29 | AC | 41 ms
11,064 KB |
testcase_30 | AC | 8 ms
7,188 KB |
testcase_31 | AC | 43 ms
10,736 KB |
testcase_32 | AC | 39 ms
10,188 KB |
testcase_33 | AC | 25 ms
9,212 KB |
testcase_34 | AC | 32 ms
9,640 KB |
testcase_35 | AC | 26 ms
9,044 KB |
testcase_36 | AC | 8 ms
7,248 KB |
testcase_37 | AC | 10 ms
7,544 KB |
testcase_38 | AC | 40 ms
10,416 KB |
testcase_39 | AC | 19 ms
8,308 KB |
testcase_40 | AC | 18 ms
8,356 KB |
testcase_41 | AC | 33 ms
9,736 KB |
testcase_42 | AC | 20 ms
8,468 KB |
testcase_43 | AC | 20 ms
8,512 KB |
testcase_44 | AC | 20 ms
8,516 KB |
testcase_45 | AC | 16 ms
8,088 KB |
testcase_46 | AC | 9 ms
7,332 KB |
testcase_47 | AC | 6 ms
7,296 KB |
testcase_48 | AC | 44 ms
10,496 KB |
testcase_49 | AC | 5 ms
6,768 KB |
testcase_50 | AC | 3 ms
6,624 KB |
testcase_51 | AC | 3 ms
7,072 KB |
testcase_52 | AC | 64 ms
12,564 KB |
testcase_53 | AC | 63 ms
12,660 KB |
07_evil_01.txt | RE | - |
07_evil_02.txt | RE | - |
ソースコード
/* -*- coding: utf-8 -*- * * 1640.cc: No.1640 簡単な色塗り - yukicoder */ #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<iostream> #include<string> #include<vector> #include<map> #include<set> #include<stack> #include<list> #include<queue> #include<deque> #include<algorithm> #include<numeric> #include<utility> #include<complex> #include<functional> using namespace std; /* constant */ const int MAX_N = 100000; /* typedef */ typedef pair<int,int> pii; typedef vector<pii> vpii; struct UFT { int links[MAX_N], ranks[MAX_N], sizes[MAX_N]; UFT() {} void init(int n) { for (int i = 0; i < n; i++) links[i] = i, ranks[i] = sizes[i] = 1; } int root(int i) { int i0 = i; while (links[i0] != i0) i0 = links[i0]; return (links[i] = i0); } int rank(int i) { return ranks[root(i)]; } int size(int i) { return sizes[root(i)]; } bool same(int i, int j) { return root(i) == root(j); } int merge(int i0, int i1) { int r0 = root(i0), r1 = root(i1), mr; if (r0 == r1) return r0; if (ranks[r0] == ranks[r1]) { links[r1] = r0; sizes[r0] += sizes[r1]; ranks[r0]++; mr = r0; } else if (ranks[r0] > ranks[r1]) { links[r1] = r0; sizes[r0] += sizes[r1]; mr = r0; } else { links[r0] = r1; sizes[r1] += sizes[r0]; mr = r1; } return mr; } }; /* global variables */ UFT uft; vpii nbrs[MAX_N]; int rts[MAX_N], res[MAX_N], eps[MAX_N]; int ps[MAX_N], pes[MAX_N], cis[MAX_N]; /* subroutines */ /* main */ int main() { int n; scanf("%d", &n); uft.init(n); memset(rts, -1, sizeof(rts)); memset(res, -1, sizeof(res)); for (int i = 0; i < n; i++) { int a, b; scanf("%d%d", &a, &b); a--, b--; int ra = uft.root(a), rb = uft.root(b); if (ra == rb) rts[ra] = a, res[ra] = i; else { int rm = uft.merge(ra, rb); if (rts[rm] < 0) { if (rts[ra] >= 0) rts[rm] = rts[ra], res[rm] = res[ra]; else rts[rm] = rts[rb], res[rm] = res[rb]; } nbrs[a].push_back(pii(b, i)); nbrs[b].push_back(pii(a, i)); } } for (int u = 0; u < n; u++) if (rts[uft.root(u)] < 0) { puts("No"); return 0; } memset(eps, -1, sizeof(eps)); for (int ru = 0; ru < n; ru++) { if (ru != uft.root(ru)) continue; int rt = rts[ru], re = res[ru]; eps[re] = rt; ps[rt] = pes[rt] = -1; for (int u = rt; u >= 0;) { vpii &nbru = nbrs[u]; int up = ps[u]; if (cis[u] < nbru.size()) { pii ve = nbru[cis[u]++]; int v = ve.first, e = ve.second; if (v != up) { ps[v] = u, pes[v] = e; u = v; } } else { if (up >= 0) eps[pes[u]] = u; u = up; } } } puts("Yes"); for (int i = 0; i < n; i++) printf("%d\n", eps[i] + 1); return 0; }