結果

問題 No.241 出席番号(1)
ユーザー eitaho
提出日時 2015-07-10 22:39:05
言語 C#
(csc 3.5.0-beta1-19606-04)
結果
AC  
実行時間 41 ms / 2,000 ms
コード長 3,617 Byte
コンパイル時間 1,067 ms
使用メモリ 10,836 KB
最終ジャッジ日時 2020-04-30 01:59:42

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 36 ms
10,728 KB
testcase_01 AC 36 ms
10,744 KB
testcase_02 AC 35 ms
10,772 KB
testcase_03 AC 36 ms
10,728 KB
testcase_04 AC 36 ms
10,776 KB
testcase_05 AC 35 ms
10,716 KB
testcase_06 AC 35 ms
10,724 KB
testcase_07 AC 35 ms
10,724 KB
testcase_08 AC 37 ms
10,720 KB
testcase_09 AC 37 ms
10,732 KB
testcase_10 AC 37 ms
10,732 KB
testcase_11 AC 36 ms
10,740 KB
testcase_12 AC 36 ms
10,736 KB
testcase_13 AC 37 ms
10,764 KB
testcase_14 AC 37 ms
10,820 KB
testcase_15 AC 36 ms
10,812 KB
testcase_16 AC 35 ms
10,744 KB
testcase_17 AC 36 ms
10,728 KB
testcase_18 AC 37 ms
10,716 KB
testcase_19 AC 36 ms
10,724 KB
testcase_20 AC 35 ms
10,712 KB
testcase_21 AC 36 ms
10,728 KB
testcase_22 AC 37 ms
10,724 KB
testcase_23 AC 37 ms
10,792 KB
testcase_24 AC 36 ms
10,824 KB
testcase_25 AC 37 ms
10,824 KB
testcase_26 AC 36 ms
10,824 KB
testcase_27 AC 35 ms
10,836 KB
testcase_28 AC 36 ms
10,816 KB
testcase_29 AC 36 ms
10,820 KB
testcase_30 AC 41 ms
10,820 KB
testcase_31 AC 36 ms
10,816 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.5.0-beta1-19606-04 (d2bd58c6)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

class Program
{
    public void Solve()
    {
        int N = Reader.Int();
        var Bad = Reader.IntArray(N);
        var matching = new BipartiteMatching(N * 2);

        for (int i = 0; i < N; i++)
            for (int d = 0; d < N; d++)
                if (d != Bad[i])
                    matching.AddEdge(i, N + d);
        int x = matching.Run();
        if (x < N)
            Console.WriteLine(-1);
        else
            for (int i = 0; i < N; i++)
                Console.WriteLine(matching.match[i] - N);
    }


    class BipartiteMatching
    {
        int V;
        List<int>[] G;
        public int[] match;
        bool[] seen;

        public BipartiteMatching(int V)
        {
            this.V = V;
            G = Enumerable.Range(0, V).Select(i => new List<int>()).ToArray();
            match = Enumerable.Repeat(-1, V).ToArray();
        }
        public void AddEdge(int a, int b)
        {
            G[a].Add(b);
            G[b].Add(a);
        }
        public int Run()
        {
            int res = 0;
            for (int i = 0; i < V; i++)
            {
                if (match[i] < 0)
                {
                    seen = new bool[V];
                    if (DFS(i)) res++;
                }
            }
            return res;
        }
        bool DFS(int v)
        {
            seen[v] = true;
            foreach (int next in G[v])
            {
                int m = match[next];
                if (m < 0 || !seen[m] && DFS(m))
                {
                    match[v] = next;
                    match[next] = v;
                    return true;
                }
            }
            return false;
        }
    }

}



class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    private static TextReader reader = Console.In;
    private static readonly char[] separator = { ' ' };
    private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    private static string[] A = new string[0];
    private static int i;
    private static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public static string Line() { return reader.ReadLine().Trim(); }
    private static string[] Split(string s) { return s.Split(separator, op); }
    private static string Next() { CheckNext(); return A[i++]; }
    private static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}
0