Submission #1001004


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <iostream>

using namespace std;

#define MOD 1000000007
#define ADD(X,Y) ((X) = ((X) + (Y)) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;

int N, A, B, C;
int Comb[10050][5050];

int main()
{
	for (int i = 0; i <= 5000; ++i) Comb[0][i] = 0;
	Comb[0][0] = 1;
	for (int i = 1; i <= 10010; ++i) {
		Comb[i][0] = 1;
		for (int j = 1; j <= 5010; ++j) Comb[i][j] = (Comb[i - 1][j - 1] + Comb[i - 1][j]) % MOD;
	}
	scanf("%d%d%d%d", &N, &A, &B, &C);
	if (B % 2 == 1) {
		puts("0");
		return 0;
	}
	i64 ret = 0;
	for (int p = 0; p <= C; ++p) {
		if (B == 0 && p > 0) continue;
		for (int q = 0; 3 * q <= C - p; q++) {
			int r = C - p - 3 * q;
			int iso = A - r;
			if (iso < 0) continue;
			i64 tmp = (i64)Comb[B / 2 + q + r + iso][iso] * Comb[B / 2 + q + r][B / 2] % MOD * Comb[q + r][q] % MOD;
			if (B > 0) {
				tmp = tmp * Comb[B / 2 - 1 + p][p];
			}
			ADD(ret, tmp);
		}
	}
	printf("%lld\n", ret);
	return 0;
}

Submission Info

Submission Time
Task J - 123 Pairs
User semiexp
Language C++14 (GCC 5.4.1)
Score 1500
Code Size 1208 Byte
Status AC
Exec Time 305 ms
Memory 197760 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &N, &A, &B, &C);
                                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1500 / 1500
Status
AC × 2
AC × 52
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 293 ms 197760 KB
001.txt AC 282 ms 197760 KB
002.txt AC 279 ms 197760 KB
003.txt AC 279 ms 197760 KB
004.txt AC 283 ms 197760 KB
005.txt AC 280 ms 197760 KB
006.txt AC 279 ms 197760 KB
007.txt AC 279 ms 197760 KB
008.txt AC 279 ms 197760 KB
009.txt AC 280 ms 197760 KB
010.txt AC 278 ms 197760 KB
011.txt AC 278 ms 197760 KB
012.txt AC 278 ms 197760 KB
013.txt AC 278 ms 197760 KB
014.txt AC 279 ms 197760 KB
015.txt AC 301 ms 197760 KB
016.txt AC 281 ms 197760 KB
017.txt AC 286 ms 197760 KB
018.txt AC 280 ms 197760 KB
019.txt AC 286 ms 197760 KB
020.txt AC 281 ms 197760 KB
021.txt AC 298 ms 197760 KB
022.txt AC 281 ms 197760 KB
023.txt AC 283 ms 197760 KB
024.txt AC 299 ms 197760 KB
025.txt AC 283 ms 197760 KB
026.txt AC 291 ms 197760 KB
027.txt AC 297 ms 197760 KB
028.txt AC 285 ms 197760 KB
029.txt AC 288 ms 197760 KB
030.txt AC 294 ms 197760 KB
031.txt AC 298 ms 197760 KB
032.txt AC 280 ms 197760 KB
033.txt AC 279 ms 197760 KB
034.txt AC 286 ms 197760 KB
035.txt AC 288 ms 197760 KB
036.txt AC 282 ms 197760 KB
037.txt AC 280 ms 197760 KB
038.txt AC 305 ms 197760 KB
039.txt AC 279 ms 197760 KB
040.txt AC 278 ms 197760 KB
041.txt AC 285 ms 197760 KB
042.txt AC 279 ms 197760 KB
043.txt AC 279 ms 197760 KB
044.txt AC 279 ms 197760 KB
045.txt AC 280 ms 197760 KB
046.txt AC 279 ms 197760 KB
047.txt AC 279 ms 197760 KB
048.txt AC 278 ms 197760 KB
049.txt AC 279 ms 197760 KB
example0.txt AC 279 ms 197760 KB
example1.txt AC 278 ms 197760 KB