結果
問題 | No.269 見栄っ張りの募金活動 |
ユーザー | paruki |
提出日時 | 2016-07-14 21:04:29 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,143 ms / 5,000 ms |
コード長 | 2,516 bytes |
コンパイル時間 | 1,841 ms |
コンパイル使用メモリ | 169,252 KB |
実行使用メモリ | 10,988 KB |
最終ジャッジ日時 | 2023-09-23 01:20:00 |
合計ジャッジ時間 | 9,413 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 9 ms
4,376 KB |
testcase_04 | AC | 1,516 ms
6,228 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2,143 ms
10,988 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 11 ms
6,408 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 679 ms
4,376 KB |
testcase_12 | AC | 5 ms
5,628 KB |
testcase_13 | AC | 297 ms
4,376 KB |
testcase_14 | AC | 199 ms
4,376 KB |
testcase_15 | AC | 423 ms
4,376 KB |
testcase_16 | AC | 12 ms
5,664 KB |
testcase_17 | AC | 2 ms
4,380 KB |
testcase_18 | AC | 524 ms
8,064 KB |
testcase_19 | AC | 157 ms
4,392 KB |
testcase_20 | AC | 93 ms
4,376 KB |
testcase_21 | AC | 314 ms
4,376 KB |
testcase_22 | AC | 103 ms
4,376 KB |
testcase_23 | AC | 4 ms
4,376 KB |
testcase_24 | AC | 253 ms
4,380 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 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() 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 operator^(long long k) const{ 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; } int N, S, K; void solve(){ vector<vector<mint>> dp(N + 1, vector<mint>(S + 1)); dp[0][0] = 1; rep(i, N)rep(j, S + 1)if(dp[i][j].toi()){ for(int k = 0;; ++k){ int nj = j + k + (k + K)*(N - 1 - i); if(nj > S)break; dp[i + 1][nj] += dp[i][j]; } } cout << dp[N][S] << endl; } int main(){ while(cin >> N >> S >> K){ solve(); } }