結果
問題 | No.258 回転寿司(2) |
ユーザー | くれちー |
提出日時 | 2017-07-26 14:38:27 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 55 ms / 2,000 ms |
コード長 | 3,084 bytes |
コンパイル時間 | 1,091 ms |
コンパイル使用メモリ | 110,848 KB |
実行使用メモリ | 25,344 KB |
最終ジャッジ日時 | 2024-04-24 11:29:32 |
合計ジャッジ時間 | 7,333 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
25,344 KB |
testcase_01 | AC | 55 ms
25,088 KB |
testcase_02 | AC | 45 ms
22,400 KB |
testcase_03 | AC | 34 ms
19,328 KB |
testcase_04 | AC | 42 ms
20,864 KB |
testcase_05 | AC | 42 ms
21,120 KB |
testcase_06 | AC | 52 ms
24,960 KB |
testcase_07 | AC | 40 ms
20,224 KB |
testcase_08 | AC | 41 ms
20,992 KB |
testcase_09 | AC | 39 ms
20,352 KB |
testcase_10 | AC | 33 ms
19,584 KB |
testcase_11 | AC | 40 ms
20,352 KB |
testcase_12 | AC | 41 ms
21,120 KB |
testcase_13 | AC | 39 ms
20,352 KB |
testcase_14 | AC | 49 ms
24,960 KB |
testcase_15 | AC | 40 ms
20,608 KB |
testcase_16 | AC | 40 ms
20,480 KB |
testcase_17 | AC | 40 ms
20,480 KB |
testcase_18 | AC | 52 ms
25,216 KB |
testcase_19 | AC | 33 ms
19,328 KB |
testcase_20 | AC | 45 ms
22,656 KB |
testcase_21 | AC | 51 ms
25,088 KB |
testcase_22 | AC | 33 ms
19,456 KB |
testcase_23 | AC | 33 ms
19,456 KB |
testcase_24 | AC | 33 ms
19,456 KB |
testcase_25 | AC | 32 ms
19,328 KB |
testcase_26 | AC | 44 ms
22,144 KB |
testcase_27 | AC | 39 ms
20,352 KB |
testcase_28 | AC | 54 ms
25,216 KB |
testcase_29 | AC | 41 ms
20,864 KB |
testcase_30 | AC | 33 ms
19,456 KB |
testcase_31 | AC | 33 ms
19,456 KB |
testcase_32 | AC | 40 ms
20,480 KB |
testcase_33 | AC | 47 ms
23,168 KB |
testcase_34 | AC | 43 ms
21,760 KB |
testcase_35 | AC | 42 ms
21,248 KB |
testcase_36 | AC | 38 ms
19,840 KB |
testcase_37 | AC | 33 ms
19,456 KB |
testcase_38 | AC | 39 ms
20,736 KB |
testcase_39 | AC | 39 ms
20,480 KB |
testcase_40 | AC | 43 ms
22,144 KB |
testcase_41 | AC | 47 ms
23,552 KB |
testcase_42 | AC | 40 ms
20,864 KB |
testcase_43 | AC | 40 ms
19,968 KB |
testcase_44 | AC | 49 ms
25,216 KB |
testcase_45 | AC | 44 ms
22,656 KB |
testcase_46 | AC | 34 ms
19,328 KB |
testcase_47 | AC | 46 ms
22,784 KB |
testcase_48 | AC | 39 ms
20,352 KB |
testcase_49 | AC | 39 ms
20,224 KB |
testcase_50 | AC | 34 ms
19,200 KB |
testcase_51 | AC | 43 ms
21,888 KB |
testcase_52 | AC | 41 ms
21,504 KB |
testcase_53 | AC | 38 ms
19,840 KB |
testcase_54 | AC | 44 ms
22,272 KB |
testcase_55 | AC | 54 ms
25,216 KB |
testcase_56 | AC | 47 ms
22,656 KB |
testcase_57 | AC | 38 ms
19,840 KB |
testcase_58 | AC | 41 ms
21,504 KB |
testcase_59 | AC | 52 ms
25,088 KB |
testcase_60 | AC | 33 ms
19,200 KB |
testcase_61 | AC | 46 ms
23,168 KB |
testcase_62 | AC | 40 ms
20,736 KB |
testcase_63 | AC | 43 ms
22,144 KB |
testcase_64 | AC | 52 ms
25,344 KB |
testcase_65 | AC | 44 ms
22,144 KB |
testcase_66 | AC | 33 ms
19,328 KB |
testcase_67 | AC | 47 ms
23,552 KB |
testcase_68 | AC | 49 ms
24,960 KB |
testcase_69 | AC | 45 ms
23,040 KB |
testcase_70 | AC | 40 ms
20,352 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; using System.Collections.Generic; using System.IO; using System.Linq; using System.Numerics; using System.Text; using static System.Console; using static System.Convert; using static System.Math; using static Extentions; class IO { int idx; string[] input; public IO(TextReader reader) { input = reader.ReadToEnd().Split(new[] { " ", "\n", "\r" }, StringSplitOptions.RemoveEmptyEntries); } T Get<T>(Func<string, T> parser) => parser(input[idx++]); public string S => Get(s => s); public char C => Get(char.Parse); public int I => Get(int.Parse); public long L => Get(long.Parse); public double F => Get(double.Parse); public decimal D => Get(decimal.Parse); public BigInteger B => Get(BigInteger.Parse); T[] Gets<T>(int n, Func<string, T> parser) => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray(); public string[] Ss(int n) => Gets(n, s => s); public char[] Cs(int n) => Gets(n, char.Parse); public int[] Is(int n) => Gets(n, int.Parse); public long[] Ls(int n) => Gets(n, long.Parse); public double[] Fs(int n) => Gets(n, double.Parse); public decimal[] Ds(int n) => Gets(n, decimal.Parse); public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse); public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs)); public void Write(params object[] xs) => WriteLine(string.Join(" ", xs)); } static class Pair { public static Pair<T1, T2> Create<T1, T2>(T1 first, T2 second) => new Pair<T1, T2>(first, second); } struct Pair<T1, T2> { public T1 First; public T2 Second; public Pair(T1 first, T2 second) { First = first; Second = second; } } static class Extentions { } static class Program { public static void Main() { var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" }; #if DEBUG sw.AutoFlush = true; #else sw.AutoFlush = false; #endif SetOut(sw); Solve(new IO(In)); Out.Flush(); } static void Solve(IO io) { var n = io.I; var v = io.Is(n); var dp = new Pair<int, Queue<int>>[n, 2]; dp[0, 0] = Pair.Create(0, new Queue<int>()); var tq = new Queue<int>(); tq.Enqueue(1); dp[0, 1] = Pair.Create(v[0], tq); for (var i = 1; i < n; i++) { var t0 = Pair.Create( dp[i - 1, 0].First, new Queue<int>(dp[i - 1, 0].Second)); var t1 = Pair.Create( dp[i - 1, 1].First, new Queue<int>(dp[i - 1, 1].Second)); dp[i, 0] = t1; if (t0.First + v[i] > t1.First) { t0.First += v[i]; t0.Second.Enqueue(i + 1); dp[i, 1] = t0; } else dp[i, 1] = t1; } var ans = dp[n - 1, 0].First > dp[n - 1, 1].First ? dp[n - 1, 0] : dp[n - 1, 1]; io.Write(ans.First); io.Write(ans.Second.ToArray()); } }