結果

問題 No.329 全射
ユーザー 👑 hos.lyric
提出日時 2019-01-18 18:17:31
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 41 ms / 2,000 ms
コード長 2,414 bytes
コンパイル時間 743 ms
コンパイル使用メモリ 121,740 KB
実行使用メモリ 13,704 KB
最終ジャッジ日時 2024-06-13 02:59:49
合計ジャッジ時間 3,091 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

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

import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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; }
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) 
    >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }
immutable MO = 10L^^9 + 7;
immutable LIM = 1010;
long[] fac;
long[][] S;
void prepare() {
  fac = new long[LIM];
  fac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = (fac[i - 1] * i) % MO;
  }
  S = new long[][LIM];
  foreach (i; 0 .. LIM) {
    S[i] = new long[i + 1];
    S[i][0] = 0;
    S[i][i] = 1;
    foreach (j; 1 .. i) {
      S[i][j] = (S[i - 1][j - 1] + j * S[i - 1][j]) % MO;
    }
  }
}
int N, M;
int[] W;
int[] A, B;
void main() {
  prepare();
  
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      W = new int[N];
      foreach (u; 0 .. N) {
        W[u] = readInt();
      }
      A = new int[M];
      B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      
      auto d = new int[][](N, N);
      foreach (u; 0 .. N) {
        d[u][u] = W[u];
      }
      foreach (i; 0 .. M) {
        chmax(d[A[i]][B[i]], min(W[A[i]], W[B[i]]));
      }
      foreach (w; 0 .. N) foreach (u; 0 .. N) foreach (v; 0 .. N) {
        chmax(d[u][v], min(d[u][w], d[w][v]));
      }
      debug {
        writeln("d = ", d);
      }
      
      long ans;
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        if (d[u][v] == W[v]) {
          (ans += fac[W[v]] * S[W[u]][W[v]]) %= MO;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0