結果
問題 | No.1640 簡単な色塗り |
ユーザー | 👑 kakel-san |
提出日時 | 2021-08-06 23:01:03 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 381 ms / 2,000 ms |
コード長 | 2,947 bytes |
コンパイル時間 | 2,031 ms |
コンパイル使用メモリ | 69,816 KB |
実行使用メモリ | 48,772 KB |
最終ジャッジ日時 | 2023-09-12 03:08:12 |
合計ジャッジ時間 | 22,097 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
23,748 KB |
testcase_01 | AC | 69 ms
21,596 KB |
testcase_02 | AC | 72 ms
21,584 KB |
testcase_03 | AC | 70 ms
21,928 KB |
testcase_04 | AC | 258 ms
48,704 KB |
testcase_05 | AC | 257 ms
48,772 KB |
testcase_06 | AC | 71 ms
19,684 KB |
testcase_07 | AC | 71 ms
21,700 KB |
testcase_08 | AC | 72 ms
23,624 KB |
testcase_09 | AC | 69 ms
21,584 KB |
testcase_10 | AC | 233 ms
35,460 KB |
testcase_11 | AC | 193 ms
35,828 KB |
testcase_12 | AC | 181 ms
36,084 KB |
testcase_13 | AC | 331 ms
44,524 KB |
testcase_14 | AC | 320 ms
44,456 KB |
testcase_15 | AC | 137 ms
30,776 KB |
testcase_16 | AC | 157 ms
33,412 KB |
testcase_17 | AC | 274 ms
43,200 KB |
testcase_18 | AC | 83 ms
23,804 KB |
testcase_19 | AC | 178 ms
32,236 KB |
testcase_20 | AC | 218 ms
39,368 KB |
testcase_21 | AC | 184 ms
34,836 KB |
testcase_22 | AC | 79 ms
21,760 KB |
testcase_23 | AC | 245 ms
38,956 KB |
testcase_24 | AC | 112 ms
30,796 KB |
testcase_25 | AC | 184 ms
36,124 KB |
testcase_26 | AC | 261 ms
39,236 KB |
testcase_27 | AC | 134 ms
29,444 KB |
testcase_28 | AC | 314 ms
42,200 KB |
testcase_29 | AC | 247 ms
39,380 KB |
testcase_30 | AC | 92 ms
24,260 KB |
testcase_31 | AC | 319 ms
42,292 KB |
testcase_32 | AC | 292 ms
42,172 KB |
testcase_33 | AC | 195 ms
34,256 KB |
testcase_34 | AC | 241 ms
38,032 KB |
testcase_35 | AC | 188 ms
32,276 KB |
testcase_36 | AC | 95 ms
26,256 KB |
testcase_37 | AC | 106 ms
27,268 KB |
testcase_38 | AC | 300 ms
39,072 KB |
testcase_39 | AC | 157 ms
30,224 KB |
testcase_40 | AC | 154 ms
31,872 KB |
testcase_41 | AC | 249 ms
37,296 KB |
testcase_42 | AC | 169 ms
34,420 KB |
testcase_43 | AC | 164 ms
31,844 KB |
testcase_44 | AC | 173 ms
32,160 KB |
testcase_45 | AC | 145 ms
31,504 KB |
testcase_46 | AC | 97 ms
28,424 KB |
testcase_47 | AC | 87 ms
26,196 KB |
testcase_48 | AC | 299 ms
40,372 KB |
testcase_49 | AC | 75 ms
23,520 KB |
testcase_50 | AC | 68 ms
21,608 KB |
testcase_51 | AC | 72 ms
21,728 KB |
testcase_52 | AC | 375 ms
46,892 KB |
testcase_53 | AC | 381 ms
46,848 KB |
07_evil_01.txt | AC | 756 ms
63,336 KB |
07_evil_02.txt | AC | 1,158 ms
82,028 KB |
ソースコード
using System; using System.Collections.Generic; using static System.Console; using System.Linq; class yuki308 { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NList).ToArray(); static void Main() { var n = NN; var map = NMap(n); for (var i = 0; i < n; ++i) { --map[i][0]; --map[i][1]; Array.Sort(map[i]); } var p = new Pair[n]; for (var i = 0; i < p.Length; ++i) p[i] = new Pair(i); for (var i = 0; i < map.Length; ++i) { p[map[i][0]].Edges.Add(i); p[map[i][1]].Edges.Add(i); } var used = new bool[n]; var res = new int[n]; for (var i = 0; i < p.Length; ++i) { var cur = i; while (p[cur].Edges.Count == 1) { var paint = p[cur].Edges[0]; res[paint] = cur + 1; used[cur] = true; p[map[paint][0]].Edges.Remove(paint); p[map[paint][1]].Edges.Remove(paint); cur = cur ^ (map[paint][0]) ^ (map[paint][1]); } } for (var i = 0; i < p.Length; ++i) { var cur = i; while (p[cur].Edges.Count > 0) { var paint = p[cur].Edges[0]; res[paint] = cur + 1; used[cur] = true; p[map[paint][0]].Edges.Remove(paint); p[map[paint][1]].Edges.Remove(paint); cur = cur ^ (map[paint][0]) ^ (map[paint][1]); } } if (used.Count(f => !f) == 0) { WriteLine("Yes"); WriteLine(string.Join("\n", res)); } else WriteLine("No"); } class Pair { public List<int> Edges = new List<int>(); public int Num; public Pair(int num) { Num = num; } } class UnionFindTree { int[] roots; public UnionFindTree(int size) { roots = new int[size]; for (var i = 0; i < size; ++i) roots[i] = -1; } public int GetRoot(int a) { if (roots[a] < 0) return a; return roots[a] = GetRoot(roots[a]); } public bool IsSameTree(int a, int b) { return GetRoot(a) == GetRoot(b); } public bool Unite(int a, int b) { var x = GetRoot(a); var y = GetRoot(b); if (x == y) return false; if (-roots[x] < -roots[y]) { var tmp = x; x = y; y = tmp; } roots[x] += roots[y]; roots[y] = x; return true; } public int GetSize(int a) { return -roots[GetRoot(a)]; } } }