結果

問題 No.243 出席番号(2)
ユーザー uwiuwi
提出日時 2015-07-11 01:36:02
言語 Java21
(openjdk 21)
結果
AC  
実行時間 242 ms / 2,000 ms
コード長 3,307 bytes
コンパイル時間 3,492 ms
コンパイル使用メモリ 82,024 KB
実行使用メモリ 52,216 KB
最終ジャッジ日時 2023-09-22 10:52:30
合計ジャッジ時間 7,325 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,196 KB
testcase_01 AC 42 ms
49,364 KB
testcase_02 AC 41 ms
49,140 KB
testcase_03 AC 59 ms
51,660 KB
testcase_04 AC 46 ms
49,160 KB
testcase_05 AC 44 ms
49,144 KB
testcase_06 AC 43 ms
49,212 KB
testcase_07 AC 52 ms
50,088 KB
testcase_08 AC 75 ms
52,216 KB
testcase_09 AC 72 ms
51,480 KB
testcase_10 AC 51 ms
49,884 KB
testcase_11 AC 47 ms
49,256 KB
testcase_12 AC 77 ms
51,840 KB
testcase_13 AC 89 ms
51,764 KB
testcase_14 AC 71 ms
51,832 KB
testcase_15 AC 73 ms
51,800 KB
testcase_16 AC 52 ms
50,244 KB
testcase_17 AC 107 ms
49,892 KB
testcase_18 AC 112 ms
51,816 KB
testcase_19 AC 79 ms
49,832 KB
testcase_20 AC 71 ms
51,684 KB
testcase_21 AC 74 ms
51,920 KB
testcase_22 AC 167 ms
52,200 KB
testcase_23 AC 146 ms
51,996 KB
testcase_24 AC 91 ms
51,852 KB
testcase_25 AC 76 ms
51,772 KB
testcase_26 AC 72 ms
51,776 KB
testcase_27 AC 242 ms
52,184 KB
testcase_28 AC 41 ms
49,240 KB
testcase_29 AC 40 ms
49,000 KB
testcase_30 AC 42 ms
49,208 KB
testcase_31 AC 41 ms
49,204 KB
testcase_32 AC 42 ms
49,232 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 Q643 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] ia = new int[n];
		for(int i = 0;i < n;i++){
			if(a[i] < n){
				ia[a[i]]++;
			}
		}
		long[] dp = new long[n+1];
		dp[0] = 1;
		int mod = 1000000007;
		for(int i = 0;i < n;i++){
			if(ia[i] == 0)continue;
			for(int j = n;j >= 1;j--){
				dp[j] += dp[j-1] * ia[i];
				dp[j] %= mod;
			}
		}
		long ret = 0;
		long f = n % 2 == 0 ? 1 : mod-1;
		for(int i = n;i >= 0;i--){
			ret += f * dp[i];
			ret %= mod;
			f = f * -(n+1-i) % mod;
			if(f < 0)f += mod;
		}
		out.println(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 Q643().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