結果

問題 No.329 全射
ユーザー uwiuwi
提出日時 2015-12-22 06:17:15
言語 Java21
(openjdk 21)
結果
AC  
実行時間 173 ms / 2,000 ms
コード長 3,800 bytes
コンパイル時間 5,063 ms
コンパイル使用メモリ 80,968 KB
実行使用メモリ 64,300 KB
最終ジャッジ日時 2023-10-18 22:31:58
合計ジャッジ時間 11,883 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 104 ms
63,724 KB
testcase_01 AC 105 ms
63,732 KB
testcase_02 AC 104 ms
63,748 KB
testcase_03 AC 103 ms
63,744 KB
testcase_04 AC 107 ms
63,720 KB
testcase_05 AC 103 ms
61,836 KB
testcase_06 AC 105 ms
63,760 KB
testcase_07 AC 105 ms
63,760 KB
testcase_08 AC 105 ms
63,752 KB
testcase_09 AC 107 ms
63,852 KB
testcase_10 AC 104 ms
63,752 KB
testcase_11 AC 103 ms
63,756 KB
testcase_12 AC 104 ms
63,716 KB
testcase_13 AC 170 ms
64,124 KB
testcase_14 AC 134 ms
64,124 KB
testcase_15 AC 144 ms
64,244 KB
testcase_16 AC 138 ms
64,132 KB
testcase_17 AC 155 ms
64,252 KB
testcase_18 AC 154 ms
64,136 KB
testcase_19 AC 173 ms
64,256 KB
testcase_20 AC 166 ms
64,248 KB
testcase_21 AC 158 ms
64,092 KB
testcase_22 AC 162 ms
64,248 KB
testcase_23 AC 128 ms
64,128 KB
testcase_24 AC 130 ms
64,112 KB
testcase_25 AC 146 ms
64,120 KB
testcase_26 AC 134 ms
64,124 KB
testcase_27 AC 117 ms
64,100 KB
testcase_28 AC 107 ms
63,748 KB
testcase_29 AC 108 ms
63,752 KB
testcase_30 AC 105 ms
63,764 KB
testcase_31 AC 106 ms
63,884 KB
testcase_32 AC 117 ms
63,860 KB
testcase_33 AC 130 ms
64,160 KB
testcase_34 AC 130 ms
64,040 KB
testcase_35 AC 126 ms
64,152 KB
testcase_36 AC 120 ms
64,156 KB
testcase_37 AC 130 ms
64,300 KB
testcase_38 AC 132 ms
64,164 KB
testcase_39 AC 123 ms
63,880 KB
testcase_40 AC 128 ms
64,044 KB
testcase_41 AC 132 ms
64,148 KB
testcase_42 AC 120 ms
64,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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->i
				ret += 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)); }
}
0