結果

問題 No.416 旅行会社
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-08-26 22:34:17
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 6,731 bytes
コンパイル時間 3,419 ms
コンパイル使用メモリ 110,080 KB
実行使用メモリ 71,420 KB
最終ジャッジ日時 2024-11-08 09:31:00
合計ジャッジ時間 15,492 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 -- -
testcase_02 -- -
testcase_03 -- -
testcase_04 -- -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #

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 HashSet<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]);
                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(c[i], 0))
                    {
                        foreach (var x in s.group[c[i]])
                            ans[x] = i + 1;
                    }
                    if (!s.Same(d[i], 0))
                    {
                        foreach (var x in s.group[d[i]])
                            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
0