結果
問題 | No.329 全射 |
ユーザー | ぴろず |
提出日時 | 2015-12-22 18:20:18 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,184 bytes |
コンパイル時間 | 2,610 ms |
コンパイル使用メモリ | 79,388 KB |
実行使用メモリ | 55,884 KB |
最終ジャッジ日時 | 2024-09-18 18:38:17 |
合計ジャッジ時間 | 23,747 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 149 ms
52,024 KB |
testcase_01 | AC | 147 ms
52,212 KB |
testcase_02 | AC | 151 ms
52,132 KB |
testcase_03 | AC | 148 ms
52,356 KB |
testcase_04 | AC | 148 ms
52,116 KB |
testcase_05 | AC | 150 ms
51,968 KB |
testcase_06 | AC | 157 ms
52,316 KB |
testcase_07 | AC | 147 ms
52,308 KB |
testcase_08 | AC | 147 ms
52,232 KB |
testcase_09 | AC | 149 ms
52,372 KB |
testcase_10 | AC | 157 ms
51,968 KB |
testcase_11 | AC | 154 ms
52,044 KB |
testcase_12 | AC | 158 ms
52,224 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 148 ms
51,916 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
ソースコード
package no329; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.util.Scanner; public class Main { public static final long MOD = 1000000007; public static final int WMAX = 1000; static long[] fact = Mod.factorialArray(WMAX, MOD); static long[] factInv = Mod.factorialInverseArray(WMAX, MOD, Mod.inverseArray(WMAX, MOD)); public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); int[] w = new int[n]; for(int i=0;i<n;i++) { w[i] = sc.nextInt(); } int[][] d = new int[n][n]; for(int i=0;i<n;i++) { d[i][i] = w[i]; } for(int i=0;i<m;i++) { int u = sc.nextInt() - 1; int v = sc.nextInt() - 1; d[u][v] = w[u]; } for(int k=0;k<n;k++) { for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { d[i][j] = Math.max(d[i][j], Math.min(d[i][k], d[k][j])); } } } // System.out.println(Arrays.deepToString(d)); long[][] memo = new long[WMAX+1][WMAX+1]; long ans = 0; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if (d[i][j] >= w[j]) { int a = w[i]; int b = w[j]; if (a == b) { ans += fact[a]; }else{ if (memo[a][b] != 0) { ans += memo[a][b]; }else{ long sum = 0; for(int k=0;k<=b;k++) { long x = comb(b,k) * Mod.pow(k, a, MOD); if ((b - k) % 2 == 0) { sum += x; }else{ sum += (MOD - x); } } // System.out.println(i + "," + j + ":" + a + "->" + b + ":" + sum % MOD); ans += memo[a][b] = sum; } } } } } System.out.println(ans % MOD); } static long comb(int n,int r) { return fact[n] * factInv[r] % MOD * factInv[n-r] % MOD; } } class Mod { public static long[] factorialArray(int maxN,long mod) { long[] fact = new long[maxN+1]; fact[0] = 1 % mod; for(int i=1;i<=maxN;i++) { fact[i] = fact[i-1] * i % mod; } return fact; } public static long[] inverseArray(int maxN,long modP) { long[] inv = new long[maxN+1]; inv[1] = 1; for(int i=2;i<=maxN;i++) { inv[i] = modP - (modP / i) * inv[(int) (modP%i)] % modP; } return inv; } public static long[] factorialInverseArray(int maxN,long modP,long[] inverseArray) { long[] factInv = new long[maxN+1]; factInv[0] = 1; for(int i=1;i<=maxN;i++) { factInv[i] = factInv[i-1] * inverseArray[i] % modP; } return factInv; } public static long pow(long a,long n,long mod) { long res = 1; while(n > 0) { if ((n & 1) > 0) { res = (res * a) % mod; } a = (a * a) % mod; n/=2; } return res; } } class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;} public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try {in.close();} catch (IOException e) {}} }