結果

問題 No.269 見栄っ張りの募金活動
ユーザー HaarHaar
提出日時 2019-02-03 02:00:14
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 52 ms / 5,000 ms
コード長 3,430 bytes
コンパイル時間 1,605 ms
コンパイル使用メモリ 166,248 KB
実行使用メモリ 15,904 KB
最終ジャッジ日時 2023-08-20 07:52:42
合計ジャッジ時間 2,735 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 6 ms
14,624 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 7 ms
14,668 KB
testcase_04 AC 23 ms
15,776 KB
testcase_05 AC 5 ms
14,628 KB
testcase_06 AC 6 ms
14,860 KB
testcase_07 AC 52 ms
15,904 KB
testcase_08 AC 6 ms
14,676 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 6 ms
14,764 KB
testcase_11 AC 10 ms
15,640 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 12 ms
15,156 KB
testcase_14 AC 8 ms
15,860 KB
testcase_15 AC 11 ms
15,392 KB
testcase_16 AC 1 ms
4,380 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 19 ms
15,308 KB
testcase_19 AC 10 ms
15,008 KB
testcase_20 AC 7 ms
15,008 KB
testcase_21 AC 8 ms
15,764 KB
testcase_22 AC 8 ms
14,924 KB
testcase_23 AC 7 ms
14,708 KB
testcase_24 AC 7 ms
15,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define LLI long long int
#define fst first
#define snd second
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
#ifndef M_E
#define M_E 2.71828182845904523536
#endif
#ifdef DEBUG
#include <boost/core/demangle.hpp>
#define dump(x) cerr << "L" << __LINE__ << ": in " << __PRETTY_FUNCTION__ << " \e[32;1m" << boost::core::demangle(typeid(x).name()) << "\e[37m" << " " << (#x) << " = " << (x) << "\e[m" << endl;
#else
#define dump(x)
#endif
#define pln(x) cout << (x) << endl
#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m*n/gcd(m,n);}

template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T,U>;
template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename Iter> ostream& out_container(ostream &os, Iter first, Iter last){
  os << "{"; auto itr = first; while(itr != last){if(itr != first) os << ","; os << *itr; ++itr;} os << "}"; return os;
}

template <typename T> ostream& operator<<(ostream &os, const vector<T> &c){return out_container(os,ALL(c));}
template <typename T> ostream& operator<<(ostream &os, const deque<T> &c){return out_container(os,ALL(c));}
template <typename T> ostream& operator<<(ostream &os, const set<T> &c){return out_container(os,ALL(c));}
template <typename T> ostream& operator<<(ostream &os, const unordered_set<T> &c){return out_container(os,ALL(c));}
template <typename T, typename U> ostream& operator<<(ostream &os, const map<T,U> &c){return out_container(os,ALL(c));}
template <typename T, typename U> ostream& operator<<(ostream &os, const unordered_map<T,U> &c){return out_container(os,ALL(c));}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T,U> &p){os << "(" << p.first << "," << p.second << ")"; return os;}

template <typename T> T& chmin(T &a, const T &b){return a = min(a,b);}
template <typename T> T& chmax(T &a, const T &b){return a = max(a,b);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

const LLI mod = 1e9+7;

int dp[21000][110];
bool visit[21000][110];

LLI rec(int n, int k){
  if(n < 0) return 0;
  if(n == 0) return 1;
  if(n != 0 && k == 0) return 0;
  if(visit[n][k]) return dp[n][k];
  visit[n][k] = true;

  (dp[n][k] = rec(n,k-1) + rec(n-k,k)) %= mod;

  return dp[n][k];
}
    
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,S,K;
  while(cin >> N >> S >> K){
    S -= K*(N-1)*N/2;

    if(S < 0){
      cout << 0 << endl;
      continue;
    }

    fill_array(dp, 0);
    fill_array(visit, false);

    LLI ans = rec(S, N);
    cout << ans << endl;
  }
  
  return 0;
}
0