結果
問題 | No.286 Modulo Discount Store |
ユーザー | EmKjp |
提出日時 | 2019-05-12 16:39:24 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 32 ms / 2,000 ms |
コード長 | 3,720 bytes |
コンパイル時間 | 2,370 ms |
コンパイル使用メモリ | 113,448 KB |
実行使用メモリ | 18,304 KB |
最終ジャッジ日時 | 2024-07-04 17:26:42 |
合計ジャッジ時間 | 4,775 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
18,304 KB |
testcase_01 | AC | 23 ms
18,304 KB |
testcase_02 | AC | 25 ms
18,176 KB |
testcase_03 | AC | 22 ms
18,048 KB |
testcase_04 | AC | 24 ms
18,048 KB |
testcase_05 | AC | 23 ms
17,792 KB |
testcase_06 | AC | 27 ms
18,176 KB |
testcase_07 | AC | 22 ms
18,048 KB |
testcase_08 | AC | 23 ms
17,920 KB |
testcase_09 | AC | 23 ms
18,176 KB |
testcase_10 | AC | 24 ms
18,048 KB |
testcase_11 | AC | 23 ms
17,920 KB |
testcase_12 | AC | 23 ms
18,176 KB |
testcase_13 | AC | 25 ms
18,304 KB |
testcase_14 | AC | 23 ms
17,920 KB |
testcase_15 | AC | 25 ms
18,304 KB |
testcase_16 | AC | 25 ms
17,920 KB |
testcase_17 | AC | 32 ms
18,176 KB |
testcase_18 | AC | 24 ms
18,048 KB |
testcase_19 | AC | 22 ms
18,176 KB |
testcase_20 | AC | 24 ms
17,920 KB |
testcase_21 | AC | 23 ms
17,920 KB |
testcase_22 | AC | 24 ms
18,304 KB |
testcase_23 | AC | 26 ms
18,304 KB |
testcase_24 | AC | 22 ms
18,048 KB |
testcase_25 | AC | 23 ms
18,176 KB |
testcase_26 | AC | 23 ms
17,792 KB |
testcase_27 | AC | 27 ms
18,176 KB |
testcase_28 | AC | 27 ms
18,304 KB |
testcase_29 | AC | 23 ms
18,176 KB |
testcase_30 | AC | 23 ms
17,920 KB |
testcase_31 | AC | 23 ms
18,176 KB |
testcase_32 | AC | 22 ms
17,920 KB |
testcase_33 | AC | 22 ms
18,048 KB |
testcase_34 | AC | 24 ms
18,048 KB |
testcase_35 | AC | 24 ms
18,176 KB |
testcase_36 | AC | 24 ms
17,920 KB |
testcase_37 | AC | 24 ms
17,920 KB |
testcase_38 | AC | 23 ms
18,176 KB |
testcase_39 | AC | 28 ms
18,048 KB |
testcase_40 | AC | 23 ms
18,048 KB |
testcase_41 | AC | 23 ms
18,304 KB |
testcase_42 | AC | 24 ms
18,304 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.Generic; using System.Globalization; using System.IO; using System.Linq; partial class Solver { static public bool UpdateMin<T>(ref T x, T newValue) where T : IComparable<T> { if (x.CompareTo(newValue) > 0) { x = newValue; return true; } return false; } public void Run() { var n = ni(); var M = ni(n); var dp = new int[1 << n]; for (int i = 0; i < dp.Length; i++) { dp[i] = int.MaxValue; } dp[0] = 0; for (int i = 0; i < (1 << n); i++) { int sum = 0; for (int j = 0; j < n; j++) { if ((i & (1 << j)) != 0) { sum += M[j]; } } for (int j = 0; j < n; j++) { if ((i & (1 << j)) != 0) continue; var cost = M[j]; UpdateMin(ref dp[i | (1 << j)], dp[i] + Math.Max(0, cost - sum % 1000)); } } cout.WriteLine(dp[(1 << n) - 1]); } } // 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; } } }