結果

問題 No.258 回転寿司(2)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-07-31 23:09:43
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 5,496 bytes
コンパイル時間 4,467 ms
コンパイル使用メモリ 114,352 KB
実行使用メモリ 22,684 KB
最終ジャッジ日時 2023-08-06 15:41:32
合計ジャッジ時間 11,672 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
22,536 KB
testcase_01 AC 52 ms
20,500 KB
testcase_02 AC 52 ms
20,616 KB
testcase_03 AC 54 ms
22,572 KB
testcase_04 AC 53 ms
22,496 KB
testcase_05 AC 53 ms
20,540 KB
testcase_06 AC 52 ms
20,572 KB
testcase_07 AC 52 ms
20,592 KB
testcase_08 AC 53 ms
22,496 KB
testcase_09 AC 53 ms
20,456 KB
testcase_10 AC 53 ms
20,568 KB
testcase_11 AC 53 ms
18,560 KB
testcase_12 AC 53 ms
22,632 KB
testcase_13 AC 52 ms
20,688 KB
testcase_14 AC 53 ms
20,460 KB
testcase_15 AC 53 ms
20,640 KB
testcase_16 AC 53 ms
22,568 KB
testcase_17 AC 52 ms
20,548 KB
testcase_18 AC 53 ms
20,640 KB
testcase_19 AC 54 ms
20,596 KB
testcase_20 AC 53 ms
22,636 KB
testcase_21 AC 54 ms
20,508 KB
testcase_22 AC 52 ms
20,616 KB
testcase_23 AC 51 ms
20,476 KB
testcase_24 AC 51 ms
20,556 KB
testcase_25 AC 50 ms
22,680 KB
testcase_26 AC 52 ms
20,632 KB
testcase_27 AC 53 ms
22,612 KB
testcase_28 AC 52 ms
20,576 KB
testcase_29 AC 51 ms
20,520 KB
testcase_30 AC 53 ms
20,556 KB
testcase_31 AC 52 ms
20,624 KB
testcase_32 AC 51 ms
20,520 KB
testcase_33 AC 52 ms
20,596 KB
testcase_34 AC 52 ms
20,560 KB
testcase_35 AC 52 ms
20,496 KB
testcase_36 AC 52 ms
22,508 KB
testcase_37 AC 52 ms
22,508 KB
testcase_38 AC 52 ms
22,588 KB
testcase_39 AC 52 ms
18,488 KB
testcase_40 AC 52 ms
18,468 KB
testcase_41 AC 51 ms
20,716 KB
testcase_42 AC 53 ms
22,500 KB
testcase_43 AC 53 ms
22,532 KB
testcase_44 AC 53 ms
18,544 KB
testcase_45 AC 52 ms
20,508 KB
testcase_46 AC 53 ms
22,560 KB
testcase_47 AC 53 ms
20,400 KB
testcase_48 AC 52 ms
20,580 KB
testcase_49 AC 51 ms
22,608 KB
testcase_50 AC 52 ms
20,396 KB
testcase_51 AC 52 ms
22,432 KB
testcase_52 AC 53 ms
22,488 KB
testcase_53 AC 52 ms
20,632 KB
testcase_54 AC 52 ms
20,592 KB
testcase_55 AC 53 ms
22,620 KB
testcase_56 AC 52 ms
20,592 KB
testcase_57 AC 53 ms
22,620 KB
testcase_58 AC 52 ms
20,548 KB
testcase_59 AC 52 ms
20,508 KB
testcase_60 AC 53 ms
22,564 KB
testcase_61 AC 52 ms
22,604 KB
testcase_62 AC 53 ms
20,392 KB
testcase_63 AC 53 ms
20,392 KB
testcase_64 AC 53 ms
20,552 KB
testcase_65 AC 53 ms
22,576 KB
testcase_66 AC 53 ms
22,452 KB
testcase_67 AC 52 ms
20,444 KB
testcase_68 AC 52 ms
22,616 KB
testcase_69 AC 51 ms
20,564 KB
testcase_70 AC 53 ms
22,684 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = new int[n + 1];
            for (int i = 0; i < n; i++)
                a[i + 1] = sc.Integer();
            var dp = Enumerate(n + 50, x => -100000);
            var prev = Enumerate(n + 50, x => -100000);
            dp[1] = 0;
            for (int i = 1; i <= n; i++)
            {
                if (dp[i + 2] < dp[i] + a[i])
                {
                    dp[i + 2] = dp[i] + a[i];
                    prev[i + 2] = i;
                }
                if (dp[i + 1] < dp[i])
                {
                    dp[i + 1] = dp[i];
                    prev[i + 1] = -i;
                }
            }
            if (dp[n + 2] < dp[n + 1])
            {
                dp[n + 2] = dp[n + 1];
                prev[n + 2] = prev[n + 1];
            }
            var ptr = n + 2;
            IO.Printer.Out.WriteLine(dp[n + 2]);
            var ans = new List<int>();
            while (true)
            {
                if (prev[ptr] > 0)
                {
                    ans.Add(prev[ptr]);
                }
                ptr = Math.Abs(prev[ptr]);
                if (ptr >= 100000) break;
            }
            ans.Reverse();
            IO.Printer.Out.WriteLine(ans.AsJoinedString());

        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}
#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
0