結果

問題 No.329 全射
ユーザー uwiuwi
提出日時 2015-12-22 02:02:37
言語 Java
(openjdk 23)
結果
AC  
実行時間 281 ms / 2,000 ms
コード長 4,343 bytes
コンパイル時間 3,409 ms
コンパイル使用メモリ 90,476 KB
実行使用メモリ 57,292 KB
最終ジャッジ日時 2024-09-18 18:26:28
合計ジャッジ時間 10,951 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

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_2 {
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;
}
}
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;
}
}
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, C, pows);
}
}
}
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_2().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)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0