結果
問題 | No.115 遠足のおやつ |
ユーザー | mban |
提出日時 | 2017-01-12 08:27:13 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 2,420 ms / 5,000 ms |
コード長 | 2,681 bytes |
コンパイル時間 | 2,255 ms |
コンパイル使用メモリ | 109,748 KB |
実行使用メモリ | 333,640 KB |
最終ジャッジ日時 | 2023-08-31 00:42:52 |
合計ジャッジ時間 | 15,321 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
22,912 KB |
testcase_01 | AC | 63 ms
23,140 KB |
testcase_02 | AC | 66 ms
25,968 KB |
testcase_03 | AC | 60 ms
23,016 KB |
testcase_04 | AC | 525 ms
102,536 KB |
testcase_05 | AC | 62 ms
25,092 KB |
testcase_06 | AC | 61 ms
20,968 KB |
testcase_07 | AC | 65 ms
23,900 KB |
testcase_08 | AC | 69 ms
22,784 KB |
testcase_09 | AC | 170 ms
46,644 KB |
testcase_10 | AC | 254 ms
63,692 KB |
testcase_11 | AC | 63 ms
21,532 KB |
testcase_12 | AC | 183 ms
47,708 KB |
testcase_13 | AC | 61 ms
23,276 KB |
testcase_14 | AC | 70 ms
24,444 KB |
testcase_15 | AC | 309 ms
68,492 KB |
testcase_16 | AC | 440 ms
83,800 KB |
testcase_17 | AC | 150 ms
44,144 KB |
testcase_18 | AC | 61 ms
25,376 KB |
testcase_19 | AC | 72 ms
27,572 KB |
testcase_20 | AC | 67 ms
23,984 KB |
testcase_21 | AC | 123 ms
40,096 KB |
testcase_22 | AC | 266 ms
64,364 KB |
testcase_23 | AC | 66 ms
24,472 KB |
testcase_24 | AC | 193 ms
49,904 KB |
testcase_25 | AC | 145 ms
44,352 KB |
testcase_26 | AC | 98 ms
34,268 KB |
testcase_27 | AC | 118 ms
38,104 KB |
testcase_28 | AC | 105 ms
37,180 KB |
testcase_29 | AC | 155 ms
45,832 KB |
testcase_30 | AC | 216 ms
55,528 KB |
testcase_31 | AC | 197 ms
51,328 KB |
testcase_32 | AC | 383 ms
81,264 KB |
testcase_33 | AC | 103 ms
31,776 KB |
testcase_34 | AC | 522 ms
100,516 KB |
testcase_35 | AC | 235 ms
59,412 KB |
testcase_36 | AC | 158 ms
43,228 KB |
testcase_37 | AC | 450 ms
86,668 KB |
testcase_38 | AC | 2,310 ms
310,868 KB |
testcase_39 | AC | 2,420 ms
333,640 KB |
testcase_40 | AC | 60 ms
22,932 KB |
testcase_41 | AC | 62 ms
23,120 KB |
testcase_42 | AC | 62 ms
22,980 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.Collections; using System.Collections.Generic; using System.Collections.Specialized; using System.Text; using System.Text.RegularExpressions; using System.Linq; using System.IO; class Program { static private Magatro M = new Magatro(); static private void Main(string[]args) { M.Scan(); M.Solve(); } } public class Scanner { private string[] S; private int Index; private char Separator; public Scanner(char separator = ' ') { Index = 0; Separator = separator; } private string[] Line() { return Console.ReadLine().Split(Separator); } public string Next() { string result; if (S == null || Index >= S.Length) { S = Line(); Index = 0; } result = S[Index]; Index++; return result; } public int NextInt() { return int.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } } public class Magatro { private int N, D, K; public void Scan() { Scanner sc = new Scanner(); N = sc.NextInt(); D = sc.NextInt(); K = sc.NextInt(); } public void Solve() { //合計,N個目,N個買った Count[,,] dp = new Count[1001, 101, 101]; dp[0, 0, 0].Buy = new List<int>(); for (int i = 1; i <= N; i++) { for (int j = 0; j <= D; j++) { for (int k = 0; k < i; k++) { if (dp[j, i - 1, k].Buy == null) continue; Count cp = dp[j, i - 1, k].Copy(); dp[j, i, k] = Min(dp[j, i, k], cp); cp.Buy.Add(i); if (j + i > D) continue; dp[j + i, i, k + 1] = Min(cp, dp[j + i, i, k + 1]); } } } List<int> ans = dp[D, N, K].Buy; if (ans == null || ans.Count == 0) Console.WriteLine(-1); else Console.WriteLine(string.Join(" ",ans)); } private Count Min(Count a, Count b) { if (a.Buy == null) return b.Copy(); if (b.Buy == null) return a.Copy(); for (int i = 0; i < a.Buy.Count; i++) { if (a.Buy[i] < b.Buy[i]) return a.Copy(); else if (a.Buy[i] > b.Buy[i]) return b.Copy(); } return a.Copy(); } } public struct Count { public List<int> Buy; public Count Copy() { Count ret; ret.Buy = Buy.ToList(); return ret; } }