結果
問題 | No.329 全射 |
ユーザー |
|
提出日時 | 2015-12-22 06:17:15 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 173 ms / 2,000 ms |
コード長 | 3,800 bytes |
コンパイル時間 | 4,111 ms |
コンパイル使用メモリ | 82,216 KB |
実行使用メモリ | 52,360 KB |
最終ジャッジ日時 | 2024-09-18 18:32:16 |
合計ジャッジ時間 | 10,866 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
ソースコード
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_3 {InputStream is;PrintWriter out;String INPUT = "";int mod = 1000000007;void solve(){int z = 1005;long[][] S = new long[z + 1][z + 1];for (int i = 0; i <= z; i++) {S[i][0] = 1;for (int j = 1; j <= i; j++) {S[i][j] = S[i - 1][j - 1] + S[i - 1][j] * (j+1);S[i][j] %= mod;}}long d = 1;for(int i = 1;i <= z;i++){d = d * (i+1) % mod;for(int j = i;j <= z;j++){S[j][i] = S[j][i] * d % 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 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->iret += S[w[cur]-1][w[i]-1];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);}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_3().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)); }}