結果
問題 | No.324 落ちてた閉路グラフ |
ユーザー | りあん |
提出日時 | 2015-12-19 03:59:09 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 248 ms / 5,000 ms |
コード長 | 5,737 bytes |
コンパイル時間 | 991 ms |
コンパイル使用メモリ | 115,880 KB |
実行使用メモリ | 27,848 KB |
最終ジャッジ日時 | 2024-11-15 19:37:23 |
合計ジャッジ時間 | 4,565 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
26,952 KB |
testcase_01 | AC | 31 ms
25,260 KB |
testcase_02 | AC | 30 ms
25,140 KB |
testcase_03 | AC | 30 ms
25,044 KB |
testcase_04 | AC | 118 ms
27,792 KB |
testcase_05 | AC | 248 ms
27,724 KB |
testcase_06 | AC | 103 ms
26,032 KB |
testcase_07 | AC | 229 ms
26,068 KB |
testcase_08 | AC | 108 ms
25,676 KB |
testcase_09 | AC | 66 ms
27,692 KB |
testcase_10 | AC | 109 ms
25,548 KB |
testcase_11 | AC | 66 ms
25,672 KB |
testcase_12 | AC | 29 ms
22,836 KB |
testcase_13 | AC | 29 ms
23,224 KB |
testcase_14 | AC | 52 ms
27,560 KB |
testcase_15 | AC | 65 ms
25,676 KB |
testcase_16 | AC | 29 ms
26,948 KB |
testcase_17 | AC | 29 ms
25,012 KB |
testcase_18 | AC | 30 ms
25,012 KB |
testcase_19 | AC | 30 ms
25,016 KB |
testcase_20 | AC | 29 ms
23,092 KB |
testcase_21 | AC | 30 ms
24,908 KB |
testcase_22 | AC | 30 ms
25,036 KB |
testcase_23 | AC | 30 ms
25,396 KB |
testcase_24 | AC | 30 ms
27,148 KB |
testcase_25 | AC | 30 ms
25,292 KB |
testcase_26 | AC | 30 ms
25,400 KB |
testcase_27 | AC | 30 ms
27,172 KB |
testcase_28 | AC | 30 ms
25,040 KB |
testcase_29 | AC | 30 ms
27,032 KB |
testcase_30 | AC | 30 ms
23,220 KB |
testcase_31 | AC | 30 ms
25,264 KB |
testcase_32 | AC | 240 ms
27,848 KB |
testcase_33 | AC | 208 ms
27,832 KB |
testcase_34 | AC | 109 ms
26,028 KB |
testcase_35 | AC | 35 ms
25,912 KB |
testcase_36 | AC | 52 ms
25,592 KB |
testcase_37 | AC | 30 ms
26,928 KB |
コンパイルメッセージ
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 System.IO.Compression; using System.Text; //using System.Numerics; namespace Solver { class Program { const int M = 1000000007; const double eps = 1e-9; static int[] dd = { 0, 1, 0, -1, 0 }; static void Main() { var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var sc = new Scan(); int n, m; sc.Multi(out n, out m); if (m < 2) { Console.WriteLine(0); return; } var w = sc.IntArr; var dp = new int[m + 1][][]; for (int i = 0; i <= m; i++) { dp[i] = new int[2][]; for (int j = 0; j < 2; j++) { dp[i][j] = new int[2]; for (int k = 0; k < 2; k++) dp[i][j][k] = -M; } } dp[0][0][0] = 0; dp[1][1][1] = 0; for (int i = 0; i < n - 1; i++) { for (int j = m; j > 0; j--) { for (int k = 0; k < 2; k++) { dp[j][0][k] = Math.Max(dp[j][0][k], dp[j][1][k]); dp[j][1][k] = Math.Max(dp[j - 1][1][k] + w[i], dp[j - 1][0][k]); } } } for (int i = 0; i <= m; i++) dp[i][1][1] += w[n - 1]; sw.WriteLine(Math.Max(dp[m][0].Max(), dp[m][1].Max())); sw.Flush(); } static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; } static bool isprime(long n) { if (n == 1) return false; for (long i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; } static string strsort(string s) { var c = s.ToCharArray(); Array.Sort(c); return string.Join("", c); } static string strswap(string s, int i, int j) { var c = s.ToCharArray(); c[i] = s[j]; c[j] = s[i]; return string.Join("", c); } static T[] copy<T>(T[] a) { var ret = new T[a.Length]; for (int i = 0; i < a.Length; i++) ret[i] = a[i]; return ret; } } class Scan { public int Int { get { return int.Parse(Console.ReadLine().Trim()); } } public long Long { get { return long.Parse(Console.ReadLine().Trim()); } } public string Str { get { return Console.ReadLine().Trim(); } } public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } } public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); } public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } } public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } } public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } } public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } } public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } } public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; } public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; } public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; } public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; } public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; } public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; } public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); } public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; } public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; } public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; } public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; } } class mymath { public bool isprime(long a) { if (a < 2) return false; for (long i = 2; i * i <= a; i++) if (a % i == 0) return false; return true; } public long powmod(long a, long b, long M) { if (a == 0) return 0; if (b == 0) return 1; if (b == 1) return a % M; var t = powmod(a, b / 2, M); if ((b & 1) == 0) return t * t % M; else return t * t % M * a % M; } public long gcd(long a, long b) { while (b != 0) { var t = a % b; a = b; b = t; } return a; } public long lcm(int a, int b) { return a * (long)b / gcd(a, b); } } }