#601096 (D) No.1334 Multiply or Add

提出ソース

結果

問題	No.1334 Multiply or Add
ユーザー	👑 hos.lyric
提出日時	2021-01-08 22:19:10
言語	D (dmd 2.106.1)
結果	RE
実行時間	-
コード長	4,112 bytes
コンパイル時間	1,681 ms
コンパイル使用メモリ	159,840 KB
実行使用メモリ	13,896 KB
最終ジャッジ日時	2024-06-22 10:34:32
合計ジャッジ時間	7,012 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	RE	-
testcase_03	AC	22 ms 12,824 KB
testcase_04	AC	21 ms 12,804 KB
testcase_05	AC	21 ms 12,848 KB
testcase_06	AC	22 ms 12,792 KB
testcase_07	AC	23 ms 12,784 KB
testcase_08	AC	20 ms 12,756 KB
testcase_09	AC	22 ms 12,856 KB
testcase_10	AC	23 ms 12,880 KB
testcase_11	AC	21 ms 12,772 KB
testcase_12	AC	21 ms 12,792 KB
testcase_13	AC	19 ms 13,440 KB
testcase_14	AC	20 ms 12,768 KB
testcase_15	AC	20 ms 12,848 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	26 ms 12,764 KB
testcase_20	AC	27 ms 12,640 KB
testcase_21	AC	26 ms 13,600 KB
testcase_22	AC	20 ms 12,800 KB
testcase_23	AC	22 ms 12,780 KB
testcase_24	AC	20 ms 12,816 KB
testcase_25	AC	22 ms 12,740 KB
testcase_26	AC	21 ms 12,860 KB
testcase_27	AC	20 ms 12,968 KB
testcase_28	AC	21 ms 12,788 KB
testcase_29	AC	21 ms 12,872 KB
testcase_30	AC	21 ms 12,864 KB
testcase_31	AC	22 ms 12,832 KB
testcase_32	AC	22 ms 12,624 KB
testcase_33	AC	20 ms 12,812 KB
testcase_34	AC	23 ms 13,896 KB
testcase_35	AC	22 ms 12,852 KB
testcase_36	AC	22 ms 12,624 KB
testcase_37	AC	22 ms 12,808 KB
testcase_38	AC	22 ms 12,776 KB
testcase_39	AC	1 ms 6,940 KB
testcase_40	AC	9 ms 6,940 KB
testcase_41	AC	4 ms 6,944 KB
testcase_42	AC	5 ms 6,940 KB
testcase_43	AC	15 ms 7,456 KB
testcase_44	AC	8 ms 6,944 KB
testcase_45	AC	4 ms 6,944 KB
testcase_46	AC	9 ms 6,940 KB
testcase_47	AC	14 ms 8,232 KB
testcase_48	AC	9 ms 6,940 KB
testcase_49	AC	19 ms 11,888 KB
testcase_50	RE	-
testcase_51	RE	-
testcase_52	RE	-
testcase_53	RE	-
testcase_54	RE	-
testcase_55	RE	-
testcase_56	AC	1 ms 6,940 KB
testcase_57	AC	1 ms 6,940 KB
testcase_58	AC	1 ms 6,940 KB
testcase_59	AC	1 ms 6,940 KB
testcase_60	AC	1 ms 6,940 KB
testcase_61	AC	1 ms 6,940 KB
testcase_62	AC	1 ms 6,940 KB
testcase_63	AC	1 ms 6,944 KB
testcase_64	AC	1 ms 6,944 KB
testcase_65	AC	2 ms 6,944 KB
testcase_66	RE	-
testcase_67	RE	-
testcase_68	RE	-
testcase_69	RE	-
testcase_70	RE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


struct ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 10^^9 + 7;
alias Mint = ModInt!MO;

enum LIM = 10L^^9;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      long prod = 1;
      foreach (i; 0 .. N) {
        prod *= A[i];
        chmin(prod, LIM);
      }
      if (prod >= LIM) {
        int l, r;
        for (l = 0; l < N && A[l] == 1; ++l) {}
        for (r = N; r > 0 && A[r - 1] == 1; --r) {}
        Mint ans;
        if (l <= r) {
          ans = 1;
          foreach (i; l .. r) {
            ans *= A[i];
          }
          ans += l;
          ans += (N - r);
        } else {
          ans = N;
        }
        writeln(ans);
assert(false);
      } else {
        alias Entry = Tuple!(long, "score", long, "a");
        Entry[] es;
        auto dp = new long[N + 1];
        dp[0] = 0;
        foreach (i; 0 .. N) {
          chmax(dp[i + 1], dp[i] + A[i]);
          if (i == 0 || A[i] > 1) {
            es ~= Entry(dp[i], A[i]);
          }
          long now = 1;
          foreach_reverse (ref e; es) {
            now *= e.a;
            chmax(dp[i + 1], e.score + now);
          }
        }
        writeln(dp[N]);
      }
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード