#350975 (C#(csc)) No.258 回転寿司(2)

提出ソース

結果

問題	No.258 回転寿司(2)
ユーザー	EmKjp
提出日時	2019-06-11 08:35:58
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	38 ms / 2,000 ms
コード長	4,527 bytes
コンパイル時間	1,016 ms
コンパイル使用メモリ	115,908 KB
実行使用メモリ	27,716 KB
最終ジャッジ日時	2024-11-06 19:27:17
合計ジャッジ時間	6,758 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	36 ms 27,488 KB
testcase_01	AC	36 ms 25,260 KB
testcase_02	AC	36 ms 25,904 KB
testcase_03	AC	32 ms 27,032 KB
testcase_04	AC	37 ms 25,428 KB
testcase_05	AC	36 ms 27,480 KB
testcase_06	AC	35 ms 25,204 KB
testcase_07	AC	34 ms 23,344 KB
testcase_08	AC	36 ms 27,468 KB
testcase_09	AC	35 ms 23,476 KB
testcase_10	AC	31 ms 26,992 KB
testcase_11	AC	36 ms 27,468 KB
testcase_12	AC	36 ms 25,296 KB
testcase_13	AC	36 ms 25,456 KB
testcase_14	AC	37 ms 27,496 KB
testcase_15	AC	36 ms 25,688 KB
testcase_16	AC	37 ms 27,592 KB
testcase_17	AC	35 ms 25,432 KB
testcase_18	AC	37 ms 23,476 KB
testcase_19	AC	33 ms 27,164 KB
testcase_20	AC	36 ms 25,516 KB
testcase_21	AC	36 ms 27,612 KB
testcase_22	AC	32 ms 25,248 KB
testcase_23	AC	31 ms 24,948 KB
testcase_24	AC	32 ms 25,004 KB
testcase_25	AC	32 ms 25,204 KB
testcase_26	AC	36 ms 25,648 KB
testcase_27	AC	36 ms 25,164 KB
testcase_28	AC	35 ms 25,712 KB
testcase_29	AC	35 ms 27,588 KB
testcase_30	AC	31 ms 24,948 KB
testcase_31	AC	32 ms 27,284 KB
testcase_32	AC	36 ms 27,392 KB
testcase_33	AC	35 ms 25,444 KB
testcase_34	AC	35 ms 25,588 KB
testcase_35	AC	35 ms 25,464 KB
testcase_36	AC	35 ms 25,328 KB
testcase_37	AC	31 ms 23,088 KB
testcase_38	AC	35 ms 25,332 KB
testcase_39	AC	36 ms 25,456 KB
testcase_40	AC	36 ms 25,576 KB
testcase_41	AC	36 ms 27,672 KB
testcase_42	AC	36 ms 25,332 KB
testcase_43	AC	35 ms 27,340 KB
testcase_44	AC	36 ms 25,060 KB
testcase_45	AC	36 ms 23,732 KB
testcase_46	AC	32 ms 27,140 KB
testcase_47	AC	36 ms 27,492 KB
testcase_48	AC	36 ms 25,588 KB
testcase_49	AC	36 ms 27,716 KB
testcase_50	AC	33 ms 27,116 KB
testcase_51	AC	38 ms 25,200 KB
testcase_52	AC	36 ms 25,580 KB
testcase_53	AC	36 ms 25,208 KB
testcase_54	AC	36 ms 27,348 KB
testcase_55	AC	36 ms 27,376 KB
testcase_56	AC	36 ms 25,568 KB
testcase_57	AC	37 ms 25,648 KB
testcase_58	AC	38 ms 25,712 KB
testcase_59	AC	36 ms 27,500 KB
testcase_60	AC	31 ms 25,136 KB
testcase_61	AC	37 ms 25,648 KB
testcase_62	AC	36 ms 23,356 KB
testcase_63	AC	37 ms 27,620 KB
testcase_64	AC	36 ms 27,104 KB
testcase_65	AC	37 ms 27,356 KB
testcase_66	AC	31 ms 25,080 KB
testcase_67	AC	36 ms 25,452 KB
testcase_68	AC	36 ms 27,488 KB
testcase_69	AC	36 ms 27,256 KB
testcase_70	AC	35 ms 25,584 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using E = System.Linq.Enumerable;

partial class Solver
{
    public void Run()
    {
        var N = ni();
        var V = ni(N);
        var dp = new int[N];
        var pre = new int[N];

        for (int i = 0; i < N; i++)
        {
            pre[i] = -1;
            dp[i] = V[i];
            for (int j = Math.Max(0, i - 4); j < i - 1; j++)
            {
                if (dp[i] < dp[j] + V[i])
                {
                    pre[i] = j;
                    dp[i] = dp[j] + V[i];
                }
            }
        }
        var maxV = dp.Max();
        var last = Array.LastIndexOf(dp, maxV);
        var path = new List<int>();
        while (last >= 0)
        {
            path.Add(last + 1);
            last = pre[last];
        }
        path.Reverse();
        cout.WriteLine(maxV);
        cout.WriteLine(string.Join(" ", path));
    }
}


// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public static class LinqPadExtension
{
    static public T Dump<T>(this T obj)
    {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner
{
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public double[] NextDoubleArray(int size)
    {
        var array = new double[size];
        for (int i = 0; i < size; i++) array[i] = NextDouble();
        return array;
    }

    public string Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }
    static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード