#67595 (C#(csc)) No.332 数列をプレゼントに

提出ソース

結果

問題	No.332 数列をプレゼントに
ユーザー	紙ぺーぱー
提出日時	2015-12-21 00:10:42
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	649 ms / 2,000 ms
コード長	6,285 bytes
コンパイル時間	950 ms
コンパイル使用メモリ	112,384 KB
実行使用メモリ	18,560 KB
最終ジャッジ日時	2024-06-06 15:13:20
合計ジャッジ時間	15,474 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	24 ms 18,304 KB
testcase_01	AC	23 ms 18,048 KB
testcase_02	AC	23 ms 18,304 KB
testcase_03	AC	22 ms 18,048 KB
testcase_04	AC	23 ms 18,432 KB
testcase_05	AC	24 ms 18,176 KB
testcase_06	AC	24 ms 18,432 KB
testcase_07	AC	649 ms 18,176 KB
testcase_08	AC	28 ms 18,560 KB
testcase_09	AC	24 ms 18,176 KB
testcase_10	AC	629 ms 18,048 KB
testcase_11	AC	41 ms 18,304 KB
testcase_12	AC	25 ms 18,304 KB
testcase_13	AC	25 ms 18,560 KB
testcase_14	AC	25 ms 18,304 KB
testcase_15	AC	26 ms 18,432 KB
testcase_16	AC	23 ms 18,432 KB
testcase_17	AC	24 ms 18,432 KB
testcase_18	AC	28 ms 18,304 KB
testcase_19	AC	26 ms 18,432 KB
testcase_20	AC	26 ms 18,304 KB
testcase_21	AC	25 ms 18,304 KB
testcase_22	AC	24 ms 18,304 KB
testcase_23	AC	64 ms 18,560 KB
testcase_24	AC	628 ms 18,304 KB
testcase_25	AC	628 ms 18,176 KB
testcase_26	AC	95 ms 18,432 KB
testcase_27	AC	25 ms 18,432 KB
testcase_28	AC	626 ms 18,176 KB
testcase_29	AC	618 ms 18,176 KB
testcase_30	AC	35 ms 18,432 KB
testcase_31	AC	608 ms 18,176 KB
testcase_32	AC	610 ms 18,048 KB
testcase_33	AC	585 ms 18,176 KB
testcase_34	AC	614 ms 18,048 KB
testcase_35	AC	624 ms 18,176 KB
testcase_36	AC	25 ms 18,304 KB
testcase_37	AC	628 ms 18,432 KB
testcase_38	AC	639 ms 18,176 KB
testcase_39	AC	326 ms 18,432 KB
testcase_40	AC	629 ms 18,048 KB
testcase_41	AC	625 ms 18,176 KB
testcase_42	AC	640 ms 18,176 KB
testcase_43	AC	607 ms 18,176 KB
testcase_44	AC	30 ms 18,304 KB
testcase_45	AC	622 ms 18,032 KB
testcase_46	AC	628 ms 18,304 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.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 a = sc.Integer(n);
            var id = Enumerate(n, x => x);
            //降順ソート
            Array.Sort(id, (l, r) => a[r].CompareTo(a[l]));

            var ans = new char[n];
            for (int i = 0; i < n; i++)
                ans[i] = 'x';

            //大きい方からいくつかは全て試す
            var m = Math.Min(22, n);


            var sum = 0;
            //残りはDPで求める
            for (int i = m; i < n; i++)
                sum += a[id[i]];
            var dp = new bool[sum + 1];
            var prev = new int[sum + 1];
            for (int i = 0; i <= sum; i++)
                prev[i] = -1;
            dp[0] = true;
            for (int i = m, max = 0; i < n; i++)
            {
                var v = a[id[i]];
                for (int j = max; j >= 0; j--)
                {
                    if (!dp[j]) continue;
                    if (dp[j + v]) continue;
                    dp[j + v] = true;
                    prev[j + v] = id[i];
                }
                max+=v;
            }


            for (int i = 0; i<1<<m; i++)
            {
                long v = 0;
                for (int j = 0; j < m; j++)
                    if ((i >> j & 1) == 1) v += a[id[j]];
                var rem = X - v;
                if (rem < 0) continue;
                if (rem > sum) continue;
                if (dp[rem])
                {
                    while (rem > 0)
                    {
                        var p = prev[rem];
                        ans[p] = 'o';
                        rem -= a[p];
                    }
                    for (int j = 0; j < m; j++)
                        if ((i >> j & 1) == 1) ans[id[j]] = 'o';
                    IO.Printer.Out.WriteLine(ans.AsString());
                    return;
                }
            }
            IO.Printer.Out.WriteLine("No");
        }
        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

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード