結果
問題 | No.951 【本日限定】1枚頼むともう1枚無料! |
ユーザー | eSeF |
提出日時 | 2020-01-21 02:52:10 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,432 ms / 2,000 ms |
コード長 | 6,283 bytes |
コンパイル時間 | 1,846 ms |
コンパイル使用メモリ | 64,152 KB |
実行使用メモリ | 428,456 KB |
最終ジャッジ日時 | 2023-09-17 00:32:48 |
合計ジャッジ時間 | 40,078 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
20,700 KB |
testcase_01 | AC | 59 ms
22,820 KB |
testcase_02 | AC | 59 ms
20,840 KB |
testcase_03 | AC | 59 ms
24,852 KB |
testcase_04 | AC | 59 ms
20,776 KB |
testcase_05 | AC | 59 ms
20,928 KB |
testcase_06 | AC | 59 ms
20,956 KB |
testcase_07 | AC | 59 ms
20,784 KB |
testcase_08 | AC | 59 ms
20,904 KB |
testcase_09 | AC | 85 ms
29,724 KB |
testcase_10 | AC | 73 ms
25,632 KB |
testcase_11 | AC | 74 ms
27,992 KB |
testcase_12 | AC | 332 ms
103,704 KB |
testcase_13 | AC | 992 ms
301,796 KB |
testcase_14 | AC | 213 ms
70,400 KB |
testcase_15 | AC | 191 ms
72,712 KB |
testcase_16 | AC | 254 ms
102,024 KB |
testcase_17 | AC | 304 ms
114,848 KB |
testcase_18 | AC | 56 ms
18,724 KB |
testcase_19 | AC | 58 ms
22,824 KB |
testcase_20 | AC | 58 ms
22,776 KB |
testcase_21 | AC | 74 ms
25,536 KB |
testcase_22 | AC | 65 ms
24,356 KB |
testcase_23 | AC | 71 ms
23,500 KB |
testcase_24 | AC | 1,432 ms
428,236 KB |
testcase_25 | AC | 1,418 ms
428,320 KB |
testcase_26 | AC | 1,346 ms
428,456 KB |
testcase_27 | AC | 1,347 ms
428,280 KB |
testcase_28 | AC | 1,106 ms
428,324 KB |
testcase_29 | AC | 1,076 ms
424,196 KB |
testcase_30 | AC | 58 ms
22,936 KB |
testcase_31 | AC | 55 ms
18,720 KB |
testcase_32 | AC | 64 ms
24,724 KB |
testcase_33 | AC | 71 ms
23,932 KB |
testcase_34 | AC | 85 ms
27,972 KB |
testcase_35 | AC | 1,410 ms
428,264 KB |
testcase_36 | AC | 1,407 ms
428,272 KB |
testcase_37 | AC | 1,393 ms
424,208 KB |
testcase_38 | AC | 1,386 ms
426,396 KB |
testcase_39 | AC | 1,383 ms
428,328 KB |
testcase_40 | AC | 1,349 ms
426,264 KB |
testcase_41 | AC | 1,322 ms
428,284 KB |
testcase_42 | AC | 1,304 ms
428,348 KB |
testcase_43 | AC | 1,301 ms
426,264 KB |
testcase_44 | AC | 1,310 ms
426,268 KB |
testcase_45 | AC | 1,309 ms
428,312 KB |
testcase_46 | AC | 1,105 ms
428,272 KB |
testcase_47 | AC | 1,084 ms
426,220 KB |
testcase_48 | AC | 1,088 ms
426,392 KB |
testcase_49 | AC | 1,075 ms
426,224 KB |
testcase_50 | AC | 1,084 ms
424,268 KB |
testcase_51 | AC | 1,076 ms
428,232 KB |
testcase_52 | AC | 1,144 ms
347,536 KB |
testcase_53 | AC | 1,399 ms
426,316 KB |
testcase_54 | AC | 782 ms
426,420 KB |
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Text; using static System.Math; using static System.Array; using static AtCoder.Tool; using static AtCoder.CalcL; namespace AtCoder { class AC { const int MOD = 1000000007; const int INF = int.MaxValue / 2; const long SINF = long.MaxValue / 2; const double EPS = 1e-8; static readonly int[] dI = { 0, 1, 0, -1 }; static readonly int[] dJ = { 1, 0, -1, 0 }; static List<List<int>> G = new List<List<int>>(); //static List<List<Edge>>G = new List<List<Edge>>(); //static List<Edge> E = new List<Edge>(); static void Main(string[] args) { //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; //Console.SetOut(sw); var cin = new Scanner(); var input = cin.ReadSplitInt(); int N = input[0]; int K = input[1]; var l = new List<Tuple<int, int>>(); for(var i = 0; i < N; i++) { var p = cin.ReadSplitInt(); l.Add(new Tuple<int, int>(p[0], p[1])); } l.Sort((x, y) => (y.Item1 - x.Item1)); var dp = new long[N + 1][,]; for(var i = 0; i <= N; i++) { dp[i] = new long[K + 1, 2]; for(var j = 0; j <= K; j++) { dp[i][j, 0] = 0; dp[i][j, 1] = -1; } } for(var i = 0; i < N; i++) { int P = l[i].Item1; int D = l[i].Item2; for(var j = 0; j <= K; j++) { dp[i + 1][j, 0] = Max(dp[i + 1][j, 0], dp[i][j, 0]); if (j + P <= K) { dp[i + 1][j + P, 1] = Max(dp[i + 1][j + P, 1], dp[i][j, 0] + D); } if (dp[i][j, 1] != -1) { dp[i + 1][j, 1] = Max(dp[i + 1][j, 1], dp[i][j, 1]); dp[i + 1][j, 0] = Max(dp[i + 1][j, 0], dp[i][j, 1] + D); } } } Console.WriteLine(Max(dp[N][K, 0], dp[N][K, 1])); //Console.Out.Flush(); } struct Edge { public int from; public int to; public long dist; public Edge(int t, long c) { from = -1; to = t; dist = c; } public Edge(int f, int t, long c) { from = f; to = t; dist = c; } } } public class Scanner { public int[] ReadSplitInt() { return ConvertAll(Console.ReadLine().Split(), int.Parse); } public long[] ReadSplitLong() { return ConvertAll(Console.ReadLine().Split(), long.Parse); } public double[] ReadSplit_Double() { return ConvertAll(Console.ReadLine().Split(), double.Parse); } } public static class Tool { static public void Initialize<T>(ref T[] array, T initialvalue) { for (var i = 0; i < array.Length; i++) { array[i] = initialvalue; } } static public void Swap<T>(ref T a, ref T b) { T keep = a; a = b; b = keep; } static public void Display<T>(T[,] array2d, int n, int m) { for (var i = 0; i < n; i++) { for (var j = 0; j < m; j++) { Console.Write($"{array2d[i, j]} "); } Console.WriteLine(); } } static public long LPow(int a, int b) { return (long)Pow(a, b); } } static public class CalcI { public static int Gcd(int a, int b) { if (a * b == 0) { return Max(a, b); } return a % b == 0 ? b : Gcd(b, a % b); } public static int Lcm(int a, int b) { int g = Gcd(a, b); return a / g * b; } public static int Ceil(int n, int div) { return (n + div - 1) / div; } } static public class CalcL { public static long Gcd(long a, long b) { if (a * b == 0) { return Max(a, b); } return a % b == 0 ? b : Gcd(b, a % b); } public static long Lcm(long a, long b) { long g = Gcd(a, b); return a / g * b; } public static long Ceil(long n, long div) { return (n + div - 1) / div; } } class Modulo { private const int M = 1000000007; private readonly int[] m_facs; public int Mul(int a, int b) { return (int)(Math.BigMul(a, b) % M); } public Modulo(int n) { m_facs = new int[n + 1]; m_facs[0] = 1; for (int i = 1; i <= n; ++i) { m_facs[i] = Mul(m_facs[i - 1], i); } } public int Fac(int n) { return m_facs[n]; } public int Pow(int a, int m) { switch (m) { case 0: return 1; case 1: return a; default: int p1 = Pow(a, m / 2); int p2 = Mul(p1, p1); return ((m % 2) == 0) ? p2 : Mul(p2, a); } } public int Div(int a, int b) { return Mul(a, Pow(b, M - 2)); } public int Ncr(int n, int r) { if (n < r) { return 0; } if (n == r) { return 1; } int res = Fac(n); res = Div(res, Fac(r)); res = Div(res, Fac(n - r)); return res; } public Modulo() { } } }