Submission #2069292
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; typedef long long ll; typedef vector<int> vi; #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i,n) rep2(i,0,n) #define rep2(i,m,n) for(int i=m;i<(n);i++) #define ALL(c) (c).begin(),(c).end() const ll MOD = 1000000007; ll powmod(ll x, ll k) { ll res = 1; for (; k; x = x * x % MOD, k /= 2) { if (k & 1) { res = res * x % MOD; } } return res; } ll fac[10010], ifac[10010]; ll comb(int n, int k) { if (n < 0 || k < 0 || k > n) return 0; return fac[n] * ifac[k] % MOD * ifac[n-k] % MOD; } int main() { fac[0] = 1; for (int i = 1; i < 10010; ++i) { fac[i] = fac[i-1] * i % MOD; } ifac[10000] = powmod(fac[10000], MOD - 2); for (int i = 9999; i >= 0; --i) { ifac[i] = ifac[i+1] * (i+1) % MOD; } int N, A, B, C; cin >> N >> A >> B >> C; if (B % 2 != 0) { puts("0"); return 0; } ll ret = 0; for (int i = 0; i <= C/3; ++i) { //3,3,3 for (int j = 0; j <= A; ++j) { //3,1 if (j + i * 3 > C) break; int one = A - j; int gr = B / 2; int z3 = C - i * 3 - j; if (gr == 0 && z3 > 0) continue; ll val = comb(one + i + j + gr, one) * comb(i + j + gr, i) % MOD * comb(j + gr, j) % MOD; if (gr > 0) val = val * comb(z3 + gr - 1, z3) % MOD; ret = (ret + val) % MOD; } } cout << ret << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | J - 123 Pairs |
User | satashun |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 1478 Byte |
Status | AC |
Exec Time | 32 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1500 / 1500 | ||||
Status |
|
|
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 | 16 ms | 384 KB |
001.txt | AC | 1 ms | 384 KB |
002.txt | AC | 1 ms | 384 KB |
003.txt | AC | 1 ms | 384 KB |
004.txt | AC | 2 ms | 384 KB |
005.txt | AC | 1 ms | 384 KB |
006.txt | AC | 1 ms | 384 KB |
007.txt | AC | 1 ms | 384 KB |
008.txt | AC | 1 ms | 384 KB |
009.txt | AC | 1 ms | 384 KB |
010.txt | AC | 1 ms | 384 KB |
011.txt | AC | 1 ms | 384 KB |
012.txt | AC | 1 ms | 384 KB |
013.txt | AC | 1 ms | 384 KB |
014.txt | AC | 2 ms | 384 KB |
015.txt | AC | 25 ms | 384 KB |
016.txt | AC | 3 ms | 384 KB |
017.txt | AC | 8 ms | 384 KB |
018.txt | AC | 3 ms | 384 KB |
019.txt | AC | 9 ms | 384 KB |
020.txt | AC | 4 ms | 384 KB |
021.txt | AC | 22 ms | 384 KB |
022.txt | AC | 3 ms | 384 KB |
023.txt | AC | 6 ms | 384 KB |
024.txt | AC | 23 ms | 384 KB |
025.txt | AC | 5 ms | 384 KB |
026.txt | AC | 14 ms | 384 KB |
027.txt | AC | 21 ms | 384 KB |
028.txt | AC | 9 ms | 384 KB |
029.txt | AC | 11 ms | 384 KB |
030.txt | AC | 21 ms | 384 KB |
031.txt | AC | 23 ms | 384 KB |
032.txt | AC | 3 ms | 384 KB |
033.txt | AC | 1 ms | 384 KB |
034.txt | AC | 9 ms | 384 KB |
035.txt | AC | 12 ms | 384 KB |
036.txt | AC | 3 ms | 384 KB |
037.txt | AC | 1 ms | 384 KB |
038.txt | AC | 32 ms | 384 KB |
039.txt | AC | 1 ms | 384 KB |
040.txt | AC | 1 ms | 384 KB |
041.txt | AC | 7 ms | 384 KB |
042.txt | AC | 2 ms | 384 KB |
043.txt | AC | 1 ms | 384 KB |
044.txt | AC | 1 ms | 384 KB |
045.txt | AC | 1 ms | 384 KB |
046.txt | AC | 1 ms | 384 KB |
047.txt | AC | 1 ms | 384 KB |
048.txt | AC | 1 ms | 384 KB |
049.txt | AC | 1 ms | 384 KB |
example0.txt | AC | 1 ms | 384 KB |
example1.txt | AC | 2 ms | 384 KB |