結果
問題 | No.1640 簡単な色塗り |
ユーザー | magsta |
提出日時 | 2021-07-07 20:04:53 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 2,181 bytes |
コンパイル時間 | 1,944 ms |
コンパイル使用メモリ | 182,080 KB |
実行使用メモリ | 20,984 KB |
最終ジャッジ日時 | 2023-09-12 01:37:21 |
合計ジャッジ時間 | 15,421 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 194 ms
10,052 KB |
testcase_05 | AC | 209 ms
20,984 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 136 ms
7,540 KB |
testcase_11 | AC | 107 ms
6,732 KB |
testcase_12 | AC | 98 ms
6,544 KB |
testcase_13 | AC | 217 ms
9,860 KB |
testcase_14 | AC | 208 ms
9,856 KB |
testcase_15 | AC | 69 ms
5,368 KB |
testcase_16 | AC | 82 ms
6,192 KB |
testcase_17 | AC | 167 ms
8,856 KB |
testcase_18 | AC | 15 ms
4,376 KB |
testcase_19 | AC | 93 ms
6,156 KB |
testcase_20 | AC | 128 ms
7,216 KB |
testcase_21 | AC | 102 ms
6,752 KB |
testcase_22 | AC | 10 ms
4,376 KB |
testcase_23 | AC | 136 ms
7,804 KB |
testcase_24 | AC | 36 ms
4,484 KB |
testcase_25 | AC | 96 ms
6,536 KB |
testcase_26 | AC | 151 ms
8,324 KB |
testcase_27 | AC | 65 ms
5,424 KB |
testcase_28 | AC | 196 ms
9,768 KB |
testcase_29 | AC | 148 ms
8,284 KB |
testcase_30 | AC | 14 ms
4,732 KB |
testcase_31 | AC | 105 ms
14,080 KB |
testcase_32 | AC | 91 ms
13,984 KB |
testcase_33 | AC | 60 ms
11,476 KB |
testcase_34 | AC | 73 ms
10,968 KB |
testcase_35 | AC | 58 ms
11,764 KB |
testcase_36 | AC | 14 ms
5,220 KB |
testcase_37 | AC | 20 ms
6,220 KB |
testcase_38 | AC | 94 ms
13,652 KB |
testcase_39 | AC | 37 ms
7,744 KB |
testcase_40 | AC | 37 ms
7,492 KB |
testcase_41 | AC | 81 ms
12,288 KB |
testcase_42 | AC | 44 ms
7,848 KB |
testcase_43 | AC | 45 ms
8,284 KB |
testcase_44 | AC | 46 ms
9,364 KB |
testcase_45 | AC | 34 ms
8,396 KB |
testcase_46 | AC | 16 ms
5,636 KB |
testcase_47 | AC | 10 ms
4,772 KB |
testcase_48 | AC | 115 ms
15,928 KB |
testcase_49 | AC | 5 ms
4,376 KB |
testcase_50 | AC | 1 ms
4,376 KB |
testcase_51 | AC | 1 ms
4,376 KB |
testcase_52 | AC | 236 ms
13,956 KB |
testcase_53 | AC | 258 ms
15,720 KB |
07_evil_01.txt | AC | 530 ms
18,492 KB |
07_evil_02.txt | AC | 857 ms
26,080 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct Edge { int u; int v; int num; Edge(int a, int b, int c) : u(a), v(b), num(c) { } }; using Graph = vector<vector<Edge>>; vector<bool> seen; void dfs(const Graph& G, int v) { seen[v] = true; for (auto next_v : G[v]) { if (seen[next_v.v]) continue; dfs(G, next_v.v); } } vector<bool> seen2, finished; vector<int> flag; vector<int> a, b; int pos = -1; stack<int> hist; int edg; void dfs2(const Graph& G, int v, int i) { seen2[v] = true; hist.push(v); for (auto nv : G[v]) { if (nv.num == i) continue; if (finished[nv.v]) continue; if (seen2[nv.v] && !finished[nv.v]) { pos = nv.v; edg = nv.num; return; } dfs2(G, nv.v, nv.num); if (pos != -1) return; } hist.pop(); finished[v] = true; } vector<bool> seen3; void dfs3(const Graph& G, int v) { seen3[v] = true; for (auto next_v : G[v]) { if (seen3[next_v.v]) continue; if (edg == next_v.num) continue; if (next_v.v == a[next_v.num] - 1) flag[next_v.num] = 0; else flag[next_v.num] = 1; dfs3(G, next_v.v); } } int main() { int N; cin >> N; Graph G(N); a.assign(N, 0); b.assign(N, 0); for (int i = 0; i < N; i++) { cin >> a[i] >> b[i]; G[a[i] - 1].emplace_back(a[i] - 1, b[i] - 1, i); G[b[i] - 1].emplace_back(b[i] - 1, a[i] - 1, i); } seen.assign(N, false); flag.assign(N, -1); seen2.assign(N, false); finished.assign(N, false); seen3.assign(N, false); for (int i = 0; i < N; i++) { if (seen[i]) continue; dfs(G, i); pos = -1; edg = -1; dfs2(G, i, -1); if (pos == -1) { cout << "No" << endl; return 0; } if (a[edg] - 1 == pos) flag[edg] = 0; else flag[edg] = 1; dfs3(G, pos); } cout << "Yes" << endl; for (int i = 0; i < N; i++) { if (flag[i] == -1) cout << "Error" << endl; if (flag[i] == 0) cout << a[i] << endl; if (flag[i] == 1) cout << b[i] << endl; } }