結果

問題 No.584 赤、緑、青の色塗り
ユーザー uwiuwi
提出日時 2017-10-27 22:49:36
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,662 bytes
コンパイル時間 4,386 ms
コンパイル使用メモリ 87,744 KB
実行使用メモリ 52,768 KB
最終ジャッジ日時 2024-11-21 22:09:43
合計ジャッジ時間 8,198 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 53 ms
49,800 KB
testcase_02 AC 55 ms
49,816 KB
testcase_03 AC 54 ms
49,944 KB
testcase_04 AC 54 ms
49,836 KB
testcase_05 AC 55 ms
50,124 KB
testcase_06 AC 55 ms
49,852 KB
testcase_07 WA -
testcase_08 AC 55 ms
50,196 KB
testcase_09 AC 54 ms
50,244 KB
testcase_10 WA -
testcase_11 AC 54 ms
50,160 KB
testcase_12 AC 55 ms
49,816 KB
testcase_13 AC 56 ms
49,812 KB
testcase_14 AC 94 ms
51,284 KB
testcase_15 AC 56 ms
49,896 KB
testcase_16 AC 162 ms
52,768 KB
testcase_17 AC 55 ms
49,724 KB
testcase_18 AC 55 ms
49,784 KB
testcase_19 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest171027;
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 D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int mod = 1000000007;
		int n = ni(), r = ni(), g = ni(), b = ni();
		if(n < r + g + b || (r+g+b)/2*3 > n){
			out.println(0);
			return;
		}
		// rb bg gr r b g
		// A B C r b g
		// R = A+C+r
		// G = B+C+g
		// B = A+B+b
		// Z = n+1 - (3A+3B+3C+2r+2b+2g)
		// 2^(A+B+C)*(A+B+C+r+b+g+Z)!/A!B!C!r!b!g!Z!
		long[] ps = new long[3005];
		ps[0] = 1;
		for(int i = 1;i < ps.length;i++)ps[i] = ps[i-1] * 2 % mod;
		int[][] fif = enumFIF(10000, mod);
		
		long ret = 0;
		long big = 8L*mod*mod;
		for(int A = 0;A <= 1001;A++){
			for(int B = 0;B <= 1001 && A+B <= b;B++){
				long lret = 0;
				for(int C = 0;C <= 1001 && A+C <= r && B+C <= g;C++){
					int R = r - (A+C);
					int G = g - (B+C);
					int V = b - (A+B);
					int Z = n+1 - (3*A+3*B+3*C+2*R+2*G+2*V);
					if(Z < 0)continue;
					lret += ps[A+B+C] * fif[0][A+B+C+R+G+V+Z] % mod * fif[1][C] % mod * fif[1][R] % mod * fif[1][G] % mod * fif[1][Z];
					if(lret >= big)lret -= big;
				}
				ret += lret % mod * fif[1][A] % mod * fif[1][B] % mod * fif[1][b-(A+B)];
				if(ret >= big)ret -= big;
			}
		}
		out.println(ret%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 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