結果
問題 | No.329 全射 |
ユーザー | uwi |
提出日時 | 2015-12-22 02:10:20 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 317 ms / 2,000 ms |
コード長 | 4,262 bytes |
コンパイル時間 | 3,772 ms |
コンパイル使用メモリ | 83,236 KB |
実行使用メモリ | 69,156 KB |
最終ジャッジ日時 | 2023-10-18 22:26:51 |
合計ジャッジ時間 | 12,152 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 114 ms
67,428 KB |
testcase_01 | AC | 118 ms
67,412 KB |
testcase_02 | AC | 125 ms
67,632 KB |
testcase_03 | AC | 115 ms
67,720 KB |
testcase_04 | AC | 114 ms
67,596 KB |
testcase_05 | AC | 116 ms
67,584 KB |
testcase_06 | AC | 113 ms
67,420 KB |
testcase_07 | AC | 116 ms
67,420 KB |
testcase_08 | AC | 115 ms
67,412 KB |
testcase_09 | AC | 114 ms
67,364 KB |
testcase_10 | AC | 117 ms
67,428 KB |
testcase_11 | AC | 115 ms
67,432 KB |
testcase_12 | AC | 114 ms
67,432 KB |
testcase_13 | AC | 296 ms
68,964 KB |
testcase_14 | AC | 199 ms
68,724 KB |
testcase_15 | AC | 208 ms
68,540 KB |
testcase_16 | AC | 204 ms
68,876 KB |
testcase_17 | AC | 243 ms
68,488 KB |
testcase_18 | AC | 235 ms
68,840 KB |
testcase_19 | AC | 317 ms
68,960 KB |
testcase_20 | AC | 246 ms
68,720 KB |
testcase_21 | AC | 248 ms
68,736 KB |
testcase_22 | AC | 247 ms
68,544 KB |
testcase_23 | AC | 172 ms
68,380 KB |
testcase_24 | AC | 189 ms
68,424 KB |
testcase_25 | AC | 215 ms
69,156 KB |
testcase_26 | AC | 198 ms
68,984 KB |
testcase_27 | AC | 149 ms
67,740 KB |
testcase_28 | AC | 119 ms
67,476 KB |
testcase_29 | AC | 136 ms
67,844 KB |
testcase_30 | AC | 132 ms
67,864 KB |
testcase_31 | AC | 115 ms
67,428 KB |
testcase_32 | AC | 149 ms
67,804 KB |
testcase_33 | AC | 148 ms
68,252 KB |
testcase_34 | AC | 148 ms
67,828 KB |
testcase_35 | AC | 136 ms
68,336 KB |
testcase_36 | AC | 149 ms
67,812 KB |
testcase_37 | AC | 146 ms
67,960 KB |
testcase_38 | AC | 146 ms
68,240 KB |
testcase_39 | AC | 145 ms
67,960 KB |
testcase_40 | AC | 151 ms
68,164 KB |
testcase_41 | AC | 143 ms
68,008 KB |
testcase_42 | AC | 154 ms
68,224 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q663_2F { InputStream is; PrintWriter out; String INPUT = ""; int mod = 1000000007; void solve() { int z = 1005; long[][] C = new long[z + 1][z + 1]; for (int i = 0; i <= z; i++) { C[i][0] = 1; for (int j = 1; j <= i; j++) { C[i][j] = C[i - 1][j - 1] + C[i - 1][j]; if (C[i][j] >= mod) C[i][j] -= mod; } } int n = ni(), m = ni(); int[] w = na(n); boolean[][] g = new boolean[n][n]; for(int i = 0;i < n;i++){ g[i][i] = true; } for(int i = 0;i < m;i++){ g[ni()-1][ni()-1] = true; } long[][] pows = new long[z][z]; for(int i = 1;i < z;i++){ pows[i][0] = 1; for(int j = 1;j < z;j++){ pows[i][j] = pows[i][j-1] * i % mod; } } long ret = 0; int[] q = new int[n]; boolean[] ved = new boolean[n]; for(int i = 0;i < n;i++){ Arrays.fill(ved, false); int p = 0; q[p++] = i; ved[i] = true; for(int x = 0;x < p;x++){ int cur = q[x]; // cur->i ret += distinct(w[cur], w[i], mod, C, pows); for(int j = 0;j < n;j++){ if(g[j][cur] && w[j] >= w[i] && !ved[j]){ ved[j] = true; q[p++] = j; } } } } out.println(ret%mod); } long distinct(int a, int b, int mod, long[][] C, long[][] pows) { if(a < b)return 0; long ret = 0; int sig = 1; long big = 8L*mod*mod; for(int i = b;i >= 1;i--){ ret += C[b][i] * pows[i][a] * sig; // ret += C(b, i, mod, fif) * pow(i, a, mod) * sig; if(ret >= big)ret -= big; if(ret <= -big)ret += big; sig = -sig; } ret %= mod; if(ret < 0)ret += mod; return ret; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q663_2F().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }