結果

問題 No.914 Omiyage
ユーザー EmKjpEmKjp
提出日時 2019-10-25 21:28:59
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 4,824 bytes
コンパイル時間 834 ms
コンパイル使用メモリ 113,768 KB
実行使用メモリ 26,220 KB
最終ジャッジ日時 2024-09-24 16:23:09
合計ジャッジ時間 1,978 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
23,920 KB
testcase_01 AC 25 ms
26,220 KB
testcase_02 AC 24 ms
25,900 KB
testcase_03 AC 24 ms
24,180 KB
testcase_04 AC 24 ms
24,104 KB
testcase_05 AC 23 ms
24,048 KB
testcase_06 AC 24 ms
24,180 KB
testcase_07 AC 24 ms
26,212 KB
testcase_08 AC 25 ms
23,984 KB
testcase_09 AC 25 ms
24,236 KB
testcase_10 AC 24 ms
26,024 KB
testcase_11 AC 23 ms
24,108 KB
testcase_12 AC 25 ms
26,220 KB
testcase_13 AC 25 ms
24,048 KB
testcase_14 AC 24 ms
23,996 KB
testcase_15 AC 24 ms
24,048 KB
testcase_16 AC 24 ms
24,248 KB
testcase_17 AC 24 ms
24,244 KB
testcase_18 AC 23 ms
25,896 KB
testcase_19 AC 23 ms
25,900 KB
testcase_20 AC 24 ms
26,028 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.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var m = ni();
        var k = ni();
        var A = new int[n, m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i, j] = ni();
            }
        }

        var dp = new bool[k + 1];
        dp[0] = true;
        for (int i = 0; i < n; i++) {
            var next = new bool[k + 1];

            for (int j = 0; j < m; j++) {
                var cost = A[i, j];
                for (int p = 0; p <= k; p++) {
                    if (p >= cost) {
                        next[p] |= dp[p - cost];
                    }
                }
            }

            dp = next;
            //dp.Dump();
        }
        int ans = int.MaxValue;
        for (int i = 0; i < dp.Length; i++) {
            if (dp[i]) ans = k - i;
        }
        if (ans == int.MaxValue) ans = -1;
        cout.WriteLine(ans);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}
0