結果

問題 No.329 全射
ユーザー uwiuwi
提出日時 2015-12-22 02:08:50
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 4,311 bytes
コンパイル時間 4,024 ms
コンパイル使用メモリ 86,800 KB
実行使用メモリ 51,528 KB
最終ジャッジ日時 2024-09-18 18:26:50
合計ジャッジ時間 9,236 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 AC 83 ms
49,712 KB
testcase_02 AC 86 ms
49,876 KB
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
権限があれば一括ダウンロードができます

ソースコード

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][];
		for(int v : w){
			if(pows[v] == null){
				pows[v] = new long[z];
				pows[v][0] = 1;
				for(int j = 1;j < z;j++){
					pows[v][j] = pows[v][j-1] * v % 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