結果
問題 | No.258 回転寿司(2) |
ユーザー | mban |
提出日時 | 2017-03-29 00:26:46 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,935 bytes |
コンパイル時間 | 2,352 ms |
コンパイル使用メモリ | 108,060 KB |
実行使用メモリ | 26,048 KB |
最終ジャッジ日時 | 2023-09-20 18:39:51 |
合計ジャッジ時間 | 11,488 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
23,884 KB |
testcase_01 | AC | 77 ms
25,948 KB |
testcase_02 | AC | 74 ms
24,020 KB |
testcase_03 | AC | 65 ms
21,680 KB |
testcase_04 | AC | 73 ms
23,832 KB |
testcase_05 | AC | 73 ms
23,824 KB |
testcase_06 | AC | 76 ms
21,924 KB |
testcase_07 | AC | 72 ms
21,756 KB |
testcase_08 | AC | 72 ms
21,768 KB |
testcase_09 | AC | 72 ms
21,836 KB |
testcase_10 | AC | 66 ms
21,832 KB |
testcase_11 | AC | 72 ms
21,764 KB |
testcase_12 | AC | 72 ms
21,856 KB |
testcase_13 | AC | 73 ms
21,848 KB |
testcase_14 | AC | 76 ms
23,888 KB |
testcase_15 | AC | 73 ms
23,804 KB |
testcase_16 | AC | 72 ms
24,000 KB |
testcase_17 | AC | 74 ms
23,976 KB |
testcase_18 | AC | 76 ms
23,840 KB |
testcase_19 | AC | 65 ms
21,668 KB |
testcase_20 | AC | 73 ms
21,868 KB |
testcase_21 | AC | 75 ms
22,052 KB |
testcase_22 | AC | 65 ms
21,776 KB |
testcase_23 | AC | 65 ms
23,728 KB |
testcase_24 | AC | 66 ms
21,680 KB |
testcase_25 | RE | - |
testcase_26 | AC | 76 ms
21,808 KB |
testcase_27 | AC | 71 ms
21,888 KB |
testcase_28 | AC | 76 ms
23,832 KB |
testcase_29 | AC | 72 ms
21,820 KB |
testcase_30 | AC | 66 ms
23,736 KB |
testcase_31 | AC | 66 ms
21,880 KB |
testcase_32 | AC | 74 ms
21,764 KB |
testcase_33 | AC | 74 ms
21,852 KB |
testcase_34 | AC | 73 ms
21,912 KB |
testcase_35 | AC | 73 ms
21,928 KB |
testcase_36 | AC | 72 ms
23,828 KB |
testcase_37 | AC | 64 ms
21,640 KB |
testcase_38 | AC | 72 ms
21,860 KB |
testcase_39 | AC | 73 ms
21,932 KB |
testcase_40 | AC | 74 ms
21,872 KB |
testcase_41 | AC | 74 ms
21,824 KB |
testcase_42 | AC | 72 ms
21,964 KB |
testcase_43 | AC | 72 ms
21,816 KB |
testcase_44 | AC | 75 ms
21,848 KB |
testcase_45 | AC | 74 ms
19,904 KB |
testcase_46 | AC | 65 ms
19,632 KB |
testcase_47 | AC | 74 ms
21,784 KB |
testcase_48 | AC | 71 ms
19,868 KB |
testcase_49 | AC | 72 ms
21,848 KB |
testcase_50 | AC | 65 ms
21,684 KB |
testcase_51 | AC | 73 ms
19,996 KB |
testcase_52 | AC | 73 ms
23,820 KB |
testcase_53 | AC | 71 ms
21,852 KB |
testcase_54 | AC | 73 ms
21,768 KB |
testcase_55 | AC | 78 ms
25,852 KB |
testcase_56 | AC | 74 ms
23,892 KB |
testcase_57 | AC | 71 ms
21,720 KB |
testcase_58 | AC | 72 ms
21,788 KB |
testcase_59 | AC | 76 ms
26,048 KB |
testcase_60 | AC | 65 ms
23,672 KB |
testcase_61 | AC | 74 ms
23,884 KB |
testcase_62 | AC | 71 ms
21,712 KB |
testcase_63 | AC | 73 ms
21,848 KB |
testcase_64 | AC | 76 ms
23,968 KB |
testcase_65 | AC | 73 ms
21,788 KB |
testcase_66 | AC | 66 ms
19,672 KB |
testcase_67 | AC | 74 ms
21,868 KB |
testcase_68 | AC | 75 ms
24,036 KB |
testcase_69 | AC | 74 ms
23,916 KB |
testcase_70 | AC | 72 ms
21,840 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.Linq; using System.Collections; using System.Collections.Generic; using System.IO; class Program { static void Main() { new Magatro().Solve(); } } public class Scanner { private StreamReader Sr; private string[] S; private int Index; private const char Separator = ' '; public Scanner(Stream source) { Index = 0; S = new string[0]; Sr = new StreamReader(source); } private string[] Line() { return Sr.ReadLine().Split(Separator); } public string Next() { string result; if (Index >= S.Length) { S = Line(); Index = 0; } result = S[Index]; Index++; return result; } public int NextInt() { return int.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } public decimal NextDecimal() { return decimal.Parse(Next()); } public string[] StringArray(int index = 0) { Next(); Index = S.Length; return S.Skip(index).ToArray(); } public int[] IntArray(int index = 0) { return StringArray(index).Select(int.Parse).ToArray(); } public long[] LongArray(int index = 0) { return StringArray(index).Select(long.Parse).ToArray(); } public bool EndOfStream { get { return Sr.EndOfStream; } } } public class Magatro { private int N; private int[] V; private int[] Anser; private List<int>[] Sushi; private void Scan() { var cin = new Scanner(Console.OpenStandardInput()); N = cin.NextInt(); V = cin.IntArray(); } public void Solve() { Scan(); if (N == 1) { Console.WriteLine(V[0]); Console.WriteLine(1); } Anser = new int[N]; Sushi = new List<int>[N]; Anser[0] = V[0]; Sushi[0] = new List<int>() { 1 }; Anser[1] = V[1]; Sushi[1] = new List<int>() { 2 }; for (int i = 2; i < N; i++) { int max = -1; int index = -1; for (int j = 0; j < i - 1; j++) { if (max < Anser[j]) { max = Anser[j]; index = j; } } Anser[i] = max + V[i]; Sushi[i] = Sushi[index].ToList(); Sushi[i].Add(i + 1); } int ans = 0; List<int> s=new List<int>(); for (int i = 0; i < N; i++) { if (ans < Anser[i]) { ans = Anser[i]; s = Sushi[i]; } } Console.WriteLine(ans); Console.WriteLine(string.Join(" ", s)); } }