結果

問題 No.1111 コード進行
ユーザー raoZraoZ
提出日時 2020-07-10 22:02:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 6,738 bytes
コンパイル時間 1,676 ms
コンパイル使用メモリ 143,512 KB
実行使用メモリ 112,896 KB
最終ジャッジ日時 2024-10-11 09:14:14
合計ジャッジ時間 4,274 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 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 6 ms
5,888 KB
testcase_07 AC 5 ms
5,632 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 4 ms
5,248 KB
testcase_10 AC 6 ms
6,912 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 8 ms
7,168 KB
testcase_15 AC 3 ms
5,248 KB
testcase_16 AC 7 ms
6,272 KB
testcase_17 AC 6 ms
6,912 KB
testcase_18 AC 3 ms
5,248 KB
testcase_19 AC 3 ms
5,248 KB
testcase_20 AC 3 ms
5,248 KB
testcase_21 AC 2 ms
5,248 KB
testcase_22 AC 8 ms
8,064 KB
testcase_23 AC 4 ms
5,248 KB
testcase_24 AC 4 ms
5,504 KB
testcase_25 AC 9 ms
7,808 KB
testcase_26 AC 6 ms
5,760 KB
testcase_27 AC 3 ms
5,248 KB
testcase_28 AC 66 ms
58,752 KB
testcase_29 AC 33 ms
27,136 KB
testcase_30 AC 59 ms
39,808 KB
testcase_31 AC 9 ms
9,600 KB
testcase_32 AC 75 ms
36,864 KB
testcase_33 AC 63 ms
24,832 KB
testcase_34 AC 49 ms
42,752 KB
testcase_35 AC 65 ms
55,040 KB
testcase_36 AC 97 ms
57,728 KB
testcase_37 AC 30 ms
18,048 KB
testcase_38 AC 31 ms
13,696 KB
testcase_39 AC 106 ms
39,424 KB
testcase_40 AC 98 ms
53,504 KB
testcase_41 AC 77 ms
64,640 KB
testcase_42 AC 49 ms
29,184 KB
testcase_43 AC 58 ms
25,216 KB
testcase_44 AC 20 ms
15,232 KB
testcase_45 AC 54 ms
40,448 KB
testcase_46 AC 10 ms
8,320 KB
testcase_47 AC 199 ms
112,896 KB
testcase_48 AC 9 ms
8,320 KB
testcase_49 AC 10 ms
8,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
#include<array>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int,int>;
using piii = pair<pii,int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
// #define _GLIBCXX_DEBUG
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>inline bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>inline bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void in(void){return;}
template <typename First, typename... Rest> void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}
inline void out(void){cout << "\n";return;}
template <typename First, typename... Rest> void out(First first, Rest... rest){cout << first << " ";out(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
}
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
    os << p.first << " " << p.second;
    return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}
template<class T> vector<T> make_vec(size_t a) {return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts){
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class S, class T> pair<S,T> operator*(const pair<S,T> &s, const S& t){return pair<S,T>(s.first*t, s.second*t);}
template <typename T> void Exit(T first){cout << first << endl;exit(0); };
template< int mod > struct ModInt {
    unsigned 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; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1,0), pii(0, 1), pii(-1, 0), pii(0, -1)};

//----------------------- edit from here ---------------------------------
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;}
   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 > >;
template< typename T > using Matrix = vector< vector< T > >;
void add_edge(UnWeightedGraph& g, int x, int y){
    g[x].push_back(y);
    g[y].push_back(x);
}
template< typename T > 
void add_edge(WeightedGraph< T >& g, int x, int y, T c){
    g[x].push_back({y, c});
    g[y].push_back({x, c});
}
void add_edge_bi(UnWeightedGraph& g, int x, int y){
    g[x].push_back(y);
}
template< typename T > 
void add_edge_bi(WeightedGraph< T >& g, int x, int y, T c){
    g[x].push_back({y, c});
}


using P = tuple<int,int,int>;
int main(){
    iosetup();
    int n, m, k; cin >> n >> m >> k;
    WeightedGraph<int> g(301);
    rep(i, 0, m){
        int p, q, c; cin >> p >> q >> c;p--, q--;
        add_edge_bi(g, p, q, c);
    }
    auto dp = make_vec<modint>(n + 1, 300, k + 1);
    // queue<P> que;
    rep(i, 0, 300) dp[0][i][0] = 1;
    rep(i, 0, n){
        rep(j, 0, 300){
            rep(l, 0, k + 1){
                // cerr << i << " " << j << " " << l << endl;
                for(auto& nv: g[j]){
                    auto to = nv.to;
                    auto cost = nv.cost;
                    if(l+cost<=k)dp[i+1][to][l+cost] += dp[i][j][l];
                }
            }
        }
    }
    modint ans = 0;
    rep(i, 0, 300) ans += dp[n-1][i][k];
    // rep(j, 0, n + 1){
    //     cerr << j << endl;
    //     rep(i, 0, 3) cerr << dp[j][i] << endl;
    // }
    cout << ans << endl;


    return 0;
}
0