結果

問題 No.329 全射
ユーザー uwiuwi
提出日時 2015-12-22 02:10:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 276 ms / 2,000 ms
コード長 4,262 bytes
コンパイル時間 4,012 ms
コンパイル使用メモリ 89,880 KB
実行使用メモリ 66,328 KB
最終ジャッジ日時 2024-09-18 18:27:15
合計ジャッジ時間 10,699 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 101 ms
64,240 KB
testcase_01 AC 107 ms
64,316 KB
testcase_02 AC 109 ms
64,720 KB
testcase_03 AC 109 ms
64,320 KB
testcase_04 AC 111 ms
64,384 KB
testcase_05 AC 107 ms
64,248 KB
testcase_06 AC 104 ms
64,016 KB
testcase_07 AC 105 ms
64,692 KB
testcase_08 AC 103 ms
64,256 KB
testcase_09 AC 108 ms
64,648 KB
testcase_10 AC 101 ms
64,292 KB
testcase_11 AC 110 ms
64,196 KB
testcase_12 AC 108 ms
64,488 KB
testcase_13 AC 222 ms
65,188 KB
testcase_14 AC 178 ms
65,408 KB
testcase_15 AC 186 ms
65,140 KB
testcase_16 AC 214 ms
65,928 KB
testcase_17 AC 241 ms
65,428 KB
testcase_18 AC 229 ms
65,524 KB
testcase_19 AC 276 ms
65,808 KB
testcase_20 AC 211 ms
65,276 KB
testcase_21 AC 239 ms
65,672 KB
testcase_22 AC 220 ms
65,168 KB
testcase_23 AC 150 ms
66,328 KB
testcase_24 AC 161 ms
65,116 KB
testcase_25 AC 203 ms
65,500 KB
testcase_26 AC 185 ms
65,640 KB
testcase_27 AC 129 ms
64,520 KB
testcase_28 AC 111 ms
64,364 KB
testcase_29 AC 114 ms
64,256 KB
testcase_30 AC 132 ms
64,312 KB
testcase_31 AC 108 ms
64,220 KB
testcase_32 AC 129 ms
64,440 KB
testcase_33 AC 119 ms
64,616 KB
testcase_34 AC 130 ms
64,820 KB
testcase_35 AC 121 ms
64,972 KB
testcase_36 AC 132 ms
64,544 KB
testcase_37 AC 128 ms
64,836 KB
testcase_38 AC 134 ms
64,712 KB
testcase_39 AC 132 ms
64,836 KB
testcase_40 AC 134 ms
64,712 KB
testcase_41 AC 131 ms
64,804 KB
testcase_42 AC 136 ms
64,792 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_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)); }
}
0