結果

問題 No.1111 コード進行
ユーザー 👑 はまやんはまやんはまやんはまやん
提出日時 2020-07-11 10:02:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 244 ms / 2,000 ms
コード長 3,579 bytes
コンパイル時間 2,379 ms
コンパイル使用メモリ 202,392 KB
実行使用メモリ 220,932 KB
最終ジャッジ日時 2023-08-02 19:53:06
合計ジャッジ時間 10,747 ms
ジャッジサーバーID
(参考情報)
judge13 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 113 ms
220,700 KB
testcase_01 AC 116 ms
220,640 KB
testcase_02 AC 114 ms
220,700 KB
testcase_03 AC 125 ms
220,764 KB
testcase_04 AC 114 ms
220,764 KB
testcase_05 AC 115 ms
220,756 KB
testcase_06 AC 117 ms
220,708 KB
testcase_07 AC 115 ms
220,708 KB
testcase_08 AC 115 ms
220,720 KB
testcase_09 AC 115 ms
220,768 KB
testcase_10 AC 117 ms
220,704 KB
testcase_11 AC 114 ms
220,708 KB
testcase_12 AC 115 ms
220,932 KB
testcase_13 AC 113 ms
220,700 KB
testcase_14 AC 117 ms
220,668 KB
testcase_15 AC 112 ms
220,704 KB
testcase_16 AC 116 ms
220,704 KB
testcase_17 AC 117 ms
220,904 KB
testcase_18 AC 113 ms
220,760 KB
testcase_19 AC 116 ms
220,648 KB
testcase_20 AC 113 ms
220,908 KB
testcase_21 AC 112 ms
220,652 KB
testcase_22 AC 119 ms
220,820 KB
testcase_23 AC 115 ms
220,644 KB
testcase_24 AC 115 ms
220,660 KB
testcase_25 AC 121 ms
220,752 KB
testcase_26 AC 117 ms
220,752 KB
testcase_27 AC 113 ms
220,720 KB
testcase_28 AC 156 ms
220,636 KB
testcase_29 AC 135 ms
220,900 KB
testcase_30 AC 158 ms
220,660 KB
testcase_31 AC 119 ms
220,652 KB
testcase_32 AC 165 ms
220,792 KB
testcase_33 AC 152 ms
220,652 KB
testcase_34 AC 148 ms
220,644 KB
testcase_35 AC 154 ms
220,644 KB
testcase_36 AC 179 ms
220,916 KB
testcase_37 AC 127 ms
220,744 KB
testcase_38 AC 127 ms
220,664 KB
testcase_39 AC 169 ms
220,772 KB
testcase_40 AC 182 ms
220,728 KB
testcase_41 AC 164 ms
220,640 KB
testcase_42 AC 147 ms
220,652 KB
testcase_43 AC 144 ms
220,640 KB
testcase_44 AC 122 ms
220,652 KB
testcase_45 AC 148 ms
220,652 KB
testcase_46 AC 114 ms
220,908 KB
testcase_47 AC 244 ms
220,644 KB
testcase_48 AC 111 ms
220,856 KB
testcase_49 AC 116 ms
220,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % 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 inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan0
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/














int N, M, K;
vector<pair<int, int>> E[303];
mint dp[303][606][303];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> M >> K;

    rep(i, 1, 301) E[0].push_back({ i, 0 });
    rep(i, 0, M) {
        int a, b, c; cin >> a >> b >> c;
        E[a].push_back({ b, c });
    }

    dp[0][0][0] = 1;
    rep(i, 0, N) rep(k, 0, K + 1) rep(lst, 0, 301) {
         fore(p, E[lst]) dp[i + 1][k + p.second][p.first] += dp[i][k][lst];
    }

    mint ans = 0;
    rep(lst, 1, 301) ans += dp[N][K][lst];
    cout << ans << endl;
}





0