結果

問題 No.951 【本日限定】１枚頼むともう１枚無料！
ユーザー eSeFeSeF
提出日時 2020-01-21 02:52:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,411 ms / 2,000 ms
コード長 6,283 bytes
コンパイル時間 2,245 ms
コンパイル使用メモリ 118,304 KB
実行使用メモリ 433,316 KB
最終ジャッジ日時 2024-07-03 22:58:54
合計ジャッジ時間 39,293 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
26,236 KB
testcase_01 AC 27 ms
23,856 KB
testcase_02 AC 27 ms
23,948 KB
testcase_03 AC 26 ms
26,060 KB
testcase_04 AC 27 ms
24,024 KB
testcase_05 AC 26 ms
23,892 KB
testcase_06 AC 26 ms
21,688 KB
testcase_07 AC 27 ms
23,764 KB
testcase_08 AC 26 ms
21,816 KB
testcase_09 AC 56 ms
32,716 KB
testcase_10 AC 43 ms
28,760 KB
testcase_11 AC 42 ms
29,236 KB
testcase_12 AC 301 ms
108,512 KB
testcase_13 AC 987 ms
304,788 KB
testcase_14 AC 186 ms
71,432 KB
testcase_15 AC 165 ms
79,708 KB
testcase_16 AC 233 ms
104,872 KB
testcase_17 AC 280 ms
116,184 KB
testcase_18 AC 27 ms
23,888 KB
testcase_19 AC 26 ms
24,332 KB
testcase_20 AC 26 ms
24,112 KB
testcase_21 AC 45 ms
30,792 KB
testcase_22 AC 34 ms
25,524 KB
testcase_23 AC 37 ms
26,564 KB
testcase_24 AC 1,411 ms
429,500 KB
testcase_25 AC 1,399 ms
431,152 KB
testcase_26 AC 1,332 ms
431,016 KB
testcase_27 AC 1,332 ms
431,272 KB
testcase_28 AC 1,085 ms
431,152 KB
testcase_29 AC 1,095 ms
431,148 KB
testcase_30 AC 26 ms
23,940 KB
testcase_31 AC 27 ms
23,768 KB
testcase_32 AC 34 ms
23,856 KB
testcase_33 AC 39 ms
27,088 KB
testcase_34 AC 54 ms
31,312 KB
testcase_35 AC 1,382 ms
428,976 KB
testcase_36 AC 1,396 ms
428,968 KB
testcase_37 AC 1,405 ms
429,232 KB
testcase_38 AC 1,409 ms
429,236 KB
testcase_39 AC 1,404 ms
431,524 KB
testcase_40 AC 1,340 ms
431,152 KB
testcase_41 AC 1,337 ms
433,316 KB
testcase_42 AC 1,349 ms
431,280 KB
testcase_43 AC 1,321 ms
429,504 KB
testcase_44 AC 1,327 ms
426,932 KB
testcase_45 AC 1,326 ms
431,020 KB
testcase_46 AC 1,093 ms
429,236 KB
testcase_47 AC 1,105 ms
431,284 KB
testcase_48 AC 1,104 ms
431,136 KB
testcase_49 AC 1,092 ms
431,280 KB
testcase_50 AC 1,085 ms
429,228 KB
testcase_51 AC 1,094 ms
431,276 KB
testcase_52 AC 1,106 ms
352,588 KB
testcase_53 AC 1,383 ms
429,108 KB
testcase_54 AC 784 ms
429,224 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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() { }
    }
}
0