結果

問題 No.1334 Multiply or Add
ユーザー りあんりあん
提出日時 2021-01-08 22:03:20
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 158 ms / 2,000 ms
コード長 7,578 bytes
コンパイル時間 4,562 ms
コンパイル使用メモリ 116,812 KB
実行使用メモリ 47,068 KB
最終ジャッジ日時 2023-08-10 09:38:44
合計ジャッジ時間 14,956 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
23,752 KB
testcase_01 AC 63 ms
21,652 KB
testcase_02 AC 61 ms
21,552 KB
testcase_03 AC 121 ms
37,448 KB
testcase_04 AC 121 ms
35,232 KB
testcase_05 AC 122 ms
37,360 KB
testcase_06 AC 120 ms
37,396 KB
testcase_07 AC 121 ms
33,300 KB
testcase_08 AC 121 ms
37,372 KB
testcase_09 AC 121 ms
37,420 KB
testcase_10 AC 121 ms
39,412 KB
testcase_11 AC 122 ms
35,384 KB
testcase_12 AC 118 ms
33,320 KB
testcase_13 AC 119 ms
33,292 KB
testcase_14 AC 121 ms
35,340 KB
testcase_15 AC 121 ms
35,344 KB
testcase_16 AC 122 ms
35,356 KB
testcase_17 AC 122 ms
33,304 KB
testcase_18 AC 122 ms
35,336 KB
testcase_19 AC 121 ms
35,324 KB
testcase_20 AC 121 ms
33,292 KB
testcase_21 AC 122 ms
37,388 KB
testcase_22 AC 123 ms
35,316 KB
testcase_23 AC 121 ms
35,368 KB
testcase_24 AC 121 ms
37,356 KB
testcase_25 AC 122 ms
37,392 KB
testcase_26 AC 121 ms
37,392 KB
testcase_27 AC 121 ms
37,392 KB
testcase_28 AC 122 ms
37,564 KB
testcase_29 AC 122 ms
35,340 KB
testcase_30 AC 121 ms
35,384 KB
testcase_31 AC 121 ms
33,348 KB
testcase_32 AC 121 ms
35,364 KB
testcase_33 AC 120 ms
37,368 KB
testcase_34 AC 121 ms
37,372 KB
testcase_35 AC 119 ms
37,372 KB
testcase_36 AC 118 ms
33,276 KB
testcase_37 AC 120 ms
37,408 KB
testcase_38 AC 122 ms
37,392 KB
testcase_39 AC 61 ms
21,716 KB
testcase_40 AC 87 ms
26,004 KB
testcase_41 AC 75 ms
22,684 KB
testcase_42 AC 77 ms
22,656 KB
testcase_43 AC 100 ms
29,884 KB
testcase_44 AC 87 ms
24,060 KB
testcase_45 AC 75 ms
22,788 KB
testcase_46 AC 86 ms
28,152 KB
testcase_47 AC 96 ms
24,940 KB
testcase_48 AC 89 ms
26,372 KB
testcase_49 AC 115 ms
34,880 KB
testcase_50 AC 146 ms
41,488 KB
testcase_51 AC 144 ms
41,564 KB
testcase_52 AC 147 ms
43,608 KB
testcase_53 AC 145 ms
41,536 KB
testcase_54 AC 145 ms
43,508 KB
testcase_55 AC 158 ms
47,068 KB
testcase_56 AC 62 ms
21,748 KB
testcase_57 AC 63 ms
21,628 KB
testcase_58 AC 62 ms
21,596 KB
testcase_59 AC 64 ms
21,768 KB
testcase_60 AC 63 ms
21,700 KB
testcase_61 AC 62 ms
21,620 KB
testcase_62 AC 63 ms
21,728 KB
testcase_63 AC 63 ms
23,660 KB
testcase_64 AC 62 ms
21,696 KB
testcase_65 AC 63 ms
23,648 KB
testcase_66 AC 132 ms
41,616 KB
testcase_67 AC 113 ms
37,952 KB
testcase_68 AC 72 ms
22,220 KB
testcase_69 AC 140 ms
40,724 KB
testcase_70 AC 136 ms
42,196 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 << 28); // 256 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 l = 0, r = n;
        while (l < n && a[l] == 1) ++l;
        while (r > 0 && a[r - 1] == 1) --r;
        if (l >= r) {
            Prt(n);
            return;
        }
        int c = l + n - r;
        {
            bool f = false;
            long m = 1;
            for (int i = l; i < r; i++)
            {
                m *= a[i];
                if (m >= M) {
                    m %= M;
                    f = true;
                }
            }
            if (f) {
                Prt((m + c) % M);
                return;
            }
        }
        var b = new List<P>();
        for (int i = l; i < r; )
        {
            int j = i;
            int s = 0;
            int m = 1;
            while (j < r && a[i] == a[j]) {
                s += a[j];
                m *= a[j];
                ++j;
            }
            b.Add(new P(s, m));
            i = j;
        }
        int nn = b.Count;
        var dp = new long[nn + 1];
        for (int i = 0; i < nn; i++)
        {
            dp[i + 1] = dp[i] + Math.Max(b[i].v1, b[i].v2);
            int m = b[i].v2;
            for (int j = i - 1; j >= 0 ; j--)
            {
                m *= b[j].v2;
                dp[i + 1] = Math.Max(dp[i + 1], dp[j] + m);
            }
        }
        Prt((dp.Last() + c) % M);
    }
}

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;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j) {
        for (int k = 0; k < 4; k++) yield return new P(i + dd[k], j + dd[k ^ 1]);
    }
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    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.SelectMany(x => x));
    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;
    }
}

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 => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    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]);
    }
    public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f) {
        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]); f = cv<Y>(ar[5]);
    }
}
0