結果
| 問題 | No.269 見栄っ張りの募金活動 |
| ユーザー |
 soraie_
|
| 提出日時 | 2021-07-21 19:02:30 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 14 ms / 5,000 ms |
| コード長 | 11,572 bytes |
| コンパイル時間 | 5,609 ms |
| コンパイル使用メモリ | 282,216 KB |
| 最終ジャッジ日時 | 2025-01-23 03:25:22 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 22 |
ソースコード
#ifdef _DEBUG#ifdef _SORAIE#define _GLIBCXX_DEBUG#endif#endif#include <bits/stdc++.h>#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")using namespace std;//--------------------------------------------------------------------#define all(a) (a).begin(),(a).end()#define rall(a) (a).rbegin(),(a).rend()#define overload4(_1,_2,_3,_4,name,...) name#define rep1(n) for(ll _ThiS_WoNt_Be_usEd=0;_ThiS_WoNt_Be_usEd<(ll)n;++_ThiS_WoNt_Be_usEd)#define rep2(i,n) for(ll i=0;i<(ll)n;++i)#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)#define rep4(i,a,b,c) for(ll i=(ll)a;i<(ll)b;i+=(ll)c)#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)#ifdef _DEBUG#define pass(...) __VA_ARGS__ ;#define debug1(a) cerr<<(#a)<<": "<<(a)<<"\n"#define debug2(a,b) cerr<<(#a)<<": "<<(a)<<", "<<(#b)<<": "<<(b)<<"\n"#define debug3(a,b,c) cerr<<(#a)<<": "<<(a)<<", "<<(#b)<<": "<<(b)<<", "<<(#c)<<": "<<(c)<<"\n"#define debug4(a,b,c,d) cerr<<(#a)<<": "<<(a)<<", "<<(#b)<<": "<<(b)<<", "<<(#c)<<": "<<(c)<<", "<<(#d)<<": "<<(d)<<"\n"/*#define debug1(a) cout<<#a<<": "<<a<<"\n"#define debug2(a,b) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<"\n"#define debug3(a,b,c) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<", "<<#c<<": "<<c<<"\n"#define debug4(a,b,c,d) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<", "<<#c<<": "<<c<<", "<<#d<<": "<<d<<"\n"*/#define debug(...) overload4(__VA_ARGS__,debug4,debug3,debug2,debug1)(__VA_ARGS__)#define koko cerr << "koko\n";#else#define debug(...) void(0)#define pass(...) void(0);#define koko void(0);#endif#define mp make_pair#define ten(d) int64_t(1e##d)struct asdfghjkl{asdfghjkl(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}} qwertyuiop;void doset(int n){cout << fixed << setprecision(n);cerr << fixed << setprecision(n);}using ll = long long;using ld = long double;using dou = double;template<class First,class Second>ostream& operator<<(ostream& os,const pair<First,Second>& pp){return os << "{" << pp.first << "," << pp.second << "}";}template<class T>ostream& operator<<(ostream& os,const vector<T>& VV){if(VV.empty())return os<<"[]";os<<"[";rep(i,VV.size())os<<VV[i]<<(i==int(VV.size()-1)?"]":",");return os;}template<class T>ostream& operator<<(ostream& os,const set<T>& SS){if(SS.empty())return os<<"[]";os<<"[";auto ii=SS.begin();for(;ii!=SS.end();ii++)os<<*ii<<(ii==prev(SS.end())?"]":",");return os;}template<class Key,class Tp>ostream& operator<<(ostream& os,const map<Key,Tp>& MM){if(MM.empty())return os<<"[]";os<<"[";auto ii=MM.begin();for(;ii!=MM.end();ii++)os<<"{"<<ii->first<<":"<<ii->second<<"}"<<(ii==prev(MM.end())?"]":",");return os;}constexpr int inf = 1 << 30;constexpr ll INF = 1LL << 61;constexpr ld pi = 3.14159265358;constexpr ll mod1 = 1000000007LL;constexpr ll mod2 = 998244353LL;using pll = pair<ll,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;template<class T, class U> inline bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }template<class T, class U> inline bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }ll modpow(ll n,ll m,ll MOD){if(m == 0)return 1;if(m < 0)return 0;ll res = 1;n %= MOD;while(m){if(m & 1)res = (res * n) % MOD;m >>= 1;n *= n;n %= MOD;}return res;}ll mypow(ll n,ll m){if(m == 0)return 1;if(m < 0)return -1;ll res = 1;while(m){if(m & 1)res = (res * n);m >>= 1;n *= n;}return res;}inline bool isp(ll n){bool res = true;if(n == 1 || n == 0)return false;else{for(ll i = 2;i * i <= n;i++){if(n % i == 0){res = false;break;}}return res;}}inline bool Yes(bool b = 1){cout << (b ? "Yes\n":"No\n");return b;}inline bool YES(bool b = 1){cout << (b ? "YES\n":"NO\n");return b;}map<ll,ll> primefactor(ll n){map<ll,ll> ma;if(n <= 1)return ma;ll m = n;for(ll i = 2;i * i <= n;i++){while(m % i == 0){ma[i]++;m /= i;}}if(m != 1)ma[m]++;return ma;}vector<ll> divisor(ll n,bool sorted = true,bool samein = false){vector<ll> res;for(ll i = 1;i * i <= n;i++){if(n % i == 0){res.push_back(i);if(i * i != n || samein)res.push_back(n / i);}}if(sorted)sort(all(res));return res;}ll __lcm(ll a,ll b){return a / __gcd(a,b) * b;}template<class T>T sum(const vector<T> &V){T r=0;for(auto x:V)r+=x;return r;}template<class T>T sum(const initializer_list<T> &V){T r=0;for(auto x:V)r+=x;return r;}namespace fastio{static constexpr size_t buf_size = 1 << 18;static constexpr size_t integer_size = 20;static constexpr size_t block_size = 10000;static char inbuf[buf_size + 1] = {};static char outbuf[buf_size + 1] = {};static char block_str[block_size * 4 + 1] = {};static constexpr uint64_t power10[] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000,1000000000, 10000000000, 100000000000, 1000000000000, 10000000000000,100000000000000, 1000000000000000, 10000000000000000, 100000000000000000,1000000000000000000, 10000000000000000000u};struct Scanner {private:size_t pos,end;void load() {end = fread(inbuf,1,buf_size,stdin);inbuf[end] = '\0';}void reload() {size_t len = end - pos;memmove(inbuf,inbuf + pos,len);end = len + fread(inbuf + len,1,buf_size - len,stdin);inbuf[end] = '\0';pos = 0;}void skip_space() {while(inbuf[pos] <= ' '){if(__builtin_expect(++pos == end, 0)) reload();}}char get_next() { return inbuf[pos++]; }char get_next_nonspace() {skip_space();return inbuf[pos++];}public:Scanner() { load(); }void scan(char& c) { c = get_next_nonspace(); }void scan(std::string& s){skip_space();s = "";do {size_t start = pos;while (inbuf[pos] > ' ') pos++;s += std::string(inbuf + start, inbuf + pos);if (inbuf[pos] !='\0') break;reload();} while (true);}template <class T>typename std::enable_if<std::is_integral<T>::value, void>::type scan(T &x) {char c = get_next_nonspace();if(__builtin_expect(pos + integer_size >= end, 0)) reload();bool neg = false;if (c == '-') neg = true, x = 0;else x = c & 15;while ((c = get_next()) >= '0') x = x * 10 + (c & 15);if (neg) x = -x;}template <class Head, class... Others>void scan(Head& head, Others&... others) {scan(head); scan(others...);}template <class T>Scanner& operator >> (T& x) {scan(x); return *this;}};struct Printer {private:size_t pos = 0;void flush() {fwrite(outbuf, 1, pos, stdout);pos = 0;}void pre_calc() {for (size_t i = 0; i < block_size; i++) {size_t j = 4, k = i;while (j--) {block_str[i * 4 + j] = k % 10 + '0';k /= 10;}}}static constexpr size_t get_integer_size(uint64_t n) {if(n >= power10[10]) {if (n >= power10[19]) return 20;if (n >= power10[18]) return 19;if (n >= power10[17]) return 18;if (n >= power10[16]) return 17;if (n >= power10[15]) return 16;if (n >= power10[14]) return 15;if (n >= power10[13]) return 14;if (n >= power10[12]) return 13;if (n >= power10[11]) return 12;return 11;}else {if (n >= power10[9]) return 10;if (n >= power10[8]) return 9;if (n >= power10[7]) return 8;if (n >= power10[6]) return 7;if (n >= power10[5]) return 6;if (n >= power10[4]) return 5;if (n >= power10[3]) return 4;if (n >= power10[2]) return 3;if (n >= power10[1]) return 2;return 1;}}public:Printer() { pre_calc(); }~Printer() { flush(); }void print(char c){outbuf[pos++] = c;if (__builtin_expect(pos == buf_size, 0)) flush();}void print(const char *s) {while(*s != 0) {outbuf[pos++] = *s++;// if (pos == buf_size) flush();if (__builtin_expect(pos == buf_size, 0)) flush();}}void print(const std::string& s) {for(auto c : s){outbuf[pos++] = c;// if (pos == buf_size) flush();if (__builtin_expect(pos == buf_size, 0)) flush();}}template <class T>typename std::enable_if<std::is_integral<T>::value, void>::type print(T x) {if (__builtin_expect(pos + integer_size >= buf_size, 0)) flush();if (x < 0) print('-'), x = -x;size_t digit = get_integer_size(x);size_t len = digit;while (len >= 4) {len -= 4;memcpy(outbuf + pos + len, block_str + (x % block_size) * 4, 4);x /= block_size;}memcpy(outbuf + pos, block_str + x * 4 + (4 - len), len);pos += digit;}template <class Head, class... Others>void print(const Head& head, const Others&... others){print(head); print(' '); print(others...);}template <class... Args>void println(const Args&... args) {print(args...); print('\n');}template <class T>Printer& operator << (const T& x) {print(x); return *this;}};};#ifndef _SORAIEfastio::Scanner fin;fastio::Printer fout;#define cin fin#define cout fout#endif#if __has_include("atcoder/all")#include <atcoder/all>using namespace atcoder;template<int m,class OS>OS& operator<<(OS& os,const static_modint<m>& self){os << self.val();return os;}#endif// #include <boost/multiprecision/cpp_dec_float.hpp>// using lld = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<20>>;// #include <boost/multiprecision/cpp_int.hpp>// using lll = boost::multiprecision::cpp_int;//--------------------------------------------------------------------int main(){using mint = modint1000000007;int N,S,K;cin >> N >> S >> K;int M = S - K * (N * (N - 1) / 2);if(M < 0){cout << "0\n";return 0;}vector<vector<mint>> memo(M + 1,vector<mint>(N + 1));rep(i,M + 1)memo[i][0] = 0;rep(i,N + 1)memo[0][i] = 1;rep(i,1,M + 1){rep(j,1,N + 1){memo[i][j] = (i - j >= 0 ? memo[i - j][j] : 0) + memo[i][j - 1];}}cout << memo[M][N] << "\n";}