結果
問題 | No.783 門松計画 |
ユーザー | EmKjp |
提出日時 | 2019-05-01 00:06:18 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 432 ms / 2,000 ms |
コード長 | 4,425 bytes |
コンパイル時間 | 973 ms |
コンパイル使用メモリ | 117,708 KB |
実行使用メモリ | 31,404 KB |
最終ジャッジ日時 | 2024-07-23 12:22:54 |
合計ジャッジ時間 | 3,386 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
25,048 KB |
testcase_01 | AC | 45 ms
26,992 KB |
testcase_02 | AC | 37 ms
29,228 KB |
testcase_03 | AC | 29 ms
25,264 KB |
testcase_04 | AC | 32 ms
27,216 KB |
testcase_05 | AC | 35 ms
25,136 KB |
testcase_06 | AC | 33 ms
27,256 KB |
testcase_07 | AC | 32 ms
25,180 KB |
testcase_08 | AC | 30 ms
25,416 KB |
testcase_09 | AC | 34 ms
25,040 KB |
testcase_10 | AC | 73 ms
31,404 KB |
testcase_11 | AC | 432 ms
29,240 KB |
testcase_12 | AC | 150 ms
29,340 KB |
testcase_13 | AC | 64 ms
29,084 KB |
testcase_14 | AC | 61 ms
29,336 KB |
testcase_15 | AC | 38 ms
25,308 KB |
testcase_16 | AC | 36 ms
25,440 KB |
testcase_17 | AC | 52 ms
27,292 KB |
testcase_18 | AC | 33 ms
25,296 KB |
testcase_19 | AC | 48 ms
29,196 KB |
testcase_20 | AC | 38 ms
27,324 KB |
testcase_21 | AC | 35 ms
23,096 KB |
testcase_22 | AC | 33 ms
25,100 KB |
testcase_23 | AC | 37 ms
25,152 KB |
testcase_24 | AC | 41 ms
29,196 KB |
testcase_25 | AC | 39 ms
25,072 KB |
testcase_26 | AC | 52 ms
29,076 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; using System.Runtime.InteropServices; partial class Solver { static public void UpdateMax<T>(ref T x, T newValue) where T : IComparable<T> { var a = Marshal.SizeOf(4); if (x.CompareTo(newValue) < 0) x = newValue; } bool IsKadomatsu(int a, int b, int c) { if (a == c) return false; return (a < b && b > c) || (a > b && b < c); } 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 && IsKadomatsu(L[i], 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 (!IsKadomatsu(prevNum2, 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; } } }