Submission #18983105


Source Code Expand

Copy
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
//#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
	rep(i,a.size()) cout << a[i] << " ";
	cout << endl;
}
template<class T>
bool chmax(T&a, T b){
	if(a < b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
bool chmin(T&a, T b){
	if(a > b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}

ll F[10005], R[10005];
ll modpow(ll a, ll n){
	ll ret = 1;
	while(n){
		if(n&1) ret = ret * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return ret;
}
void init(){
	F[0] = 1;
	for(int i=1;i<10005;i++) F[i] = F[i-1] * i % mod;
	rep(i, 10005) R[i] = modpow(F[i], mod-2);
}
ll C(int a, int b){
	if(b < 0 || a < b) return 0;
	return F[a] * R[b] % mod * R[a-b] % mod;
}
int n, a, b, c;
ll ans;


int main(){
	cin >> n >> a >> b >> c;
	if(b&1){
		cout << 0 << endl; return 0;
	}
	init();
	for(int ac=0;ac<=min(a, c);ac++){
		for(int ccc=0;ccc*3+ac<=c;ccc++){
			ll add = C(ccc+b/2, ccc) * C(ccc+b/2+a, a) % mod * C(a, ac) % mod;
			if(b > 0){
				add = add * C(c-ccc*3-ac+b/2-1, b/2-1) % mod;
			}
			else{
				if(c != ccc*3 + ac) add = 0;
			}
			ans += add;
		}
	}
	cout << (ans%mod) << '\n';
}

Submission Info

Submission Time
Task J - 123 Pairs
User IH19980412
Language C++ (GCC 9.2.1)
Score 1500
Code Size 2226 Byte
Status AC
Exec Time 33 ms
Memory 3804 KB

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 19 ms 3600 KB
001.txt AC 5 ms 3688 KB
002.txt AC 5 ms 3720 KB
003.txt AC 4 ms 3688 KB
004.txt AC 8 ms 3560 KB
005.txt AC 4 ms 3604 KB
006.txt AC 5 ms 3688 KB
007.txt AC 7 ms 3576 KB
008.txt AC 5 ms 3788 KB
009.txt AC 4 ms 3572 KB
010.txt AC 6 ms 3788 KB
011.txt AC 6 ms 3612 KB
012.txt AC 7 ms 3688 KB
013.txt AC 5 ms 3716 KB
014.txt AC 4 ms 3564 KB
015.txt AC 31 ms 3720 KB
016.txt AC 9 ms 3616 KB
017.txt AC 12 ms 3604 KB
018.txt AC 7 ms 3692 KB
019.txt AC 14 ms 3760 KB
020.txt AC 10 ms 3760 KB
021.txt AC 23 ms 3612 KB
022.txt AC 9 ms 3760 KB
023.txt AC 13 ms 3720 KB
024.txt AC 28 ms 3752 KB
025.txt AC 9 ms 3688 KB
026.txt AC 19 ms 3752 KB
027.txt AC 28 ms 3760 KB
028.txt AC 12 ms 3804 KB
029.txt AC 13 ms 3692 KB
030.txt AC 32 ms 3760 KB
031.txt AC 19 ms 3752 KB
032.txt AC 10 ms 3612 KB
033.txt AC 2 ms 3560 KB
034.txt AC 11 ms 3736 KB
035.txt AC 14 ms 3620 KB
036.txt AC 8 ms 3764 KB
037.txt AC 5 ms 3576 KB
038.txt AC 33 ms 3716 KB
039.txt AC 2 ms 3560 KB
040.txt AC 2 ms 3456 KB
041.txt AC 14 ms 3764 KB
042.txt AC 5 ms 3736 KB
043.txt AC 4 ms 3692 KB
044.txt AC 4 ms 3720 KB
045.txt AC 4 ms 3564 KB
046.txt AC 5 ms 3736 KB
047.txt AC 5 ms 3736 KB
048.txt AC 4 ms 3792 KB
049.txt AC 6 ms 3760 KB
example0.txt AC 6 ms 3604 KB
example1.txt AC 3 ms 3576 KB