結果

問題 No.812 Change of Class
ユーザー りあんりあん
提出日時 2019-04-12 22:13:46
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 804 ms / 4,000 ms
コード長 7,378 bytes
コンパイル時間 1,133 ms
コンパイル使用メモリ 123,168 KB
実行使用メモリ 57,620 KB
最終ジャッジ日時 2024-06-12 18:44:47
合計ジャッジ時間 19,353 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 377 ms
46,240 KB
testcase_01 AC 82 ms
33,156 KB
testcase_02 AC 213 ms
38,388 KB
testcase_03 AC 443 ms
44,416 KB
testcase_04 AC 397 ms
48,160 KB
testcase_05 AC 734 ms
49,048 KB
testcase_06 AC 541 ms
48,236 KB
testcase_07 AC 36 ms
29,064 KB
testcase_08 AC 32 ms
26,160 KB
testcase_09 AC 675 ms
46,972 KB
testcase_10 AC 701 ms
51,416 KB
testcase_11 AC 91 ms
48,940 KB
testcase_12 AC 443 ms
46,376 KB
testcase_13 AC 28 ms
26,920 KB
testcase_14 AC 29 ms
25,012 KB
testcase_15 AC 438 ms
48,416 KB
testcase_16 AC 52 ms
31,548 KB
testcase_17 AC 401 ms
48,596 KB
testcase_18 AC 298 ms
41,260 KB
testcase_19 AC 336 ms
46,456 KB
testcase_20 AC 804 ms
46,488 KB
testcase_21 AC 284 ms
42,656 KB
testcase_22 AC 137 ms
32,344 KB
testcase_23 AC 46 ms
29,528 KB
testcase_24 AC 58 ms
30,204 KB
testcase_25 AC 116 ms
35,372 KB
testcase_26 AC 575 ms
46,244 KB
testcase_27 AC 484 ms
48,204 KB
testcase_28 AC 329 ms
46,052 KB
testcase_29 AC 91 ms
31,624 KB
testcase_30 AC 428 ms
44,088 KB
testcase_31 AC 356 ms
44,124 KB
testcase_32 AC 165 ms
36,744 KB
testcase_33 AC 461 ms
46,828 KB
testcase_34 AC 55 ms
29,940 KB
testcase_35 AC 104 ms
32,568 KB
testcase_36 AC 61 ms
27,756 KB
testcase_37 AC 233 ms
35,880 KB
testcase_38 AC 44 ms
31,980 KB
testcase_39 AC 240 ms
40,104 KB
testcase_40 AC 77 ms
33,248 KB
testcase_41 AC 40 ms
31,560 KB
testcase_42 AC 498 ms
40,988 KB
testcase_43 AC 109 ms
38,516 KB
testcase_44 AC 356 ms
39,184 KB
testcase_45 AC 63 ms
29,500 KB
testcase_46 AC 104 ms
44,384 KB
testcase_47 AC 345 ms
37,136 KB
testcase_48 AC 415 ms
41,992 KB
testcase_49 AC 118 ms
31,780 KB
testcase_50 AC 33 ms
27,188 KB
testcase_51 AC 113 ms
34,156 KB
testcase_52 AC 200 ms
40,956 KB
testcase_53 AC 86 ms
30,920 KB
testcase_54 AC 80 ms
30,708 KB
testcase_55 AC 322 ms
50,568 KB
testcase_56 AC 390 ms
56,172 KB
testcase_57 AC 408 ms
57,620 KB
testcase_58 AC 225 ms
50,220 KB
testcase_59 AC 455 ms
57,176 KB
testcase_60 AC 28 ms
25,008 KB
testcase_61 AC 30 ms
25,228 KB
testcase_62 AC 29 ms
25,020 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Linq;
using System.Linq.Expressions;
using System.IO;
using System.Text;
using System.Diagnostics;

using static util;
using P = pair<int, int>;

using Binary = System.Func<System.Linq.Expressions.ParameterExpression,
                           System.Linq.Expressions.ParameterExpression,
                           System.Linq.Expressions.BinaryExpression>;
using Unary = System.Func<System.Linq.Expressions.ParameterExpression,
                          System.Linq.Expressions.UnaryExpression>;

class Program {
    static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
    static Scan sc = new Scan();
    const int M = 1000000007;
    const int M2 = 998244353;
    const long LM = 1L << 60;
    const double eps = 1e-11;
    static readonly int[] dd = { 0, 1, 0, -1, 0 };
    const string dstring = "RDLU";
    static void Main(string[] args)
    {
        int n, m;
        sc.Multi(out n, out m);
        var edge = new List<int>[n];
        for (int i = 0; i < n; i++)
        {
            edge[i] = new List<int>();
        }
        for (int i = 0; i < m; i++)
        {
            int a, b;
            sc.Multi(out a, out b);
            --a;
            --b;
            edge[a].Add(b);
            edge[b].Add(a);
        }
        int que = sc.Int;
        for (int _ = 0; _ < que; _++)
        {
            int a = sc.Int;
            --a;
            var dist = new int[n];
            for (int i = 0; i < n; i++)
            {
                dist[i] = M;
            }
            var q = new Queue<int>();
            q.Enqueue(a);
            dist[a] = 0;
            int c = 0, ma = 0;
            while (q.Any())
            {
                int p = q.Dequeue();
                foreach (var item in edge[p])
                {
                    if (dist[item] > dist[p] + 1) {
                        dist[item] = dist[p] + 1;
                        q.Enqueue(item);
                        ++c;
                        ma = Math.Max(ma, dist[item]);
                    }
                }
            }
            int ans = 0;
            while ((1 << ans) < ma) ++ans;
            Prt(c, ans);

        }
        sw.Flush();
    }

    static void DBG(string a) => Console.WriteLine(a);
    static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    static void DBG(params object[] a) => DBG(string.Join(" ", a));
    static void Prt(string a) => sw.WriteLine(a);
    static void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    static void Prt(params object[] a) => Prt(string.Join(" ", a));
}
class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
    public static bool operator>(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) > 0;
    public static bool operator<(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) < 0;
    public static bool operator>=(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) >= 0;
    public static bool operator<=(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) <= 0;
}
static class util {
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static T sq<T>(T a) => Operator<T>.Multiply(a, a);
    public static T Max<T>(params T[] a) => a.Max();
    public static T Min<T>(params T[] a) => a.Min();
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    public static void Assert(bool cond) { if (!cond) throw new Exception(); }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}
static class Operator<T> {
    static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x");
    static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y");
    public static readonly Func<T, T, T> Add = Lambda(Expression.Add);
    public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract);
    public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply);
    public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide);
    public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus);
    public static readonly Func<T, T> Negate = Lambda(Expression.Negate);
    public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile();
    public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile();
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}
0