結果
問題 | No.951 【本日限定】1枚頼むともう1枚無料! |
ユーザー | EmKjp |
提出日時 | 2019-12-15 23:32:31 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 701 ms / 2,000 ms |
コード長 | 5,313 bytes |
コンパイル時間 | 4,799 ms |
コンパイル使用メモリ | 113,572 KB |
実行使用メモリ | 43,888 KB |
最終ジャッジ日時 | 2023-09-15 15:54:03 |
合計ジャッジ時間 | 27,289 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 64 ms
23,844 KB |
testcase_01 | AC | 64 ms
21,760 KB |
testcase_02 | AC | 62 ms
21,680 KB |
testcase_03 | AC | 64 ms
21,808 KB |
testcase_04 | AC | 63 ms
19,692 KB |
testcase_05 | AC | 63 ms
21,680 KB |
testcase_06 | AC | 64 ms
21,800 KB |
testcase_07 | AC | 63 ms
23,960 KB |
testcase_08 | AC | 63 ms
19,820 KB |
testcase_09 | AC | 78 ms
26,600 KB |
testcase_10 | AC | 73 ms
23,768 KB |
testcase_11 | AC | 71 ms
23,768 KB |
testcase_12 | AC | 193 ms
40,648 KB |
testcase_13 | AC | 513 ms
43,588 KB |
testcase_14 | AC | 141 ms
43,236 KB |
testcase_15 | AC | 136 ms
43,888 KB |
testcase_16 | AC | 167 ms
41,092 KB |
testcase_17 | AC | 195 ms
43,428 KB |
testcase_18 | AC | 63 ms
21,628 KB |
testcase_19 | AC | 62 ms
23,808 KB |
testcase_20 | AC | 62 ms
21,712 KB |
testcase_21 | AC | 73 ms
23,960 KB |
testcase_22 | AC | 67 ms
24,352 KB |
testcase_23 | AC | 70 ms
22,784 KB |
testcase_24 | AC | 695 ms
40,496 KB |
testcase_25 | AC | 701 ms
42,540 KB |
testcase_26 | AC | 679 ms
40,492 KB |
testcase_27 | AC | 676 ms
42,496 KB |
testcase_28 | AC | 586 ms
40,488 KB |
testcase_29 | AC | 588 ms
42,524 KB |
testcase_30 | AC | 63 ms
21,716 KB |
testcase_31 | AC | 65 ms
23,848 KB |
testcase_32 | AC | 68 ms
22,584 KB |
testcase_33 | AC | 71 ms
23,272 KB |
testcase_34 | AC | 78 ms
25,320 KB |
testcase_35 | AC | 686 ms
42,560 KB |
testcase_36 | AC | 688 ms
42,540 KB |
testcase_37 | AC | 685 ms
40,484 KB |
testcase_38 | AC | 687 ms
40,452 KB |
testcase_39 | AC | 686 ms
42,520 KB |
testcase_40 | AC | 663 ms
42,492 KB |
testcase_41 | AC | 664 ms
40,500 KB |
testcase_42 | AC | 667 ms
42,576 KB |
testcase_43 | AC | 683 ms
42,604 KB |
testcase_44 | AC | 675 ms
38,432 KB |
testcase_45 | AC | 670 ms
40,428 KB |
testcase_46 | AC | 587 ms
42,572 KB |
testcase_47 | AC | 588 ms
40,616 KB |
testcase_48 | AC | 588 ms
42,532 KB |
testcase_49 | AC | 593 ms
42,612 KB |
testcase_50 | AC | 594 ms
38,448 KB |
testcase_51 | AC | 586 ms
42,600 KB |
testcase_52 | AC | 583 ms
42,456 KB |
testcase_53 | AC | 700 ms
40,472 KB |
testcase_54 | AC | 469 ms
42,532 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.Globalization; using System.IO; using System.Linq; using E = System.Linq.Enumerable; internal partial class Solver { public static bool UpdateMax<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 k = ni(); var p = new int[n]; var d = new int[n]; for (int i = 0; i < n; i++) { p[i] = ni(); d[i] = ni(); } var order = E.Range(0, n).ToArray(); Array.Sort(order, (i1, i2) => -p[i1].CompareTo(p[i2])); var dp = new int[2, k + 1]; for (int i = 0; i <= k; i++) { dp[0, i] = dp[1, i] = -10000000; } dp[0, 0] = 0; foreach (var i in order) { var next = dp.Clone() as int[,]; for (int j = 0; j <= k; j++) { if (j + p[i] <= k) { UpdateMax(ref next[1, j + p[i]], dp[0, j] + d[i]); } UpdateMax(ref next[0, j], dp[1, j] + d[i]); } dp = next; //dp.Dump(); } cout.WriteLine(dp.Cast<int>().Max()); } } // PREWRITEN CODE BEGINS FROM HERE internal partial class Solver : Scanner { public static void Main(string[] args) { #if LOCAL byte[] inputBuffer = new byte[1000000]; var inputStream = Console.OpenStandardInput(inputBuffer.Length); using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) { Console.SetIn(reader); new Solver(Console.In, Console.Out).Run(); } #else Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver(Console.In, Console.Out).Run(); Console.Out.Flush(); #endif } #pragma warning disable IDE0052 private readonly TextReader cin; private readonly TextWriter cout; #pragma warning restore IDE0052 public Solver(TextReader reader, TextWriter writer) : base(reader) { cin = reader; cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } #pragma warning disable IDE1006 #pragma warning disable IDE0051 private int ni() { return NextInt(); } private int[] ni(int n) { return NextIntArray(n); } private long nl() { return NextLong(); } private long[] nl(int n) { return NextLongArray(n); } private double nd() { return NextDouble(); } private double[] nd(int n) { return NextDoubleArray(n); } private string ns() { return Next(); } private string[] ns(int n) { return NextArray(n); } #pragma warning restore IDE1006 #pragma warning restore IDE0051 } internal static class LinqPadExtension { public static T Dump<T>(this T obj) { #if LOCAL return LINQPad.Extensions.Dump(obj); #else return obj; #endif } } public class Scanner { private readonly TextReader Reader; private readonly Queue<string> TokenQueue = new Queue<string>(); private readonly CultureInfo ci = CultureInfo.InvariantCulture; public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { Reader = reader; } public int NextInt() { return int.Parse(Next(), ci); } public long NextLong() { return long.Parse(Next(), ci); } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { string[] array = new string[size]; for (int i = 0; i < size; i++) { array[i] = Next(); } return array; } public int[] NextIntArray(int size) { int[] array = new int[size]; for (int i = 0; i < size; i++) { array[i] = NextInt(); } return array; } public long[] NextLongArray(int size) { long[] array = new long[size]; for (int i = 0; i < size; i++) { array[i] = NextLong(); } return array; } public double[] NextDoubleArray(int size) { double[] array = new double[size]; for (int i = 0; i < size; i++) { array[i] = NextDouble(); } 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 static readonly char[] _separator = new[] { ' ', '\t' }; private bool StockTokens() { while (true) { string line = Reader.ReadLine(); if (line == null) { return false; } string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries); if (tokens.Length == 0) { continue; } foreach (string token in tokens) { TokenQueue.Enqueue(token); } return true; } } }