結果

問題 No.783 門松計画
ユーザー EmKjpEmKjp
提出日時 2019-04-30 23:44:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 175 ms / 2,000 ms
コード長 4,505 bytes
コンパイル時間 2,232 ms
コンパイル使用メモリ 111,036 KB
実行使用メモリ 25,820 KB
最終ジャッジ日時 2023-09-30 18:44:08
合計ジャッジ時間 5,338 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
23,688 KB
testcase_01 AC 77 ms
19,672 KB
testcase_02 AC 65 ms
21,724 KB
testcase_03 AC 60 ms
21,696 KB
testcase_04 AC 62 ms
21,620 KB
testcase_05 AC 67 ms
21,544 KB
testcase_06 AC 62 ms
21,620 KB
testcase_07 AC 62 ms
21,672 KB
testcase_08 AC 61 ms
21,500 KB
testcase_09 AC 65 ms
21,568 KB
testcase_10 AC 93 ms
23,684 KB
testcase_11 AC 175 ms
23,788 KB
testcase_12 AC 113 ms
23,620 KB
testcase_13 AC 88 ms
23,608 KB
testcase_14 AC 89 ms
23,616 KB
testcase_15 AC 68 ms
21,584 KB
testcase_16 AC 66 ms
21,696 KB
testcase_17 AC 83 ms
25,820 KB
testcase_18 AC 64 ms
23,720 KB
testcase_19 AC 79 ms
23,740 KB
testcase_20 AC 68 ms
19,724 KB
testcase_21 AC 66 ms
21,700 KB
testcase_22 AC 66 ms
21,596 KB
testcase_23 AC 67 ms
23,604 KB
testcase_24 AC 72 ms
21,632 KB
testcase_25 AC 70 ms
21,740 KB
testcase_26 AC 82 ms
23,868 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