結果
問題 | No.584 赤、緑、青の色塗り |
ユーザー | paruki |
提出日時 | 2017-10-30 09:51:10 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 171 ms / 2,000 ms |
コード長 | 3,873 bytes |
コンパイル時間 | 1,920 ms |
コンパイル使用メモリ | 175,056 KB |
実行使用メモリ | 38,784 KB |
最終ジャッジ日時 | 2024-05-02 01:19:24 |
合計ジャッジ時間 | 2,923 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 3 ms
5,376 KB |
testcase_14 | AC | 21 ms
16,128 KB |
testcase_15 | AC | 38 ms
33,408 KB |
testcase_16 | AC | 44 ms
38,528 KB |
testcase_17 | AC | 44 ms
38,656 KB |
testcase_18 | AC | 43 ms
38,656 KB |
testcase_19 | AC | 171 ms
38,784 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define mt make_tuple #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)<<endl #define smax(x,y) (x)=max((x),(y)) #define smin(x,y) (x)=min((x),(y)) #define MEM(x,y) memset((x),(y),sizeof (x)) #define sz(x) (int)(x).size() #define pb push_back typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vll; template<int MOD> class ModInt { public: ModInt() :value(0) {} ModInt(long long val) :value((int)(val<0 ? MOD + val%MOD : val%MOD)) { } ModInt& operator+=(ModInt that) { value = value + that.value; if (value >= MOD)value -= MOD; return *this; } ModInt& operator-=(ModInt that) { value -= that.value; if (value<0)value += MOD; return *this; } ModInt& operator*=(ModInt that) { value = (int)((long long)value * that.value % MOD); return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt pow(long long k) const { if (value == 0)return 0; ModInt n = *this, res = 1; while (k) { if (k & 1)res *= n; n *= n; k >>= 1; } return res; } ModInt inverse() const { long long a = value, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return ModInt(u); } int toi() const { return value; } private: int value; }; typedef ModInt<1000000007> mint; ostream& operator<<(ostream& os, const mint& x) { os << x.toi(); return os; } vector<vector<int>> combinations(int n, int mod) { auto res = vector<vector<int>>(n + 1, vector<int>(n + 1)); rep(i, n + 1) res[i][0] = 1; for (int i = 1; i <= n; ++i) for (int j = 1; j <= i; ++j) res[i][j] = (res[i - 1][j - 1] + res[i - 1][j]) % mod; return res; } mint solve() { int N, R, G, B; cin >> N >> R >> G >> B; vector<mint> fact(N + 1, 1), p2(N + 1, 1); auto C = combinations(N + 10, (int)1e9 + 7); rep(i, N) { fact[i + 1] = fact[i] * (i + 1); p2[i + 1] = p2[i] * 2; } int a = N - R - G - B; int col = R + G + B; if (a < 0)return 0; mint ans; for (int x = 0; x * 2 <= N - a; ++x) { int y = N - a - x * 2; if (x * 2 + y != col)continue; if (a < x + y - 1)continue; // 空白、2色、1色の配置 mint z = fact[x + y] / (fact[x] * fact[y]) * C[a + 1][x + y]; for (int r2 = 0; r2 <= min(x, R); ++r2) { int gb = x - r2; if (gb > G || gb > B)continue; int r = R - r2, g = G - gb, b = B - gb; if (r > y)continue; // 孤立した赤の配置 mint w = C[y][r]; // 緑、青の並び順 if (r2 + y - r != g + b)continue; w *= fact[g + b] / (fact[g] * fact[b]); // {赤, ?}と{緑,青}だけ考慮した並び順 w *= fact[x] / (fact[r2] * fact[x - r2]); // {hoge, piyo} => (hoge, piyo), (piyo, hoge) w *= p2[x]; ans += z * w; } } return ans; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << solve() << endl; }