結果

問題 No.1640 簡単な色塗り
ユーザー yupiteru_kunyupiteru_kun
提出日時 2021-08-06 22:33:31
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 11,067 bytes
コンパイル時間 8,312 ms
コンパイル使用メモリ 146,572 KB
実行使用メモリ 52,636 KB
最終ジャッジ日時 2023-09-12 02:34:02
合計ジャッジ時間 23,184 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 62 ms
28,616 KB
testcase_01 AC 58 ms
25,752 KB
testcase_02 AC 61 ms
28,596 KB
testcase_03 AC 61 ms
28,596 KB
testcase_04 AC 120 ms
50,540 KB
testcase_05 AC 118 ms
52,308 KB
testcase_06 AC 62 ms
30,692 KB
testcase_07 AC 61 ms
28,452 KB
testcase_08 AC 62 ms
28,432 KB
testcase_09 AC 58 ms
25,716 KB
testcase_10 AC 112 ms
42,280 KB
testcase_11 AC 105 ms
39,840 KB
testcase_12 AC 98 ms
38,544 KB
testcase_13 AC 162 ms
48,444 KB
testcase_14 AC 157 ms
50,196 KB
testcase_15 AC 86 ms
35,628 KB
testcase_16 AC 90 ms
37,300 KB
testcase_17 AC 127 ms
45,688 KB
testcase_18 AC 67 ms
32,060 KB
testcase_19 AC 96 ms
40,160 KB
testcase_20 AC 110 ms
41,748 KB
testcase_21 AC 99 ms
41,556 KB
testcase_22 AC 64 ms
29,800 KB
testcase_23 AC 114 ms
42,940 KB
testcase_24 AC 74 ms
32,528 KB
testcase_25 AC 98 ms
38,692 KB
testcase_26 AC 123 ms
44,452 KB
testcase_27 AC 83 ms
35,328 KB
testcase_28 AC 152 ms
49,496 KB
testcase_29 AC 124 ms
44,332 KB
testcase_30 AC 65 ms
28,408 KB
testcase_31 AC 119 ms
43,596 KB
testcase_32 AC 109 ms
41,156 KB
testcase_33 AC 87 ms
36,204 KB
testcase_34 AC 97 ms
39,128 KB
testcase_35 AC 86 ms
36,240 KB
testcase_36 AC 65 ms
28,204 KB
testcase_37 AC 67 ms
29,472 KB
testcase_38 AC 109 ms
42,036 KB
testcase_39 AC 76 ms
32,488 KB
testcase_40 AC 78 ms
34,824 KB
testcase_41 AC 97 ms
41,276 KB
testcase_42 AC 79 ms
33,760 KB
testcase_43 AC 80 ms
34,292 KB
testcase_44 AC 81 ms
33,764 KB
testcase_45 AC 75 ms
32,144 KB
testcase_46 AC 65 ms
28,692 KB
testcase_47 AC 63 ms
27,820 KB
testcase_48 AC 109 ms
42,304 KB
testcase_49 AC 62 ms
28,484 KB
testcase_50 AC 57 ms
25,552 KB
testcase_51 AC 61 ms
28,648 KB
testcase_52 AC 180 ms
52,360 KB
testcase_53 AC 175 ms
52,636 KB
07_evil_01.txt AC 360 ms
77,412 KB
07_evil_02.txt AC 569 ms
237,696 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 127 ms).
.NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f
Copyright (C) Microsoft Corporation.All rights reserved.

  プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください
  main -> /home/judge/data/code/bin/Release/net6.0/main.dll
  main -> /home/judge/data/code/bin/Release/net6.0/publish/

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;

