結果

問題 No.783 門松計画
ユーザー EmKjpEmKjp
提出日時 2019-04-30 23:44:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 158 ms / 2,000 ms
コード長 4,505 bytes
コンパイル時間 4,585 ms
コンパイル使用メモリ 113,540 KB
実行使用メモリ 29,184 KB
最終ジャッジ日時 2024-07-23 12:22:47
合計ジャッジ時間 3,168 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
23,216 KB
testcase_01 AC 43 ms
24,944 KB
testcase_02 AC 34 ms
25,008 KB
testcase_03 AC 30 ms
25,184 KB
testcase_04 AC 30 ms
27,096 KB
testcase_05 AC 33 ms
25,040 KB
testcase_06 AC 31 ms
26,728 KB
testcase_07 AC 31 ms
26,964 KB
testcase_08 AC 29 ms
23,352 KB
testcase_09 AC 32 ms
25,032 KB
testcase_10 AC 61 ms
25,344 KB
testcase_11 AC 158 ms
29,184 KB
testcase_12 AC 84 ms
27,164 KB
testcase_13 AC 57 ms
27,256 KB
testcase_14 AC 55 ms
27,008 KB
testcase_15 AC 37 ms
25,168 KB
testcase_16 AC 34 ms
25,256 KB
testcase_17 AC 51 ms
27,388 KB
testcase_18 AC 33 ms
27,248 KB
testcase_19 AC 47 ms
29,068 KB
testcase_20 AC 37 ms
25,036 KB
testcase_21 AC 33 ms
23,088 KB
testcase_22 AC 33 ms
25,100 KB
testcase_23 AC 35 ms
25,284 KB
testcase_24 AC 40 ms
24,968 KB
testcase_25 AC 40 ms
27,008 KB
testcase_26 AC 50 ms
25,108 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.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;


partial class Solver
{
    static public void UpdateMax<T>(ref T x, T newValue) where T : IComparable<T>
    {
        if (x.CompareTo(newValue) < 0) x = newValue;
    }


    public void Run()
    {
        var N = ni();
        var C = ni();
        var L = ni(N);
        var W = ni(N);

        var dp = new int[51, 51, C + 1]; // prevNum2, prevNum, cost

        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j < N; j++)
            {
                for (int k = 0; k < N; k++)
                {
                    if (W[i] + W[j] + W[k] <= C && L[i] != L[j] && L[i] != L[k] && L[j] != L[k] &&
                        ((L[i] > L[j] && L[j] < L[k]) || (L[i] < L[j] && L[j] > L[k])))
                    {
                        UpdateMax(ref dp[L[j], L[k], W[i] + W[j] + W[k]], L[i] + L[j] + L[k]);
                    }
                }
            }
        }

        for (int c = 0; c <= C; c++)
        {
            for (int prevNum2 = 0; prevNum2 < 51; prevNum2++)
            {
                for (int prevNum = 0; prevNum < 51; prevNum++)
                {
                    if (dp[prevNum2, prevNum, c] == 0) continue;
                    for (int i = 0; i < N; i++)
                    {
                        if (prevNum == L[i]) continue;
                        if (prevNum2 == L[i]) continue;
                        if (prevNum2 > prevNum && prevNum >= L[i]) continue;
                        if (prevNum2 < prevNum && prevNum <= L[i]) continue;
                        if (c + W[i] > C) continue;
                        UpdateMax(ref dp[prevNum, L[i], c + W[i]], dp[prevNum2, prevNum, c] + L[i]);
                    }
                }
            }
        }

        cout.WriteLine(dp.Cast<int>().Max());
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

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

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}

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

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

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

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

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        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 bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0