結果
問題 | No.818 Dinner time |
ユーザー |
|
提出日時 | 2019-04-19 22:20:42 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 129 ms / 2,000 ms |
コード長 | 4,456 bytes |
コンパイル時間 | 2,554 ms |
コンパイル使用メモリ | 114,916 KB |
実行使用メモリ | 28,160 KB |
最終ジャッジ日時 | 2024-11-29 23:30:10 |
合計ジャッジ時間 | 5,894 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 29 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
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 D, long A, long B) { if (D == 0) return 0; 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日利用} var day = new[] { 0, 1, M }; for (int i = 0; i < dp.Length; i++) { dp[i] = new long[day.Length]; for (int j = 0; j < dp[i].Length; j++) { dp[i][j] = int.MinValue; } } dp[N][0] = 0; for (int i = N - 1; i >= 0; i--) { for (int j = 0; j < day.Length; j++) { for (int k = j; k < day.Length; k++) { var point = calc(day[k], A[i], B[i]); chmax(ref dp[i][k], dp[i + 1][j] + point); } } } //dp[0].join(); WriteLine(dp[0][2]); } } 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); }