結果
問題 | No.951 【本日限定】1枚頼むともう1枚無料! |
ユーザー | eSeF |
提出日時 | 2020-01-21 02:30:26 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 6,137 bytes |
コンパイル時間 | 1,770 ms |
コンパイル使用メモリ | 68,204 KB |
実行使用メモリ | 413,132 KB |
最終ジャッジ日時 | 2023-09-16 23:47:54 |
合計ジャッジ時間 | 69,054 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
22,756 KB |
testcase_01 | AC | 56 ms
20,636 KB |
testcase_02 | AC | 55 ms
22,684 KB |
testcase_03 | AC | 54 ms
18,592 KB |
testcase_04 | AC | 55 ms
20,712 KB |
testcase_05 | AC | 55 ms
20,724 KB |
testcase_06 | AC | 56 ms
20,608 KB |
testcase_07 | AC | 56 ms
20,828 KB |
testcase_08 | AC | 57 ms
22,852 KB |
testcase_09 | AC | 104 ms
29,048 KB |
testcase_10 | AC | 83 ms
27,084 KB |
testcase_11 | AC | 80 ms
27,360 KB |
testcase_12 | AC | 539 ms
97,028 KB |
testcase_13 | AC | 1,958 ms
292,604 KB |
testcase_14 | AC | 358 ms
64,340 KB |
testcase_15 | AC | 285 ms
61,908 KB |
testcase_16 | AC | 395 ms
85,780 KB |
testcase_17 | AC | 457 ms
108,300 KB |
testcase_18 | AC | 52 ms
22,648 KB |
testcase_19 | AC | 52 ms
20,792 KB |
testcase_20 | AC | 55 ms
18,732 KB |
testcase_21 | AC | 87 ms
24,992 KB |
testcase_22 | AC | 65 ms
23,804 KB |
testcase_23 | AC | 73 ms
24,964 KB |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | AC | 1,921 ms
408,972 KB |
testcase_29 | AC | 1,868 ms
411,048 KB |
testcase_30 | AC | 54 ms
20,624 KB |
testcase_31 | AC | 52 ms
20,744 KB |
testcase_32 | AC | 64 ms
22,256 KB |
testcase_33 | AC | 76 ms
25,560 KB |
testcase_34 | AC | 99 ms
27,648 KB |
testcase_35 | TLE | - |
testcase_36 | TLE | - |
testcase_37 | TLE | - |
testcase_38 | TLE | - |
testcase_39 | TLE | - |
testcase_40 | TLE | - |
testcase_41 | TLE | - |
testcase_42 | TLE | - |
testcase_43 | TLE | - |
testcase_44 | TLE | - |
testcase_45 | TLE | - |
testcase_46 | AC | 1,862 ms
410,984 KB |
testcase_47 | AC | 1,892 ms
410,980 KB |
testcase_48 | AC | 1,927 ms
411,024 KB |
testcase_49 | AC | 1,895 ms
411,084 KB |
testcase_50 | AC | 1,898 ms
411,180 KB |
testcase_51 | AC | 1,922 ms
408,932 KB |
testcase_52 | TLE | - |
testcase_53 | TLE | - |
testcase_54 | AC | 1,245 ms
411,020 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, K + 1, 2]; for (var i = 0; i <= N; i++) for (var j = 0; j <= K; j++) for (var k = 0; k < 2; k++) dp[i, j, k] = k == 0 ? 0 : -1; for(var i = 0; i < N; i++) { int P = l[i].Item1; int D = l[i].Item2; for(var k = 0; k <= K; k++) { dp[i + 1, k, 0] = Max(dp[i + 1, k, 0], dp[i, k, 0]); if (k + P <= K) { dp[i + 1, k + P, 1] = Max(dp[i + 1, k + P, 0], dp[i, k, 0] + D); } if (dp[i, k, 1] != -1) { dp[i + 1, k, 1] = Max(dp[i + 1, k, 1], dp[i, k, 1]); dp[i + 1, k, 0] = Max(dp[i + 1, k, 0], dp[i, k, 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() { } } }