結果

問題 No.818 Dinner time
ユーザー claw88claw88
提出日時 2019-04-19 22:06:52
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,436 bytes
コンパイル時間 2,510 ms
コンパイル使用メモリ 116,976 KB
実行使用メモリ 35,820 KB
最終ジャッジ日時 2024-09-22 19:28:29
合計ジャッジ時間 6,080 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
27,024 KB
testcase_01 AC 28 ms
27,024 KB
testcase_02 AC 27 ms
25,008 KB
testcase_03 AC 28 ms
25,008 KB
testcase_04 AC 28 ms
24,716 KB
testcase_05 AC 27 ms
25,012 KB
testcase_06 AC 28 ms
24,880 KB
testcase_07 AC 28 ms
25,020 KB
testcase_08 AC 29 ms
25,008 KB
testcase_09 WA -
testcase_10 AC 27 ms
24,632 KB
testcase_11 WA -
testcase_12 AC 29 ms
24,848 KB
testcase_13 AC 28 ms
24,764 KB
testcase_14 AC 29 ms
27,152 KB
testcase_15 AC 28 ms
24,632 KB
testcase_16 AC 28 ms
28,944 KB
testcase_17 AC 116 ms
34,320 KB
testcase_18 AC 89 ms
32,140 KB
testcase_19 AC 89 ms
33,444 KB
testcase_20 AC 114 ms
32,544 KB
testcase_21 AC 99 ms
30,152 KB
testcase_22 AC 87 ms
32,440 KB
testcase_23 AC 95 ms
33,332 KB
testcase_24 AC 125 ms
35,096 KB
testcase_25 AC 93 ms
31,288 KB
testcase_26 AC 82 ms
31,504 KB
testcase_27 AC 111 ms
32,844 KB
testcase_28 AC 97 ms
34,924 KB
testcase_29 AC 117 ms
31,800 KB
testcase_30 AC 108 ms
35,820 KB
testcase_31 AC 114 ms
32,956 KB
testcase_32 AC 95 ms
30,860 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 SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    long calc(int k, long A, long B, int M)
    {
        if (k == 0) return 0;

        int D = 1;
        if (k == 2) D = M;

        if (A >= 0)
        {
            return A * (D - 1) + Max(A, B);
        }
        else
        {
            return Max(A * D, B);
        }
    }
    void solve()
    {
        int N = cin.nextint;
        int M = cin.nextint;
        var A = new long[N];
        var B = new long[N];
        for (int i = 0; i < N; i++)
        {
            A[i] = cin.nextint;
            B[i] = cin.nextint;
        }

        var dp = new long[N + 1][]; //{0日利用、1日利用、M日利用}
        for (int i = 0; i < N + 1; i++)
        {
            dp[i] = new long[3];
            for (int j = 0; j < 3; j++)
            {
                dp[i][j] = long.MinValue / 3;
            }
        }
        dp[N][0] = 0;

        for (int i = N - 1; i >= 0; i--)
        {
            for (int j = 0; j < 3; j++)
            {
                for (int k = j; k < 3; k++)
                {
                    var point = calc(k, A[i], B[i], M);
                    chmax(ref dp[i][k], dp[i + 1][j] + point);
                }
            }
        }

        //dp[0].join();
        WriteLine(dp[0].Max());

    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}
0