結果

問題 No.100 直列あみだくじ
ユーザー ひばちひばち
提出日時 2020-02-25 03:39:25
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 34 ms / 5,000 ms
コード長 6,043 bytes
コンパイル時間 3,318 ms
コンパイル使用メモリ 120,744 KB
実行使用メモリ 27,128 KB
最終ジャッジ日時 2024-04-21 06:43:30
合計ジャッジ時間 6,506 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
26,944 KB
testcase_01 AC 33 ms
24,836 KB
testcase_02 AC 33 ms
24,828 KB
testcase_03 AC 32 ms
25,220 KB
testcase_04 AC 33 ms
26,628 KB
testcase_05 AC 31 ms
24,772 KB
testcase_06 AC 31 ms
24,636 KB
testcase_07 AC 32 ms
22,840 KB
testcase_08 AC 33 ms
24,876 KB
testcase_09 AC 32 ms
26,876 KB
testcase_10 AC 33 ms
24,832 KB
testcase_11 AC 30 ms
24,892 KB
testcase_12 AC 31 ms
24,876 KB
testcase_13 AC 32 ms
26,920 KB
testcase_14 AC 32 ms
26,944 KB
testcase_15 AC 32 ms
22,708 KB
testcase_16 AC 31 ms
25,004 KB
testcase_17 AC 33 ms
25,136 KB
testcase_18 AC 33 ms
27,068 KB
testcase_19 AC 32 ms
24,840 KB
testcase_20 AC 32 ms
26,676 KB
testcase_21 AC 31 ms
24,708 KB
testcase_22 AC 31 ms
25,156 KB
testcase_23 AC 31 ms
24,960 KB
testcase_24 AC 30 ms
26,824 KB
testcase_25 AC 30 ms
24,896 KB
testcase_26 AC 30 ms
24,968 KB
testcase_27 AC 33 ms
27,128 KB
testcase_28 AC 33 ms
24,840 KB
testcase_29 AC 33 ms
24,580 KB
testcase_30 AC 33 ms
25,004 KB
testcase_31 AC 33 ms
27,008 KB
testcase_32 AC 31 ms
25,136 KB
testcase_33 AC 30 ms
24,956 KB
testcase_34 AC 30 ms
24,708 KB
testcase_35 AC 30 ms
24,960 KB
testcase_36 AC 30 ms
24,836 KB
testcase_37 AC 31 ms
24,880 KB
testcase_38 AC 33 ms
24,704 KB
testcase_39 AC 33 ms
25,008 KB
testcase_40 AC 33 ms
24,700 KB
testcase_41 AC 32 ms
27,064 KB
testcase_42 AC 32 ms
25,096 KB
testcase_43 AC 32 ms
27,060 KB
testcase_44 AC 33 ms
24,584 KB
testcase_45 AC 33 ms
26,868 KB
testcase_46 AC 34 ms
24,836 KB
testcase_47 AC 34 ms
26,680 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.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Numerics;
using static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var N = sc.Int; var P = new int[N];
        for (int i = 0; i < N; i++) P[i] = sc.Next<int>() - 1;
        var gr = Create(N + 1, () => -1);
        var use = new bool[N];
        for (int i = 0; i < N; i++)
            if (!use[i])
            {
                var l = new List<int>();
                var x = i;
                while (!use[x])
                {
                    use[x] = true;
                    l.Add(x);
                    x = P[x];
                }
                if (l.Count % 2 == 0)
                {
                    if (gr[l.Count] == -1) { gr[l.Count] = l[0]; continue; }
                    gr[l.Count] = -1;
                    continue;
                }
            }
        if (gr.Any(a => a != -1)) Fail("No");

        Console.WriteLine("Yes");
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T Unify<T>(this T[] A, Func<T, T, T> f, T init = default(T)) { for (var i = 0; i < A.Length; i++) init = f(init, A[i]); return init; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static U Unify<T, U>(this T[] A, Func<U, T, U> f, U init = default(U)) { for (int i = 0; i < A.Length; i++) init = f(init, A[i]);return init; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}

public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion
0