結果

問題 No.603 hel__world (2)
ユーザー 👑 hos.lyric
提出日時 2019-06-11 06:19:30
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 395 ms / 3,000 ms
コード長 4,074 bytes
コンパイル時間 1,038 ms
コンパイル使用メモリ 138,864 KB
実行使用メモリ 67,256 KB
最終ジャッジ日時 2024-06-22 01:40:58
合計ジャッジ時間 5,107 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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)); }
enum MO = 10L^^6 + 3;
enum LIM = cast(int)(MO);
long[] inv, fac, invFac;
void prepare() {
  inv = new long[LIM];
  fac = new long[LIM];
  invFac = new long[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = MO - ((MO / i) * inv[cast(size_t)(MO % i)]) % MO;
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = (fac[i - 1] * i) % MO;
    invFac[i] = (invFac[i - 1] * inv[i]) % MO;
  }
}
long binom(long n, long k) {
  if (0 <= k && k <= n) {
    long ret = 1;
    for (; k > 0; n /= MO, k /= MO) {
      const nn = n % MO, kk = k % MO;
      if (kk > nn) {
        return 0;
      }
      ret = (ret * fac[cast(size_t)(nn)]) % MO;
      ret = (ret * invFac[cast(size_t)(kk)]) % MO;
      ret = (ret * invFac[cast(size_t)(nn - kk)]) % MO;
    }
    return ret;
  } else {
    return 0;
  }
}
enum M = 26;
enum LIM_P = 60, LIM_Q = 40;
long[] S;
string T;
void main() {
  prepare();
  
  try {
    for (; ; ) {
      S = new long[M];
      foreach (i; 0 .. M) {
        S[i] = readLong();
      }
      T = readToken();
      
      auto lss = new long[][M];
      foreach (t; T.group) {
        lss[t[0] - 'a'] ~= t[1];
      }
      long ans = 1;
      foreach (i; 0 .. M) {
        const ls = lss[i];
        const len = cast(int)(ls.length);
        if (len > 0) {
          const sumL = ls.sum;
          const s = S[i] - sumL;
          if (s < 0) {
            ans = 0;
            break;
          }
          debug {
            writeln(cast(char)('a' + i), ": s = ", s, ", ls = ", ls);
          }
          
          /*
            decr. order of (l + x) / x
            <=> incr. order of x / l
          */
          auto xs = new long[len];
          foreach (j; 0 .. len) {
            // floor(s * ls[j] / sumL)
            const q = s / sumL, r = s % sumL;
            xs[j] = q * ls[j] + r * ls[j] / sumL;
          }
          long ss = s - xs.sum;
          debug {
            writeln("  ss = ", ss);
            writeln("  xs = ", xs);
          }
          
          // compare (xs[j] + 1) / ls[j]
          auto qs = new long[len], rs = new long[len];
          foreach (j; 0 .. len) {
            qs[j] = (xs[j] + 1) / ls[j];
            rs[j] = (xs[j] + 1) % ls[j];
          }
          BinaryHeap!(Array!int, (j0, j1) => ((qs[j0] != qs[j1]) ? (qs[j0] > qs[j1]) : (rs[j0] * ls[j1] > rs[j1] * ls[j0]))) q;
          foreach (j; 0 .. len) {
            q.insert(j);
          }
          for (; ss > 0; --ss) {
            const j = q.front;
            q.removeFront;
            ++xs[j];
            qs[j] = (xs[j] + 1) / ls[j];
            rs[j] = (xs[j] + 1) % ls[j];
            q.insert(j);
          }
          debug {
            writeln("  xs = ", xs);
          }
          
          foreach (j; 0 .. len) {
            ans *= binom(ls[j] + xs[j], ls[j]);
            ans %= MO;
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0