#407921 (C#(csc)) No.951 【本日限定】１枚頼むともう１枚無料！

提出ソース

結果

問題	No.951 【本日限定】１枚頼むともう１枚無料！
ユーザー	りあん
提出日時	2019-12-12 23:26:21
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	284 ms / 2,000 ms
コード長	6,765 bytes
コンパイル時間	2,848 ms
コンパイル使用メモリ	116,196 KB
実行使用メモリ	23,636 KB
最終ジャッジ日時	2023-09-09 23:45:03
合計ジャッジ時間	13,815 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	68 ms 21,472 KB
testcase_01	AC	68 ms 21,692 KB
testcase_02	AC	67 ms 19,352 KB
testcase_03	AC	67 ms 21,416 KB
testcase_04	AC	68 ms 21,688 KB
testcase_05	AC	67 ms 23,456 KB
testcase_06	AC	67 ms 23,636 KB
testcase_07	AC	67 ms 23,504 KB
testcase_08	AC	68 ms 21,472 KB
testcase_09	AC	74 ms 23,560 KB
testcase_10	AC	71 ms 21,472 KB
testcase_11	AC	71 ms 23,472 KB
testcase_12	AC	111 ms 21,564 KB
testcase_13	AC	220 ms 21,420 KB
testcase_14	AC	95 ms 21,492 KB
testcase_15	AC	91 ms 21,764 KB
testcase_16	AC	102 ms 21,492 KB
testcase_17	AC	113 ms 21,468 KB
testcase_18	AC	67 ms 21,396 KB
testcase_19	AC	68 ms 21,412 KB
testcase_20	AC	67 ms 23,528 KB
testcase_21	AC	70 ms 23,512 KB
testcase_22	AC	67 ms 21,424 KB
testcase_23	AC	68 ms 21,492 KB
testcase_24	AC	282 ms 21,412 KB
testcase_25	AC	280 ms 21,572 KB
testcase_26	AC	274 ms 21,568 KB
testcase_27	AC	272 ms 21,568 KB
testcase_28	AC	238 ms 21,584 KB
testcase_29	AC	239 ms 19,544 KB
testcase_30	AC	67 ms 21,432 KB
testcase_31	AC	67 ms 21,424 KB
testcase_32	AC	68 ms 23,588 KB
testcase_33	AC	69 ms 23,508 KB
testcase_34	AC	71 ms 21,436 KB
testcase_35	AC	278 ms 19,488 KB
testcase_36	AC	281 ms 21,460 KB
testcase_37	AC	280 ms 21,396 KB
testcase_38	AC	278 ms 21,372 KB
testcase_39	AC	280 ms 21,436 KB
testcase_40	AC	273 ms 21,572 KB
testcase_41	AC	277 ms 23,484 KB
testcase_42	AC	272 ms 21,444 KB
testcase_43	AC	275 ms 21,472 KB
testcase_44	AC	275 ms 21,516 KB
testcase_45	AC	274 ms 21,632 KB
testcase_46	AC	239 ms 23,536 KB
testcase_47	AC	240 ms 21,484 KB
testcase_48	AC	242 ms 21,452 KB
testcase_49	AC	240 ms 23,540 KB
testcase_50	AC	241 ms 21,432 KB
testcase_51	AC	240 ms 23,620 KB
testcase_52	AC	243 ms 21,532 KB
testcase_53	AC	284 ms 21,428 KB
testcase_54	AC	195 ms 21,420 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n, k;
        sc.Multi(out n, out k);
        Assert(1 <= n && n <= 5000);
        Assert(1 <= k && k <= 5000);
        var pz = new P[n];
        for (int i = 0; i < n; i++)
        {
            int p, d;
            sc.Multi(out p, out d);
            Assert(1 <= p && p <= k);
            Assert(1 <= d && d <= 5000);
            pz[i] = new P(p, d);
        }
        Array.Sort(pz);
        Array.Reverse(pz);
        var dp = new int[k + 1][];
        for (int i = 0; i < k + 1; i++)
        {
            dp[i] = new int[2];
            for (int j = 0; j < 2; j++)
            {
                dp[i][j] = -M;
            }
        }
        dp[0][0] = 0;
        foreach (var item in pz)
        {
            int p = item.v1, d = item.v2;
            for (int i = k; i >= 0 ; i--)
            {
                dp[i][0] = Math.Max(dp[i][0], dp[i][1] + d);
                if (i >= p)
                    dp[i][1] = Math.Max(dp[i][1], dp[i - p][0] + d);
            }
        }
        Prt(dp.Max(x => x.Max()));


    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(bool cond) { if (!cond) throw new Exception(); }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード