結果

問題 No.1111 コード進行
ユーザー masayoshi361masayoshi361
提出日時 2020-07-10 21:47:17
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 209 ms / 2,000 ms
コード長 5,944 bytes
コンパイル時間 2,593 ms
コンパイル使用メモリ 189,120 KB
実行使用メモリ 113,024 KB
最終ジャッジ日時 2024-10-11 08:45:10
合計ジャッジ時間 5,113 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 4 ms
5,248 KB
testcase_06 AC 5 ms
5,888 KB
testcase_07 AC 6 ms
5,504 KB
testcase_08 AC 4 ms
5,248 KB
testcase_09 AC 5 ms
5,248 KB
testcase_10 AC 6 ms
6,784 KB
testcase_11 AC 3 ms
5,248 KB
testcase_12 AC 6 ms
6,016 KB
testcase_13 AC 4 ms
5,248 KB
testcase_14 AC 9 ms
7,168 KB
testcase_15 AC 3 ms
5,248 KB
testcase_16 AC 6 ms
6,272 KB
testcase_17 AC 6 ms
7,040 KB
testcase_18 AC 3 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 AC 4 ms
5,248 KB
testcase_21 AC 3 ms
5,248 KB
testcase_22 AC 7 ms
8,064 KB
testcase_23 AC 4 ms
5,248 KB
testcase_24 AC 5 ms
5,504 KB
testcase_25 AC 10 ms
7,808 KB
testcase_26 AC 7 ms
5,760 KB
testcase_27 AC 4 ms
5,248 KB
testcase_28 AC 66 ms
58,752 KB
testcase_29 AC 34 ms
27,008 KB
testcase_30 AC 59 ms
39,808 KB
testcase_31 AC 9 ms
9,600 KB
testcase_32 AC 75 ms
36,736 KB
testcase_33 AC 64 ms
24,704 KB
testcase_34 AC 47 ms
42,752 KB
testcase_35 AC 64 ms
54,912 KB
testcase_36 AC 99 ms
57,728 KB
testcase_37 AC 33 ms
17,792 KB
testcase_38 AC 31 ms
13,568 KB
testcase_39 AC 102 ms
39,424 KB
testcase_40 AC 103 ms
53,376 KB
testcase_41 AC 78 ms
64,512 KB
testcase_42 AC 51 ms
29,056 KB
testcase_43 AC 59 ms
25,344 KB
testcase_44 AC 21 ms
15,232 KB
testcase_45 AC 56 ms
40,192 KB
testcase_46 AC 10 ms
8,448 KB
testcase_47 AC 209 ms
113,024 KB
testcase_48 AC 10 ms
8,320 KB
testcase_49 AC 10 ms
8,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region header */
#ifdef LOCAL
    #include "/Users/takakurashokichi/Desktop/atcoder/cxx-prettyprint-master/prettyprint.hpp"
    #define debug(x) cout << x << endl
#else
    #define debug(...) 42
#endif

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//types
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
typedef pair < ll , ll > Pl;        
typedef pair < int, int > Pi;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vc;
template< typename T >
using mat = vector< vector< T > >;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef vector<vector<char>> vvc;

template< int mod >
struct modint {
    int x;

    modint() : x(0) {}

    modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    modint &operator+=(const modint &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator-=(const modint &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator*=(const modint &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    modint &operator/=(const modint &p) {
        *this *= p.inverse();
        return *this;
    }

    modint operator-() const { return modint(-x); }

    modint operator+(const modint &p) const { return modint(*this) += p; }

    modint operator-(const modint &p) const { return modint(*this) -= p; }

    modint operator*(const modint &p) const { return modint(*this) *= p; }

    modint operator/(const modint &p) const { return modint(*this) /= p; }

    bool operator==(const modint &p) const { return x == p.x; }

    bool operator!=(const modint &p) const { return x != p.x; }

    modint inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
        t = a / b;
        swap(a -= t * b, b);
        swap(u -= t * v, v);
        }
        return modint(u);
    }

    modint pow(int64_t n) const {
        modint ret(1), mul(x);
        while(n > 0) {
        if(n & 1) ret *= mul;
        mul *= mul;
        n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const modint &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, modint &a) {
        int64_t t;
        is >> t;
        a = modint< mod >(t);
        return (is);
    }

    static int get_mod() { return mod; }
};
//abreviations
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), max_i = (b); i < max_i; i++)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define rrep_(i, a_, b_, a, b, ...) for (int i = (b-1), min_i = (a); i >= min_i; i--)
#define rrep(i, ...) rrep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define SZ(x) ((int)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define mp make_pair
#define print(x) cout << x << endl
#define vprint(x) rep(i, x.size())cout << x[i] << ' '; cout << endl
#define vsum(x) accumulate(all(x), 0LL)
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
//functions
//gcd(0, x) fails.
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return a/gcd(a, b)*b;}
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< typename T >
T mypow(T x, ll n) {
    T ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
    }
    return ret;
}
ll modpow(ll x, ll n, const ll mod) {
    ll ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
        x%=mod;
        ret%=mod;
    }
    return ret;
}
template< typename T >
uint64_t my_rand(void) {
    static uint64_t x = 88172645463325252ULL;
    x = x ^ (x << 13); x = x ^ (x >> 7);
    return x = x ^ (x << 17);
}
int popcnt(ull x) { return __builtin_popcountll(x); } 
//graph template
template< typename T >
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}

    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    bool operator<(const edge<T> &r) const { return cost < r.cost; }
    
    operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
struct Timer { 
    clock_t start_time; 
    void start() {
        start_time = clock(); 
    }
    int lap() { 
        //return x ms.
        return (clock()-start_time)*1000 / CLOCKS_PER_SEC; 
    }
};
/* #endregion*/
//constant
#define inf 1000000005
#define INF 4000000004000000000LL
#define mod 1000000007LL
#define endl '\n'
typedef modint<mod> mint;
const long double eps = 0.000001;
const long double PI  = 3.141592653589793;
//library
const int mx = 300;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << setprecision(20);
    int n, m, k; cin>>n>>m>>k;
    vl p(m), q(m), c(m);
    mat<edge<int>> g(mx);
    rep(i, m){
        cin>>p[i]>>q[i]>>c[i];
        p[i]--;q[i]--;
        g[p[i]].emplace_back(q[i], c[i]);
    }
    vector<mat<mint>> dp(n+1, mat<mint>(mx, vector<mint>(k+1)));
    rep(i, mx)dp[0][i][0] = 1;
    rep(i, n){
        rep(j, mx){
            rep(l, k+1){
                for(auto e:g[j]){
                    if(l+e.cost>k)continue;
                    dp[i+1][e.to][l+e.cost] += dp[i][j][l];
                }
            }
        }
    }
    mint ans = 0;
    rep(i, mx)ans+=dp[n-1][i][k];
    print(ans);
}
0