結果
問題 | No.317 辺の追加 |
ユーザー | eitaho |
提出日時 | 2016-09-13 15:39:54 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 441 ms / 2,000 ms |
コード長 | 4,812 bytes |
コンパイル時間 | 995 ms |
コンパイル使用メモリ | 119,596 KB |
実行使用メモリ | 47,396 KB |
最終ジャッジ日時 | 2024-04-28 13:05:55 |
合計ジャッジ時間 | 11,710 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
25,520 KB |
testcase_01 | AC | 34 ms
27,548 KB |
testcase_02 | AC | 150 ms
36,384 KB |
testcase_03 | AC | 172 ms
32,128 KB |
testcase_04 | AC | 151 ms
40,216 KB |
testcase_05 | AC | 179 ms
31,004 KB |
testcase_06 | AC | 220 ms
30,608 KB |
testcase_07 | AC | 92 ms
30,088 KB |
testcase_08 | AC | 206 ms
40,992 KB |
testcase_09 | AC | 190 ms
36,256 KB |
testcase_10 | AC | 236 ms
34,212 KB |
testcase_11 | AC | 118 ms
47,396 KB |
testcase_12 | AC | 234 ms
36,124 KB |
testcase_13 | AC | 134 ms
46,312 KB |
testcase_14 | AC | 197 ms
32,936 KB |
testcase_15 | AC | 220 ms
36,260 KB |
testcase_16 | AC | 161 ms
36,388 KB |
testcase_17 | AC | 209 ms
34,600 KB |
testcase_18 | AC | 237 ms
36,388 KB |
testcase_19 | AC | 232 ms
32,164 KB |
testcase_20 | AC | 167 ms
37,412 KB |
testcase_21 | AC | 95 ms
33,508 KB |
testcase_22 | AC | 71 ms
32,324 KB |
testcase_23 | AC | 69 ms
32,208 KB |
testcase_24 | AC | 138 ms
33,436 KB |
testcase_25 | AC | 110 ms
31,868 KB |
testcase_26 | AC | 114 ms
34,348 KB |
testcase_27 | AC | 98 ms
33,648 KB |
testcase_28 | AC | 69 ms
34,248 KB |
testcase_29 | AC | 42 ms
25,348 KB |
testcase_30 | AC | 383 ms
33,184 KB |
testcase_31 | AC | 430 ms
31,016 KB |
testcase_32 | AC | 433 ms
35,096 KB |
testcase_33 | AC | 435 ms
33,192 KB |
testcase_34 | AC | 424 ms
35,224 KB |
testcase_35 | AC | 437 ms
33,064 KB |
testcase_36 | AC | 433 ms
34,984 KB |
testcase_37 | AC | 441 ms
35,104 KB |
testcase_38 | AC | 380 ms
35,108 KB |
testcase_39 | AC | 433 ms
34,980 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Linq; using System.Text; using System.Text.RegularExpressions; using System.Collections.Generic; using System.Diagnostics; using Enu = System.Linq.Enumerable; public class Program { public void Solve() { int N = Reader.Int(), M = Reader.Int(); var uf = new UnionFind(N); for (int i = 0; i < M; i++) uf.Unite(Reader.Int() - 1, Reader.Int() - 1); var count = new int[N + 1]; var dp = new int[N + 1]; for (int i = 1; i <= N; i++) dp[i] = N + 1; foreach (var c in uf.Components().Values) count[c.Count]++; int[] deq = new int[N], deqVal = new int[N]; for (int size = 1; size <= N; size++) if (count[size] > 0) { int cnt = count[size]; for (int mod = 0; mod < size; mod++) { int s = 0, t = 0; for (int x = 0, i = mod; i <= N; x++, i += size) { int val = dp[i] - x; while (s < t && deqVal[t - 1] >= val) t--; deq[t] = x; deqVal[t++] = val; CheckMin(ref dp[i], deqVal[s] + x); if (deq[s] == x - cnt) s++; } } } Console.WriteLine(string.Join("\n", dp.Skip(1).Select(a => a > N ? -1 : a - 1))); } bool CheckMin(ref int a, int b) { if (b < a) { a = b; return true; } return false; } class UnionFind { private int[] parent; private int[] rank; private int[] numElements; public UnionFind(int N) { parent = new int[N]; rank = new int[N]; numElements = new int[N]; for (int i = 0; i < N; i++) { parent[i] = i; numElements[i] = 1; } } public int Root(int x) { if (parent[x] == x) return x; return parent[x] = Root(parent[x]); } public bool Same(int x, int y) { return Root(x) == Root(y); } public int NumElements(int x) { return numElements[Root(x)]; } public bool Unite(int x, int y) { x = Root(x); y = Root(y); if (x == y) return false; if (rank[x] > rank[y]) { var t = x; x = y; y = t; } if (rank[x] == rank[y]) rank[y]++; parent[x] = y; numElements[y] += numElements[x]; return true; } public Dictionary<int, List<int>> Components() { var dic = new Dictionary<int, List<int>>(); for (int i = 0; i < parent.Length; i++) { int root = Root(i); if (!dic.ContainsKey(root)) dic[root] = new List<int>(); dic[root].Add(i); } return dic; } } } class Entry { static void Main() { new Program().Solve(); } } class Reader { static TextReader reader = Console.In; static readonly char[] separator = { ' ' }; static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; static string[] A = new string[0]; static int i; static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Range(N, Int); } public static int[][] IntTable(int H) { return Range(H, IntLine); } public static string[] StringArray(int N) { return Range(N, Next); } public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); } public static string Line() { return reader.ReadLine().Trim(); } static string[] Split(string s) { return s.Split(separator, op); } static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; } static string Next() { CheckNext(); return A[i++]; } static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }