結果
問題 | No.1111 コード進行 |
ユーザー | tokusakurai |
提出日時 | 2020-07-10 21:41:27 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 230 ms / 2,000 ms |
コード長 | 3,788 bytes |
コンパイル時間 | 2,368 ms |
コンパイル使用メモリ | 203,596 KB |
実行使用メモリ | 214,980 KB |
最終ジャッジ日時 | 2023-08-01 17:12:55 |
合計ジャッジ時間 | 6,546 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 3 ms
5,404 KB |
testcase_06 | AC | 5 ms
7,604 KB |
testcase_07 | AC | 5 ms
6,948 KB |
testcase_08 | AC | 3 ms
4,588 KB |
testcase_09 | AC | 4 ms
5,792 KB |
testcase_10 | AC | 6 ms
9,512 KB |
testcase_11 | AC | 3 ms
4,584 KB |
testcase_12 | AC | 5 ms
7,504 KB |
testcase_13 | AC | 3 ms
6,332 KB |
testcase_14 | AC | 7 ms
9,744 KB |
testcase_15 | AC | 3 ms
4,380 KB |
testcase_16 | AC | 6 ms
8,208 KB |
testcase_17 | AC | 5 ms
9,724 KB |
testcase_18 | AC | 2 ms
4,596 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 3 ms
5,220 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 6 ms
11,664 KB |
testcase_23 | AC | 4 ms
6,296 KB |
testcase_24 | AC | 4 ms
7,116 KB |
testcase_25 | AC | 8 ms
11,120 KB |
testcase_26 | AC | 5 ms
7,464 KB |
testcase_27 | AC | 2 ms
4,488 KB |
testcase_28 | AC | 68 ms
108,588 KB |
testcase_29 | AC | 29 ms
46,240 KB |
testcase_30 | AC | 60 ms
73,020 KB |
testcase_31 | AC | 7 ms
14,992 KB |
testcase_32 | AC | 52 ms
65,040 KB |
testcase_33 | AC | 48 ms
43,620 KB |
testcase_34 | AC | 41 ms
78,572 KB |
testcase_35 | AC | 73 ms
99,876 KB |
testcase_36 | AC | 121 ms
107,464 KB |
testcase_37 | AC | 25 ms
28,076 KB |
testcase_38 | AC | 21 ms
21,528 KB |
testcase_39 | AC | 81 ms
71,724 KB |
testcase_40 | AC | 108 ms
98,248 KB |
testcase_41 | AC | 101 ms
120,008 KB |
testcase_42 | AC | 44 ms
49,924 KB |
testcase_43 | AC | 45 ms
44,032 KB |
testcase_44 | AC | 16 ms
24,996 KB |
testcase_45 | AC | 58 ms
73,476 KB |
testcase_46 | AC | 2 ms
4,380 KB |
testcase_47 | AC | 230 ms
214,980 KB |
testcase_48 | AC | 2 ms
4,380 KB |
testcase_49 | AC | 3 ms
4,384 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define elif else if #define sp(x) fixed << setprecision(x) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() using ll = long long; using ld = long double; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const ll MOD = 1e9+7; //const ll MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; const ld EPS = 1e-10; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; template<ll mod> struct Mod_Int{ ll x; Mod_Int() {} Mod_Int(ll y) : x (y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} Mod_Int &operator += (const Mod_Int &p){ x = (x + p.x) % mod; return *this; } Mod_Int &operator -= (const Mod_Int &p){ x = (x + mod - p.x) % mod; return *this; } Mod_Int &operator *= (const Mod_Int &p){ x = (x * p.x) % mod; return *this; } Mod_Int &operator /= (const Mod_Int &p){ *this *= p.inverse(); return *this; } Mod_Int &operator ++ () {return *this += Mod_Int(1);} Mod_Int operator ++ (int){ Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int &operator -- () {return *this -= Mod_Int(1);} Mod_Int operator -- (int){ Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator - () const {return Mod_Int(-x);} Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;} Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;} Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;} Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;} bool operator == (const Mod_Int &p) const {return x == p.x;} bool operator != (const Mod_Int &p) const {return x != p.x;} Mod_Int pow(ll n) const{ Mod_Int now = *this, ret = 1; while(n > 0){ if(n & 1) ret *= now; now *= now, n >>= 1; } return ret; } Mod_Int inverse() const{ return pow(mod-2); } friend ostream &operator << (ostream &os, const Mod_Int &p){ return os << p.x; } friend istream &operator >> (istream &is, Mod_Int &p){ ll a; is >> a; p = Mod_Int<mod>(a); return is; } }; using mint = Mod_Int<MOD>; const int MAX_N = 1e6; mint fac[MAX_N+1], ifac[MAX_N+1]; void init(){ fac[0] = 1; rep2(i, 1, MAX_N){ fac[i] = fac[i-1]*i; } ifac[MAX_N] = fac[MAX_N].inverse(); rep3(i, MAX_N, 1){ ifac[i-1] = ifac[i]*i; } } mint comb(int n, int k){ return fac[n]*ifac[n-k]*ifac[k]; } mint perm(int n, int k){ return fac[n]*ifac[n-k]; } struct edge{ int to, cost; }; int main(){ int N, M, K; cin >> N >> M >> K; vector<edge> es[300]; rep(i, M){ int u, v, c; cin >> u >> v >> c; u--, v--; es[u].eb((edge){v, c}); } mint dp[N][K+1][300]; rep(i, N) rep(j, K+1) rep(k, 300) dp[i][j][k] = 0; rep(k, 300) dp[0][0][k] = 1; rep(i, N-1){ rep(j, K+1){ rep(k, 300){ for(auto &e: es[k]){ if(j+e.cost > K) continue; dp[i+1][j+e.cost][e.to] += dp[i][j][k]; } } } } mint ans = 0; rep(k, 300) ans += dp[N-1][K][k]; cout << ans << endl; }