結果

問題 No.1111 コード進行
ユーザー hedwig100hedwig100
提出日時 2020-07-10 22:03:50
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 112 ms / 2,000 ms
コード長 3,456 bytes
コンパイル時間 1,509 ms
コンパイル使用メモリ 172,396 KB
実行使用メモリ 236,404 KB
最終ジャッジ日時 2023-08-01 17:59:24
合計ジャッジ時間 7,298 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 101 ms
236,108 KB
testcase_01 AC 107 ms
236,404 KB
testcase_02 AC 91 ms
236,148 KB
testcase_03 AC 92 ms
236,072 KB
testcase_04 AC 92 ms
236,080 KB
testcase_05 AC 92 ms
236,352 KB
testcase_06 AC 92 ms
236,096 KB
testcase_07 AC 92 ms
236,120 KB
testcase_08 AC 92 ms
236,176 KB
testcase_09 AC 92 ms
236,104 KB
testcase_10 AC 92 ms
236,080 KB
testcase_11 AC 93 ms
236,292 KB
testcase_12 AC 92 ms
236,104 KB
testcase_13 AC 92 ms
236,108 KB
testcase_14 AC 112 ms
236,100 KB
testcase_15 AC 82 ms
236,088 KB
testcase_16 AC 78 ms
236,100 KB
testcase_17 AC 76 ms
236,080 KB
testcase_18 AC 73 ms
236,084 KB
testcase_19 AC 86 ms
236,088 KB
testcase_20 AC 64 ms
236,164 KB
testcase_21 AC 63 ms
236,084 KB
testcase_22 AC 63 ms
236,164 KB
testcase_23 AC 62 ms
236,096 KB
testcase_24 AC 62 ms
236,088 KB
testcase_25 AC 64 ms
236,096 KB
testcase_26 AC 63 ms
236,096 KB
testcase_27 AC 63 ms
236,164 KB
testcase_28 AC 63 ms
236,152 KB
testcase_29 AC 64 ms
236,160 KB
testcase_30 AC 66 ms
236,228 KB
testcase_31 AC 61 ms
236,100 KB
testcase_32 AC 69 ms
236,096 KB
testcase_33 AC 69 ms
236,292 KB
testcase_34 AC 61 ms
236,288 KB
testcase_35 AC 63 ms
236,220 KB
testcase_36 AC 84 ms
236,172 KB
testcase_37 AC 73 ms
236,100 KB
testcase_38 AC 68 ms
236,160 KB
testcase_39 AC 76 ms
236,160 KB
testcase_40 AC 79 ms
236,372 KB
testcase_41 AC 64 ms
236,104 KB
testcase_42 AC 75 ms
236,108 KB
testcase_43 AC 72 ms
236,104 KB
testcase_44 AC 64 ms
236,100 KB
testcase_45 AC 67 ms
236,104 KB
testcase_46 AC 62 ms
236,164 KB
testcase_47 AC 103 ms
236,168 KB
testcase_48 AC 65 ms
236,180 KB
testcase_49 AC 64 ms
236,124 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;
const int tyou[7] = {0,2,4,5,7,9,11};


template<int Modulus> 
struct ModInt {
    long long x;
    ModInt(long long x = 0) :x((x%Modulus + Modulus)%Modulus) {}
    constexpr ModInt &operator+=(const ModInt a) {if ((x += a.x) >= Modulus) x -= Modulus; return *this;}
    constexpr ModInt &operator-=(const ModInt a) {if ((x += Modulus - a.x) >= Modulus) x -= Modulus; return *this;}
    constexpr ModInt &operator*=(const ModInt a) {(x *= a.x) %= Modulus; return *this;}
    constexpr ModInt &operator/=(const ModInt a) {return *this *= a.inverse();}

    constexpr ModInt operator+(const ModInt a) const {return ModInt(*this) += a.x;}
    constexpr ModInt operator-(const ModInt a) const {return ModInt(*this) -= a.x;}
    constexpr ModInt operator*(const ModInt a) const {return ModInt(*this) *= a.x;}
    constexpr ModInt operator/(const ModInt a) const {return ModInt(*this) /= a.x;}
    
    friend constexpr ostream& operator<<(ostream& os,const ModInt<Modulus>& a) {return os << a.x;}
    friend constexpr istream& operator>>(istream& is,ModInt<Modulus>& a) {return is >> a.x;}
    
    ModInt inverse() const {// x ^ (-1) 
        long long a = x,b = Modulus,p = 1,q = 0;
        while (b) {long long d = a/b; a -= d*b; swap(a,b); p -= d*q; swap(p,q);}
        return ModInt(p);
    }
    ModInt pow(long long N) {// x ^ N 
        ModInt a = 1;
        while (N) {
            if (N&1) a *= *this;
            *this *= *this;
            N >>= 1;
        }
        return a;
    }
};

using mint = ModInt<1000000007>;
//using mint = ModInt<998244353>;
struct Combination {
    int N;
    //using mint = ModInt<1000000007>;
    //using mint = ModInt<998244353>;
    vector<mint> fact,ifact,invs;
    Combination(int N): N(N),fact(N + 1),ifact(N + 1) {
        fact[0] = fact[1] = 1;
        ifact[0] = ifact[1] = 1;
        for (int i = 2;i < N + 1;++i) {fact[i] = fact[i - 1] * i;}
        ifact[N] = fact[N].inverse();
        for (int i = N;i >= 1;--i) {ifact[i - 1] = ifact[i] * i;}
    }
    void invs_build() {
        invs.resize(N + 1);
        invs[1] = 1;
        for (int i = 2;i < N + 1;++i) invs[i] = fact[i] * ifact[i - 1];
    }
    mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n - k];
    }
    mint npk(int n,int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[n - k];
    }
};

mint dp[310][310][310];

int main() {
    int N,M,K; cin >> N >> M >> K;
    vector<vector<P>> code(310);
    rep(i,M) {
        int P,Q,C;
        cin >> P >> Q >> C;
        --P; --Q;
        code[P].emplace_back(Q,C);
    }
    rep(i,300) {
        dp[1][i][0] = 1;
    }
    for (int i = 1;i < N;++i) {
        for (int j = 0;j < 300;++j) {
            for (P &p:code[j]) {
                for (int k = 0;k <= K;++k) {
                    if (k + p.second > K) continue;
                    dp[i + 1][p.first][k + p.second] += dp[i][j][k];
                }
            }
        }
    }
    mint ans = 0;
    rep(i,300) {
        ans += dp[N][i][K];
    }
    cout << ans << '\n';
    return 0;
}
0