#186619 (C++17) No.269 見栄っ張りの募金活動

• 問題: No.269 見栄っ張りの募金活動
• ユーザー: mai
• 提出日時: 2017-07-04 21:47:04
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 4,820 ms / 5,000 ms
• コード長: 3,983 bytes
• コンパイル時間: 3,016 ms
• コンパイル使用メモリ: 214,816 KB
• 実行使用メモリ: 18,816 KB
• 最終ジャッジ日時: 2024-07-16 02:00:47
• 合計ジャッジ時間: 19,214 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,812 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	18 ms; 6,940 KB
testcase_04	AC	3,365 ms; 9,088 KB
testcase_05	AC	2 ms; 6,944 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	4,820 ms; 18,816 KB
testcase_08	AC	2 ms; 6,940 KB
testcase_09	AC	20 ms; 6,944 KB
testcase_10	AC	2 ms; 6,944 KB
testcase_11	AC	1,606 ms; 6,940 KB
testcase_12	AC	7 ms; 6,940 KB
testcase_13	AC	686 ms; 6,940 KB
testcase_14	AC	458 ms; 6,944 KB
testcase_15	AC	968 ms; 6,944 KB
testcase_16	AC	24 ms; 6,948 KB
testcase_17	AC	2 ms; 6,944 KB
testcase_18	AC	1,197 ms; 10,496 KB
testcase_19	AC	364 ms; 6,944 KB
testcase_20	AC	220 ms; 6,940 KB
testcase_21	AC	738 ms; 6,944 KB
testcase_22	AC	236 ms; 6,944 KB
testcase_23	AC	8 ms; 6,940 KB
testcase_24	AC	587 ms; 6,944 KB

コンパイルメッセージ

main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:72:9: warning: no return statement in function returning non-void [-Wreturn-type]
   72 |         }
      |         ^

ソースコード

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
namespace {
    std::chrono::system_clock::time_point ttt;
    void tic() { ttt = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - ttt)); }
    std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T>
        void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiablechar(cc); cc = getchar_unlocked());
            for (; isvisiablechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
    };
}
MaiScanner scanner;




ll n, ss, kk;

ll dp[102][20002];


ll dfs(ll index, ll coin) {
    // static unordered_map<ll,ll> memo;
    if (index == n){
        return coin == 0;
    }
    
    // ll key = (index<<32) | coin;
    // if (memo.count(key)) return memo[key];
    
    if (dp[index][coin]) return dp[index][coin] - 1;
    
    ll prev = index == 0 ? -kk : 0;
    
    ll result = 0;
    for (ll vel = prev + kk; coin - vel*(n - index) >= 0; ++vel) {
        result = (result + dfs(index + 1, coin - vel*(n - index))) % MD;
    }
    //return memo[key] = result;
    dp[index][coin] = result + 1;
    return result;
}

// dfs(0,ss,-kk);


int main() {
    cin >> n >> ss >> kk;

    // fill(dp[0], dp[0] + ss + 1, 1);
    // 
    // for (int i = 1; i < n ; ++i) {
    //     for (int coin = 0; coin < ss; ++coin) {
    //         if (dp[i - 1][coin])
    //             for (int vel = kk; coin + vel*(n - i) <= ss; ++vel) {
    //                 dp[i][coin + vel*(n - i)] += dp[i - 1][coin];
    //             }
    //     }
    // }

    // cout << dp[n - 1][ss];

    cout << dfs(0, ss) << endl;

    return 0;
}