結果

問題 No.767 配られたジャパリまん
ユーザー uwiuwi
提出日時 2018-12-15 00:11:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 980 ms / 2,000 ms
コード長 4,946 bytes
コンパイル時間 4,402 ms
コンパイル使用メモリ 88,504 KB
実行使用メモリ 77,700 KB
最終ジャッジ日時 2024-09-25 05:28:37
合計ジャッジ時間 8,922 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
53,368 KB
testcase_01 AC 76 ms
53,420 KB
testcase_02 AC 88 ms
53,296 KB
testcase_03 AC 89 ms
53,524 KB
testcase_04 AC 94 ms
53,320 KB
testcase_05 AC 266 ms
55,588 KB
testcase_06 AC 79 ms
53,260 KB
testcase_07 AC 77 ms
53,232 KB
testcase_08 AC 90 ms
53,140 KB
testcase_09 AC 95 ms
53,480 KB
testcase_10 AC 196 ms
56,072 KB
testcase_11 AC 102 ms
53,788 KB
testcase_12 AC 98 ms
53,548 KB
testcase_13 AC 193 ms
56,532 KB
testcase_14 AC 90 ms
53,592 KB
testcase_15 AC 82 ms
53,384 KB
testcase_16 AC 104 ms
53,668 KB
testcase_17 AC 77 ms
53,508 KB
testcase_18 AC 94 ms
53,608 KB
testcase_19 AC 116 ms
54,004 KB
testcase_20 AC 980 ms
77,700 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2018;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class Day15 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int h = ni(), w = ni(), K = ni();
		int[][] co = new int[K][];
		for(int i=  0;i < K;i++){
			co[i] = new int[]{ni(), ni(), i};
		}
		
		Arrays.sort(co, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return (a[0]+a[1]) - (b[0]+b[1]);
			}
		});
		
		long[] num = new long[1<<K];
		int mod = 100000007;
		int[][] fif = enumFIF(300000, mod);
		for(int i = 0;i < 1<<K;i++){
			int x = 0, y = 0;
			long ln = 1;
			for(int j = 0;j < K;j++){
				if(i<<~j<0){
					ln = ln * C(co[j][0]-x+co[j][1]-y, co[j][0]-x, mod, fif) % mod;
					x = co[j][0]; y = co[j][1];
				}
			}
			ln = ln * C(h-x+w-y, h-x ,mod, fif);
			ln %= mod;
			num[i] = ln;
		}
		for(int i = 0;i < K;i++){
			for(int j = 0;j < 1<<K;j++){
				if(j<<~i>=0){
					num[j^1<<i] -= num[j];
					if(num[j^1<<i] < 0){
						num[j^1<<i] += mod;
					}
				}
			}
		}
		long[] ans = new long[1<<K];
		for(int i = 0;i < 1<<K;i++){
			long v = num[i];
			if(Integer.bitCount(i) % 2 != 0){
				v = mod-v;
				if(v == mod)v = 0;
			}
			int ptn = 0;
			for(int j = 0;j < K;j++){
				if(i<<~j<0){
					ptn |= 1<<co[j][2];
				}
			}
			ans[ptn] = v;
		}
		for(long v : ans)out.println(v);
	}
	
	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 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 };
	}

	
	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 Day15().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