結果

問題 No.332 数列をプレゼントに
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-12-20 23:56:20
言語 C#(csc)
(csc 3.9.0)
結果
MLE  
実行時間 -
コード長 6,997 bytes
コンパイル時間 1,825 ms
コンパイル使用メモリ 116,816 KB
実行使用メモリ 822,660 KB
最終ジャッジ日時 2023-10-18 00:03:09
合計ジャッジ時間 9,131 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
28,892 KB
testcase_01 AC 38 ms
28,892 KB
testcase_02 AC 37 ms
28,828 KB
testcase_03 AC 37 ms
28,828 KB
testcase_04 AC 58 ms
29,016 KB
testcase_05 AC 93 ms
62,128 KB
testcase_06 AC 200 ms
74,964 KB
testcase_07 AC 220 ms
115,792 KB
testcase_08 AC 175 ms
99,976 KB
testcase_09 AC 50 ms
29,280 KB
testcase_10 AC 108 ms
50,800 KB
testcase_11 AC 198 ms
88,864 KB
testcase_12 AC 186 ms
79,048 KB
testcase_13 AC 110 ms
54,300 KB
testcase_14 AC 220 ms
112,304 KB
testcase_15 AC 39 ms
28,896 KB
testcase_16 AC 49 ms
29,284 KB
testcase_17 AC 43 ms
29,020 KB
testcase_18 AC 49 ms
28,896 KB
testcase_19 AC 42 ms
29,020 KB
testcase_20 AC 39 ms
28,896 KB
testcase_21 AC 39 ms
28,896 KB
testcase_22 AC 39 ms
28,896 KB
testcase_23 MLE -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 X = sc.Long();
            var GOAL = X;
            var a = sc.Integer(n);
            var map = new HashMap<long, int>();
            var dp = new bool[1000000];
            var prev = new int[1000000];
            for (int i = 0; i < 1000000; i++)
                prev[i] = -1;
            dp[0] = true;
            var max = 0;
            var id = Enumerate(n, x => x).OrderBy(x => a[x]).ToArray();
            foreach (var _ in id)
            {
                var v = a[_];

                var next = new HashMap<long, int>();
                foreach (var kv in map)
                {
                    if (kv.Key + v > X) continue;
                    next[kv.Key] = kv.Value;
                    if (!next.ContainsKey(kv.Key + v))
                        next[kv.Key + v] = _;
                }
                for (int i = max; i >= 0; i--)
                {
                    if (!dp[i]) continue;
                    if (i + v >= 1000000)
                    {
                        if (!next.ContainsKey(i + v))
                            next[i + v] = _;
                    }
                    else if (prev[i + v] == -1)
                    {
                        dp[i + v] = true;
                        prev[i + v] = _;
                    }
                }
                max = Math.Min(1000000 - 1, max + v);
                map = next;
                if (map.ContainsKey(X)) break;
            }
            var ans = new string('x', n).ToCharArray();
            if (map.ContainsKey(X))
            {
                while (X >= 1000000)
                {
                    var pre = map[X];
                    ans[pre] = 'o';
                    X -= a[pre];
                }
            }
            if (X < 1000000 && dp[X])
            {
                while (X > 0)
                {
                    var pre = prev[X];
                    ans[pre] = 'o';
                    X -= a[pre];
                }
                IO.Printer.Out.WriteLine(new string(ans));
            }
            else
                IO.Printer.Out.WriteLine("No");
            var val = 0L;
            for (int i = 0; i < n; i++)
                if (ans[i] == 'o') val += a[i];

        }
        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 != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
        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
#region HashMap
public class HashMap<K, V> : Dictionary<K, V>
//where V : new()
{
    public HashMap() : base() { }
    public HashMap(int cap) : base(cap) { }
    new public V this[K i]
    {
        get
        {
            V v;
            return TryGetValue(i, out v) ? v :
                base[i] = default(V);
            //base[i] = new V();
        }
        set { base[i] = value; }
    }
}
#endregion
0