結果

問題 No.258 回転寿司(2)
ユーザー くれちー
提出日時 2017-07-26 14:38:27
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 3,084 bytes
コンパイル時間 1,429 ms
コンパイル使用メモリ 121,644 KB
実行使用メモリ 25,216 KB
最終ジャッジ日時 2024-11-06 19:14:37
合計ジャッジ時間 7,633 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 67
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

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());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0