結果
問題 | No.416 旅行会社 |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-08-26 22:42:23 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 378 ms / 4,000 ms |
コード長 | 6,897 bytes |
コンパイル時間 | 1,317 ms |
コンパイル使用メモリ | 116,544 KB |
実行使用メモリ | 56,192 KB |
最終ジャッジ日時 | 2024-12-14 19:44:23 |
合計ジャッジ時間 | 6,589 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 171 ms
46,244 KB |
testcase_01 | AC | 30 ms
25,188 KB |
testcase_02 | AC | 29 ms
25,056 KB |
testcase_03 | AC | 29 ms
23,092 KB |
testcase_04 | AC | 29 ms
26,856 KB |
testcase_05 | AC | 29 ms
25,056 KB |
testcase_06 | AC | 29 ms
24,808 KB |
testcase_07 | AC | 31 ms
25,136 KB |
testcase_08 | AC | 33 ms
25,044 KB |
testcase_09 | AC | 42 ms
24,888 KB |
testcase_10 | AC | 188 ms
45,984 KB |
testcase_11 | AC | 170 ms
47,124 KB |
testcase_12 | AC | 170 ms
44,968 KB |
testcase_13 | AC | 162 ms
47,144 KB |
testcase_14 | AC | 363 ms
55,876 KB |
testcase_15 | AC | 378 ms
55,752 KB |
testcase_16 | AC | 366 ms
56,192 KB |
testcase_17 | AC | 373 ms
55,872 KB |
testcase_18 | AC | 362 ms
53,580 KB |
testcase_19 | AC | 263 ms
46,924 KB |
testcase_20 | AC | 258 ms
46,932 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.Linq; using System.Linq.Expressions; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Number = System.Int64; namespace Program { public class Solver { public void Solve() { var n = sc.Integer(); var m = sc.Integer(); var q = sc.Integer(); var a = new int[m]; var b = new int[m]; var c = new int[q]; var d = new int[q]; var use = new SortedSet<long>(); var s = new WeighedQuickUnion(n); for (int i = 0; i < m; i++) { a[i] = sc.Integer() - 1; b[i] = sc.Integer() - 1; if (a[i] > b[i]) Swap(ref a[i], ref b[i]); } for (int i = 0; i < q; i++) { c[i] = sc.Integer() - 1; d[i] = sc.Integer() - 1; if (c[i] > d[i]) Swap(ref c[i], ref d[i]); } for (int i = 0; i < q; i++) use.Add(c[i] * 1000000L + d[i]); for (int i = 0; i < m; i++) { if (use.Contains(a[i] * 1000000L + b[i])) continue; s.Unite(a[i], b[i]); } var ans = new int[n]; for (int i = 0; i < n; i++) if (s.Same(i, 0)) ans[i] = -1; for (int i = q - 1; i >= 0; i--) { if (!s.Same(c[i], d[i])) { if (s.Same(d[i], 0)) foreach (var x in s.group[c[i]]) { Debug.Assert(ans[x] == 0); ans[x] = i + 1; } if (s.Same(c[i], 0)) foreach (var x in s.group[d[i]]) { Debug.Assert(ans[x] == 0); ans[x] = i + 1; } s.Unite(c[i], d[i]); } } for (int i = 1; i < n; i++) IO.Printer.Out.WriteLine(ans[i]); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer: StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b)); if (b == 0) return long.MinValue; if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; } private T[] enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion #region WeightedQuickUnion public class WeighedQuickUnion { public List<int>[] group; public WeighedQuickUnion(int n) { group = new List<int>[n]; for (int i = 0; i < n; i++) group[i] = new List<int>() { i }; } public void Unite(int i, int j) { if (Same(i, j)) return; var a = group[i]; var b = group[j]; if (a.Count < b.Count) { var tmp = a; a = b; b = tmp; } foreach (var x in b) { group[x] = a; a.Add(x); } } public bool Same(int i, int j) { return group[i] == group[j]; } } #endregion