結果
問題 | No.416 旅行会社 |
ユーザー | eitaho |
提出日時 | 2016-09-13 00:40:17 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,040 ms / 4,000 ms |
コード長 | 3,893 bytes |
コンパイル時間 | 2,432 ms |
コンパイル使用メモリ | 110,396 KB |
実行使用メモリ | 84,528 KB |
最終ジャッジ日時 | 2023-08-21 10:05:49 |
合計ジャッジ時間 | 15,907 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 732 ms
67,716 KB |
testcase_01 | AC | 67 ms
22,772 KB |
testcase_02 | AC | 67 ms
22,632 KB |
testcase_03 | AC | 67 ms
22,720 KB |
testcase_04 | AC | 70 ms
22,568 KB |
testcase_05 | AC | 68 ms
20,620 KB |
testcase_06 | AC | 68 ms
22,652 KB |
testcase_07 | AC | 72 ms
22,820 KB |
testcase_08 | AC | 83 ms
22,624 KB |
testcase_09 | AC | 136 ms
28,956 KB |
testcase_10 | AC | 731 ms
63,448 KB |
testcase_11 | AC | 714 ms
66,088 KB |
testcase_12 | AC | 715 ms
64,972 KB |
testcase_13 | AC | 705 ms
66,104 KB |
testcase_14 | AC | 1,020 ms
84,528 KB |
testcase_15 | AC | 1,009 ms
82,364 KB |
testcase_16 | AC | 1,009 ms
81,956 KB |
testcase_17 | AC | 1,040 ms
82,916 KB |
testcase_18 | AC | 1,040 ms
84,012 KB |
testcase_19 | AC | 843 ms
73,428 KB |
testcase_20 | AC | 829 ms
71,724 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 { static readonly long Big = (long)1e9; public void Solve() { int N = Reader.Int(), M = Reader.Int(), Q = Reader.Int(); var EdgeId = new Dictionary<long, int>(); var E = new int[M][]; var RemovedEdge = new int[Q][]; var Removed = new bool[M]; for (int i = 0; i < M; i++) { int a = Reader.Int() - 1, b = Reader.Int() - 1; E[i] = new[] { a, b }; EdgeId[a * Big + b] = i; } for (int i = 0; i < Q; i++) { int a = Reader.Int() - 1, b = Reader.Int() - 1; RemovedEdge[i] = new[] { a, b }; Removed[EdgeId[a * Big + b]] = true; } var ans = new int[N]; var comp = new HashSet<int>[N]; var VtoComp = new int[N]; for (int i = 0; i < N; i++) { comp[i] = new HashSet<int>(new[] { i }); VtoComp[i] = i; } Action<int, int, int> Unite = (a, b, time) => { int ca = VtoComp[a], cb = VtoComp[b]; if (ca == cb) return; if (comp[ca].Count < comp[cb].Count) Swap(ref ca, ref cb); if (comp[cb].Contains(0)) foreach (int v in comp[ca]) ans[v] = time; var zero = comp[ca].Contains(0); foreach (int v in comp[cb]) { comp[ca].Add(v); VtoComp[v] = ca; if (zero) ans[v] = time; } }; for (int i = 0; i < M; i++) if (!Removed[i]) Unite(E[i][0], E[i][1], Q + 1); for (int i = Q - 1; i >= 0; i--) Unite(RemovedEdge[i][0], RemovedEdge[i][1], i + 1); ans.Skip(1).ToList().ForEach(a => Console.WriteLine(a == Q + 1 ? -1 : a)); } static void Swap<T>(ref T a, ref T b) { T t = a; a = b; b = t; } } 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; } }