結果

問題 No.1001 注文の多い順列
ユーザー uwiuwi
提出日時 2020-02-28 22:47:20
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 3,969 bytes
コンパイル時間 3,644 ms
コンパイル使用メモリ 81,224 KB
実行使用メモリ 56,536 KB
最終ジャッジ日時 2024-10-13 18:37:46
合計ジャッジ時間 6,944 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,924 KB
testcase_01 AC 51 ms
36,924 KB
testcase_02 AC 49 ms
36,420 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 AC 52 ms
36,940 KB
testcase_13 RE -
testcase_14 AC 51 ms
36,944 KB
testcase_15 AC 52 ms
37,072 KB
testcase_16 AC 53 ms
36,976 KB
testcase_17 RE -
testcase_18 RE -
testcase_19 AC 112 ms
54,088 KB
testcase_20 AC 98 ms
49,884 KB
testcase_21 RE -
testcase_22 AC 130 ms
56,536 KB
testcase_23 RE -
testcase_24 AC 125 ms
56,280 KB
testcase_25 RE -
testcase_26 AC 52 ms
36,696 KB
testcase_27 AC 93 ms
40,516 KB
testcase_28 AC 93 ms
45,772 KB
testcase_29 RE -
testcase_30 RE -
testcase_31 AC 114 ms
50,036 KB
testcase_32 RE -
testcase_33 AC 54 ms
36,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200228;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int mod = 1000000007;
		int n = ni();
		List<Integer> less = new ArrayList<>();
		List<Integer> more = new ArrayList<>();
		int[] fless = new int[n+1];
		int[] fmore = new int[n+1];
		for(int i = 0;i < n;i++) {
			int t = ni();
			int x = ni();
			if(t == 0) {
				less.add(x);
				fless[0]++;
				fless[x+1]--;
			}else {
				more.add(x);
				fmore[x]++;
			}
		}
		for(int i = 0;i < n;i++) {
			fless[i+1] += fless[i];
			fmore[i+1] += fmore[i];
		}
		
		int u = less.size()+1;
		int v = more.size()+1;
		
		long[][] dp = new long[u][v];
		dp[0][0] = 1;
		for(int i = 0;i < u;i++) {
			for(int j = 0;j < v;j++) {
				if(i+1 < u && fless[i+1+j]-(u-i)+2 > 0) {
					dp[i+1][j] += dp[i][j] * (fless[i+1+j]-(u-i)+2);
					dp[i+1][j] %= mod;
				}
				if(j+1 < v && fmore[i+1+j]-j > 0) {
					dp[i][j+1] += dp[i][j] * (fmore[i+1+j]-j);
					dp[i][j+1] %= mod;
				}
			}
		}
		out.println(dp[u-1][v-1]);
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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