結果

問題 No.943 取り調べ
ユーザー ひばちひばち
提出日時 2019-12-05 22:37:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 100 ms / 1,206 ms
コード長 5,860 bytes
コンパイル時間 1,014 ms
コンパイル使用メモリ 120,368 KB
実行使用メモリ 19,840 KB
最終ジャッジ日時 2024-06-02 07:55:46
合計ジャッジ時間 2,738 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
19,072 KB
testcase_01 AC 28 ms
19,328 KB
testcase_02 AC 28 ms
19,328 KB
testcase_03 AC 27 ms
19,200 KB
testcase_04 AC 60 ms
19,456 KB
testcase_05 AC 99 ms
19,456 KB
testcase_06 AC 100 ms
19,584 KB
testcase_07 AC 28 ms
19,328 KB
testcase_08 AC 58 ms
19,840 KB
testcase_09 AC 36 ms
19,072 KB
testcase_10 AC 34 ms
19,332 KB
testcase_11 AC 34 ms
19,156 KB
testcase_12 AC 28 ms
19,328 KB
testcase_13 AC 28 ms
19,328 KB
testcase_14 AC 29 ms
19,456 KB
testcase_15 AC 27 ms
19,328 KB
testcase_16 AC 29 ms
18,944 KB
testcase_17 AC 33 ms
19,332 KB
testcase_18 AC 27 ms
19,200 KB
testcase_19 AC 27 ms
19,200 KB
testcase_20 AC 27 ms
19,200 KB
testcase_21 AC 27 ms
19,328 KB
testcase_22 AC 35 ms
19,208 KB
testcase_23 AC 65 ms
19,840 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 static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;

class Solver
{
    Scanner sc = new Scanner();
    //
    int N;
    int[] X, A, dp;
    public void Solve()
    {
        N = sc.Int;
        X = new int[N];
        for(var i = 0; i < N; i++)
            for(var j=0;j<N;j++)
                X[i] += sc.Next<int>() << j;
        A = sc.ArrInt;
        dp = new int[1 << N];
        dp[(1 << N) - 1] = 1;
        for (var i = (1 << N) - 1; i >= 0; i--)
            if (dp[i] == 0)
                memo(i);
        var res = int.MaxValue;
        for(var i=0;i<(1<<N);i++)
            if (dp[i] == 1)
            {
                var c = 0;
                for (var j = 0; j < N; j++)
                    if ((1 & i >> j) == 1)
                        c += A[j];
                chmin(ref res, c);
            }
        WriteLine(res);
    }
    int memo(int s)
    {
        if (dp[s] != 0) return dp[s];
        for(var j = 0; j < N; j++)
        {
            var m = 1 << j;
            if ((s & m) > 0) continue;
            if ((X[j] ^ (X[j] & s)) == 0)
                if (memo(s ^ m) == 1) dp[s] = 1;
                
        }
        if (dp[s] == 0) dp[s] = -1;
        return dp[s];
    }
}

#region Template
public class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve();
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == 1) { num = val; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == -1) { num = val; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T v1, ref T v2)
    { var t = v2; v2 = v1; v1 = 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;
    }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}

public class Scanner
{
    public string Str => 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);
    public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());
    public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());
    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 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 Tie(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 Tie(out T1 a, out T2 b, out T3 c) { Tie(out a, out b); c = v3; }
}
#endregion
0