結果

問題 No.329 全射
ユーザー uwiuwi
提出日時 2015-12-22 01:58:33
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,885 bytes
コンパイル時間 4,240 ms
コンパイル使用メモリ 86,320 KB
実行使用メモリ 47,396 KB
最終ジャッジ日時 2024-09-18 18:25:39
合計ジャッジ時間 8,059 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
42,348 KB
testcase_01 AC 49 ms
36,892 KB
testcase_02 AC 50 ms
37,208 KB
testcase_03 AC 48 ms
37,344 KB
testcase_04 AC 49 ms
37,348 KB
testcase_05 AC 51 ms
36,768 KB
testcase_06 AC 49 ms
37,192 KB
testcase_07 AC 49 ms
37,080 KB
testcase_08 AC 47 ms
37,280 KB
testcase_09 AC 46 ms
37,336 KB
testcase_10 AC 46 ms
37,292 KB
testcase_11 AC 47 ms
37,328 KB
testcase_12 AC 47 ms
37,128 KB
testcase_13 TLE -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class Q663 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	int mod = 1000000007;
	
	void solve()
	{
		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;
		for(int i = 0;i < n;i++){
			Queue<Integer> q = new ArrayDeque<Integer>();
			boolean[] ved = new boolean[n];
			q.add(i);
			ved[i] = true;
			while(!q.isEmpty()){
				int cur = q.poll();
				for(int j = 0;j < n;j++){
					if(g[j][cur] && w[j] >= w[i] && !ved[j]){
						ved[j] = true;
						q.add(j);
					}
				}
			}
			for(int j = 0;j < n;j++){
				if(ved[j]){
					// j->i
					ret += distinct(w[j], w[i], mod);
				}
			}
		}
		out.println(ret%mod);
	}
	
	int[][] fif = enumFIF(1000, mod);
	
	long distinct(int a, int b, int mod)
	{
		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, 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;
	}
	
	public static int[][] enumFIF(int n, int mod) {
		int[] f = new int[n + 1];
		int[] invf = new int[n + 1];
		f[0] = 1;
		for (int i = 1; i <= n; i++) {
			f[i] = (int) ((long) f[i - 1] * i % mod);
		}
		long a = f[n];
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		invf[n] = (int) (p < 0 ? p + mod : p);
		for (int i = n - 1; i >= 0; i--) {
			invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);
		}
		return new int[][] { f, invf };
	}
	
	public static long C(int n, int r, int mod, int[][] fif) {
		if (n < 0 || r < 0 || r > n)
			return 0;
		return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;
	}
	
	public static long pow(long a, long n, long mod) {
		//		a %= mod;
		long ret = 1;
		int x = 63 - Long.numberOfLeadingZeros(n);
		for (; x >= 0; x--) {
			ret = ret * ret % mod;
			if (n << 63 - x < 0)
				ret = ret * a % 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().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