namespace Program
{
    public static class ProblemE
    {
        static bool SAIKI = false;
        static public int numberOfRandomCases = 0;
        static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
        {
        }
        static public void Solve()
        {
            var N = NN;
            var AB = Repeat(0, N).Select(_ => new { A = NN - 1, B = NN - 1 }).ToArray();
            var uf = new LIB_UnionFind<long>(Repeat(0L, N), (x, y) => x + y);
            foreach (var item in AB)
            {
                uf.Unite(item.A, item.B);
                uf.Set(item.A, uf.Calc(item.A) + 1);
            }
            var path = Repeat(0, N).Select(_ => new List<(long, long)>()).ToArray();
            var jisu = new long[N];
            for (var i = 0; i < N; ++i)
            {
                var item = AB[i];
                jisu[item.A]++;
                jisu[item.B]++;
                path[item.A].Add((item.B, i));
                path[item.B].Add((item.A, i));
            }
            for (var i = 0; i < N; ++i)
            {
                if (uf.Calc(i) < uf.Count(i))
                {
                    Console.WriteLine("No");
                    return;
                }
            }
            Console.WriteLine("Yes");
            var q = new Queue<long>();
            var done = new bool[N];
            for (var i = 0; i < N; ++i)
            {
                if (jisu[i] == 1)
                {
                    q.Enqueue(i);
                    done[i] = true;
                }
            }
            var ans = new long[N];
            ans.Fill(-1);
            for (var i = 0; i <= N; ++i)
            {
                while (q.Count > 0)
                {
                    var pop = q.Dequeue();
                    foreach (var item in path[pop])
                    {
                        if (ans[item.Item2] == -1)
                        {
                            ans[item.Item2] = pop;
                            if (--jisu[item.Item1] == 1)
                            {
                                q.Enqueue(item.Item1);
                                done[item.Item1] = true;
                            }
                            break;
                        }
                    }
                }
                if (i == N) break;
                if (!done[i]) q.Enqueue(i);
            }
            for (var i = 0; i < N; ++i)
            {
                Console.WriteLine(ans[i] + 1);
            }
        }
        class Printer : StreamWriter
        {
            public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
            public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
            public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
        }
        static LIB_FastIO fastio = new LIB_FastIODebug();
        static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
        static long NN => fastio.Long();
        static double ND => fastio.Double();
        static string NS => fastio.Scan();
        static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
        static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
        static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
        static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
        static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
        static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
        static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
        static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
        static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
        static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
        static IEnumerator<uint> _xsi = _xsc();
        static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
        static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; }
        static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
        static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);
        static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);
        static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);
        static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);
    }
}
namespace Library {
    class LIB_FastIO
    {
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIO() { str = Console.OpenStandardInput(); }
        readonly Stream str;
        readonly byte[] buf = new byte[2048];
        int len, ptr;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        byte read()
        {
            if (ptr >= len)
            {
                ptr = 0;
                if ((len = str.Read(buf, 0, 2048)) <= 0)
                {
                    return 0;
                }
            }
            return buf[ptr++];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        char Char()
        {
            byte b = 0;
            do b = read();
            while (b < 33 || 126 < b);
            return (char)b;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public long Long()
        {
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = (ret << 3) + (ret << 1) + b - '0';
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
    class LIB_FastIODebug : LIB_FastIO
    {
        Queue<string> param = new Queue<string>();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIODebug() { }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override string Scan() => NextString();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override long Long() => long.Parse(NextString());
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override double Double() => double.Parse(NextString());
    }
    class LIB_UnionFind<T>
    {
        int[] d;
        T[] v;
        Func<T, T, T> f;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_UnionFind(IEnumerable<T> s, Func<T, T, T> func)
        {
            v = s.ToArray();
            d = Enumerable.Repeat(-1, v.Length).ToArray();
            f = func;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public bool Unite(long x, long y)
        {
            x = Root(x);
            y = Root(y);
            if (x != y)
            {
                d[x] = d[x] + d[y];
                v[x] = f(v[x], v[y]);
                d[y] = (int)x;
            }
            return x != y;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public bool IsSame(long x, long y) => Root(x) == Root(y);
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public long Root(long x) => d[x] < 0 ? x : d[x] = (int)Root(d[x]);
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public long Count(long x) => -d[Root(x)];
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public T Calc(long x) => v[Root(x)];
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public void Set(long x, T val) => v[Root(x)] = val;
    }
    class LIB_UnionFind : LIB_UnionFind<int>
    {
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_UnionFind(long n) : base(Enumerable.Repeat(0, (int)n), (x, y) => x + y) { }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        new private void Calc(long x) { }
    }
}
0