結果

問題 No.1017 Reiwa Sequence
ユーザー りあんりあん
提出日時 2020-04-03 22:59:47
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 855 ms / 2,000 ms
コード長 8,095 bytes
コンパイル時間 980 ms
コンパイル使用メモリ 121,000 KB
実行使用メモリ 363,224 KB
最終ジャッジ日時 2024-07-03 05:35:53
合計ジャッジ時間 48,772 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
30,336 KB
testcase_01 AC 41 ms
29,484 KB
testcase_02 AC 32 ms
25,772 KB
testcase_03 AC 130 ms
66,452 KB
testcase_04 AC 32 ms
19,584 KB
testcase_05 AC 47 ms
25,600 KB
testcase_06 AC 39 ms
22,144 KB
testcase_07 AC 32 ms
19,712 KB
testcase_08 AC 32 ms
19,712 KB
testcase_09 AC 187 ms
89,344 KB
testcase_10 AC 334 ms
159,100 KB
testcase_11 AC 176 ms
90,332 KB
testcase_12 AC 398 ms
185,860 KB
testcase_13 AC 307 ms
152,500 KB
testcase_14 AC 187 ms
95,152 KB
testcase_15 AC 217 ms
108,784 KB
testcase_16 AC 188 ms
95,344 KB
testcase_17 AC 287 ms
139,376 KB
testcase_18 AC 185 ms
95,272 KB
testcase_19 AC 495 ms
235,952 KB
testcase_20 AC 481 ms
236,020 KB
testcase_21 AC 485 ms
235,824 KB
testcase_22 AC 487 ms
236,016 KB
testcase_23 AC 492 ms
233,920 KB
testcase_24 AC 484 ms
235,892 KB
testcase_25 AC 487 ms
233,908 KB
testcase_26 AC 479 ms
233,996 KB
testcase_27 AC 466 ms
224,940 KB
testcase_28 AC 475 ms
227,252 KB
testcase_29 AC 361 ms
170,804 KB
testcase_30 AC 389 ms
179,736 KB
testcase_31 AC 437 ms
204,144 KB
testcase_32 AC 474 ms
220,160 KB
testcase_33 AC 358 ms
163,968 KB
testcase_34 AC 471 ms
219,520 KB
testcase_35 AC 56 ms
30,336 KB
testcase_36 AC 205 ms
96,768 KB
testcase_37 AC 480 ms
219,264 KB
testcase_38 AC 84 ms
41,216 KB
testcase_39 AC 488 ms
219,264 KB
testcase_40 AC 855 ms
363,208 KB
testcase_41 AC 798 ms
362,928 KB
testcase_42 AC 794 ms
362,772 KB
testcase_43 AC 797 ms
362,692 KB
testcase_44 AC 194 ms
81,712 KB
testcase_45 AC 807 ms
363,224 KB
testcase_46 AC 799 ms
362,440 KB
testcase_47 AC 813 ms
362,380 KB
testcase_48 AC 532 ms
226,284 KB
testcase_49 AC 179 ms
67,128 KB
testcase_50 AC 146 ms
54,272 KB
testcase_51 AC 29 ms
19,456 KB
testcase_52 AC 478 ms
222,976 KB
testcase_53 AC 458 ms
212,352 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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n = sc.Int;
        var a = sc.IntArr;
        int m = Math.Min(n, 30);
        var dp = new int[m + 1][];
        dp[0] = new int[150000 * m + 1];
        dp[0][0] = 1;
        for (int i = 0; i < m; i++)
        {
            dp[i + 1] = new int[150000 * m + 1];
            for (int j = 0; j < 150000 * m + 1; j++)
            {
                dp[i + 1][j] = dp[i][j] + (j >= a[i] ? dp[i][j - a[i]] : 0);
                if (dp[i + 1][j] >= 2) {
                    var b1 = new bool[m];
                    for (int k = i - 1, l = j; k >= 0 ; k--)
                    {
                        if (dp[k][l] == 0) {
                            b1[k] = true;
                            l -= a[k];
                        }
                    }
                    var b2 = new bool[m];
                    b2[i] = true;
                    for (int k = i - 1, l = j - a[i]; k >= 0 ; k--)
                    {
                        if (dp[k][l] == 0) {
                            b2[k] = true;
                            l -= a[k];
                        }
                    }
                    var res = new int[n];
                    for (int k = 0; k < m; k++)
                    {
                        if (b1[k] && !b2[k]) {
                            res[k] = a[k];
                        }
                        if (!b1[k] && b2[k]) {
                            res[k] = -a[k];
                        }
                    }
                    Prt("Yes");
                    Prt(res);
                    return;

                }
            }
        }
        Prt("No");

    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
    public static void Deconstruct<T>(this IList<T> v, out T a) {
        a = v[0];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b) {
        a = v[0]; b = v[1];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c) {
        a = v[0]; b = v[1]; c = v[2];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d, out T e) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3]; e = v[4];
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}
0