Submission #8416473
Source Code Expand
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
// dx[] = {0, -1, -1, -1, 0, 1, 1, 1};
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
cerr << fixed << setprecision(10);
}
} iosetup;
/*-------------------------------------------------*/
int mod = MOD;
struct ModInt {
unsigned val;
ModInt(): val(0) {}
ModInt(long long x) : val(x >= 0 ? x % mod : x % mod + mod) {}
ModInt pow(long long exponent) {
ModInt tmp = *this, res = 1;
while (exponent > 0) {
if (exponent & 1) res *= tmp;
tmp *= tmp;
exponent >>= 1;
}
return res;
}
ModInt &operator+=(const ModInt &rhs) { if((val += rhs.val) >= mod) val -= mod; return *this; }
ModInt &operator-=(const ModInt &rhs) { if((val += mod - rhs.val) >= mod) val -= mod; return *this; }
ModInt &operator*=(const ModInt &rhs) { val = static_cast<unsigned long long>(val) * rhs.val % mod; return *this; }
ModInt &operator/=(const ModInt &rhs) { return *this *= rhs.inv(); }
bool operator==(const ModInt &rhs) const { return val == rhs.val; }
bool operator!=(const ModInt &rhs) const { return val != rhs.val; }
bool operator<(const ModInt &rhs) const { return val < rhs.val; }
bool operator<=(const ModInt &rhs) const { return val <= rhs.val; }
bool operator>(const ModInt &rhs) const { return val > rhs.val; }
bool operator>=(const ModInt &rhs) const { return val >= rhs.val; }
ModInt operator-() const { return ModInt(val ? mod - val : 0); }
ModInt operator+(const ModInt &rhs) const { return ModInt(*this) += rhs; }
ModInt operator-(const ModInt &rhs) const { return ModInt(*this) -= rhs; }
ModInt operator*(const ModInt &rhs) const { return ModInt(*this) *= rhs; }
ModInt operator/(const ModInt &rhs) const { return ModInt(*this) /= rhs; }
friend ostream &operator<<(ostream &os, const ModInt &rhs) { return os << rhs.val; }
friend istream &operator>>(istream &is, ModInt &rhs) { long long x; is >> x; rhs = ModInt(x); return is; }
private:
ModInt inv() const {
// if (__gcd(val, mod) != 1) assert(false);
unsigned a = val, b = mod; int x = 1, y = 0;
while (b) {
unsigned tmp = a / b;
swap(a -= tmp * b, b);
swap(x -= tmp * y, y);
}
return ModInt(x);
}
};
int abs(const ModInt &x) { return x.val; }
struct Combinatorics {
int val;
vector<ModInt> fact, fact_inv, inv;
Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
fact[0] = 1;
FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
fact_inv[val] = ModInt(1) / fact[val];
for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
}
ModInt nCk(int n, int k) {
if (n < 0 || n < k || k < 0) return ModInt(0);
// assert(n <= val && k <= val);
return fact[n] * fact_inv[k] * fact_inv[n - k];
}
ModInt nPk(int n, int k) {
if (n < 0 || n < k || k < 0) return ModInt(0);
// assert(n <= val);
return fact[n] * fact_inv[n - k];
}
ModInt nHk(int n, int k) {
if (n < 0 || k < 0) return ModInt(0);
return (k == 0 ? ModInt(1) : nCk(n + k - 1, k));
}
};
const int IND = 150;
ModInt m[IND + 1][IND + 1][IND + 1] = {};
int main() {
Combinatorics com(IND);
// m[p][q][r] = ある r 人 (区別する) において
// nk <= p && ks <= q && nk + ks + snk = r を満たす場合の数
// nk = i, ks = j, snk = k のとき
REP(i, IND + 1) for (int j = 0; i + j <= IND; ++j) for (int k = 0; i + j + k <= IND; ++k) {
m[i][j][i + j + k] += com.nCk(i + j + k, i) * com.nCk(j + k, j);
}
// r を固定して累積和を取る
REP(r, IND + 1) {
REP(i, IND + 1) FOR(j, 1, IND + 1) m[i][j][r] += m[i][j - 1][r];
REP(j, IND + 1) FOR(i, 1, IND + 1) m[i][j][r] += m[i - 1][j][r];
}
// REP(i, 5) REP(j, 5) REP(k, 10) cout << i << ' ' << j << ' ' << k << ':' << m[i][j][k] << endl;
int X, S, N, K; cin >> X >> S >> N >> K;
if (X > S + N + K) {
cout << 0 << '\n';
return 0;
}
ModInt ans = 0;
REP(s, S + 1) for (int n = 0; n <= N && s + n <= X; ++n) for (int k = 0; k <= K && s + n + k <= X; ++k) { // s <= S, n <= N, k <= K
int p = min(N + K - (n + k), IND); // n + k + nk <= N + K
int q = min(K + S - (k + s), IND); // k + s + ks <= K + S
ModInt tmp = com.nCk(X, s) * com.nCk(X - s, n) * com.nCk(X - (s + n), k);
REP(sn, X - (s + n + k) + 1) {
if (s + n + sn > S + N) break; // s + n + sn <= S + N
int r = X - (s + n + k + sn); // s + n + k + sn + nk + ks + snk = N
ans += tmp * com.nCk(X - (s + n + k), sn) * m[p][q][r];
}
}
cout << ans << '\n';
return 0;
}
Submission Info
Submission Time |
|
Task |
F - 就職活動 |
User |
emthrm |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
5652 Byte |
Status |
AC |
Exec Time |
805 ms |
Memory |
13696 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
25 / 25 |
75 / 75 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
00-sample-00.txt, 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt |
Subtask1 |
01-small-04.txt, 01-small-05.txt, 01-small-06.txt, 01-small-07.txt, 01-small-08.txt, 01-small-09.txt, 01-small-10.txt, 01-small-11.txt, 01-small-12.txt, 01-small-13.txt, 01-small-14.txt, 01-small-15.txt, 01-small-16.txt, 01-small-17.txt, 01-small-18.txt, 01-small-19.txt, 01-small-20.txt, 00-sample-00.txt, 00-sample-01.txt, 00-sample-02.txt |
Subtask2 |
02-large-21.txt, 02-large-22.txt, 02-large-23.txt, 02-large-24.txt, 02-large-25.txt, 02-large-26.txt, 02-large-27.txt, 02-large-28.txt, 02-large-29.txt, 02-large-30.txt, 02-large-31.txt, 02-large-32.txt, 02-large-33.txt, 02-large-34.txt, 02-large-35.txt, 02-large-36.txt, 02-large-37.txt, 02-large-38.txt, 02-large-39.txt, 02-large-40.txt, 02-large-41.txt, 02-large-42.txt, 02-large-43.txt, 02-large-44.txt, 02-large-45.txt, 00-sample-03.txt |
Case Name |
Status |
Exec Time |
Memory |
00-sample-00.txt |
AC |
55 ms |
13696 KB |
00-sample-01.txt |
AC |
55 ms |
13696 KB |
00-sample-02.txt |
AC |
59 ms |
13696 KB |
00-sample-03.txt |
AC |
55 ms |
13696 KB |
01-small-04.txt |
AC |
55 ms |
13696 KB |
01-small-05.txt |
AC |
57 ms |
13696 KB |
01-small-06.txt |
AC |
55 ms |
13696 KB |
01-small-07.txt |
AC |
55 ms |
13696 KB |
01-small-08.txt |
AC |
55 ms |
13696 KB |
01-small-09.txt |
AC |
55 ms |
13696 KB |
01-small-10.txt |
AC |
55 ms |
13696 KB |
01-small-11.txt |
AC |
55 ms |
13696 KB |
01-small-12.txt |
AC |
55 ms |
13696 KB |
01-small-13.txt |
AC |
55 ms |
13696 KB |
01-small-14.txt |
AC |
55 ms |
13696 KB |
01-small-15.txt |
AC |
55 ms |
13696 KB |
01-small-16.txt |
AC |
55 ms |
13696 KB |
01-small-17.txt |
AC |
55 ms |
13696 KB |
01-small-18.txt |
AC |
55 ms |
13696 KB |
01-small-19.txt |
AC |
55 ms |
13696 KB |
01-small-20.txt |
AC |
55 ms |
13696 KB |
02-large-21.txt |
AC |
55 ms |
13696 KB |
02-large-22.txt |
AC |
58 ms |
13696 KB |
02-large-23.txt |
AC |
767 ms |
13696 KB |
02-large-24.txt |
AC |
94 ms |
13696 KB |
02-large-25.txt |
AC |
381 ms |
13696 KB |
02-large-26.txt |
AC |
615 ms |
13696 KB |
02-large-27.txt |
AC |
408 ms |
13696 KB |
02-large-28.txt |
AC |
460 ms |
13696 KB |
02-large-29.txt |
AC |
670 ms |
13696 KB |
02-large-30.txt |
AC |
271 ms |
13696 KB |
02-large-31.txt |
AC |
372 ms |
13696 KB |
02-large-32.txt |
AC |
285 ms |
13696 KB |
02-large-33.txt |
AC |
426 ms |
13696 KB |
02-large-34.txt |
AC |
805 ms |
13696 KB |
02-large-35.txt |
AC |
130 ms |
13696 KB |
02-large-36.txt |
AC |
701 ms |
13696 KB |
02-large-37.txt |
AC |
68 ms |
13696 KB |
02-large-38.txt |
AC |
563 ms |
13696 KB |
02-large-39.txt |
AC |
397 ms |
13696 KB |
02-large-40.txt |
AC |
777 ms |
13696 KB |
02-large-41.txt |
AC |
407 ms |
13696 KB |
02-large-42.txt |
AC |
790 ms |
13696 KB |
02-large-43.txt |
AC |
190 ms |
13696 KB |
02-large-44.txt |
AC |
317 ms |
13696 KB |
02-large-45.txt |
AC |
416 ms |
13696 KB |