#509732 (C++14) No.1111 コード進行

• 問題: No.1111 コード進行
• ユーザー: suta28407928
• 提出日時: 2020-07-10 21:52:52
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 111 ms / 2,000 ms
• コード長: 3,610 bytes
• コンパイル時間: 933 ms
• コンパイル使用メモリ: 105,552 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-15 04:52:39
• 合計ジャッジ時間: 3,067 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 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,248 KB
testcase_07	AC	5 ms; 5,248 KB
testcase_08	AC	5 ms; 5,248 KB
testcase_09	AC	4 ms; 5,248 KB
testcase_10	AC	6 ms; 5,248 KB
testcase_11	AC	4 ms; 5,248 KB
testcase_12	AC	5 ms; 5,248 KB
testcase_13	AC	4 ms; 5,248 KB
testcase_14	AC	6 ms; 5,248 KB
testcase_15	AC	5 ms; 5,248 KB
testcase_16	AC	5 ms; 5,248 KB
testcase_17	AC	6 ms; 5,248 KB
testcase_18	AC	5 ms; 5,248 KB
testcase_19	AC	2 ms; 5,248 KB
testcase_20	AC	4 ms; 5,248 KB
testcase_21	AC	5 ms; 5,248 KB
testcase_22	AC	6 ms; 5,248 KB
testcase_23	AC	5 ms; 5,248 KB
testcase_24	AC	5 ms; 5,248 KB
testcase_25	AC	7 ms; 5,248 KB
testcase_26	AC	6 ms; 5,248 KB
testcase_27	AC	4 ms; 5,248 KB
testcase_28	AC	39 ms; 5,248 KB
testcase_29	AC	27 ms; 5,248 KB
testcase_30	AC	29 ms; 5,248 KB
testcase_31	AC	8 ms; 5,248 KB
testcase_32	AC	42 ms; 5,248 KB
testcase_33	AC	25 ms; 5,248 KB
testcase_34	AC	31 ms; 5,248 KB
testcase_35	AC	46 ms; 5,248 KB
testcase_36	AC	54 ms; 5,248 KB
testcase_37	AC	28 ms; 5,248 KB
testcase_38	AC	21 ms; 5,248 KB
testcase_39	AC	38 ms; 5,248 KB
testcase_40	AC	50 ms; 5,248 KB
testcase_41	AC	46 ms; 5,248 KB
testcase_42	AC	35 ms; 5,248 KB
testcase_43	AC	29 ms; 5,248 KB
testcase_44	AC	19 ms; 5,248 KB
testcase_45	AC	36 ms; 5,248 KB
testcase_46	AC	31 ms; 5,248 KB
testcase_47	AC	111 ms; 5,248 KB
testcase_48	AC	31 ms; 5,248 KB
testcase_49	AC	31 ms; 5,248 KB

ソースコード

#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,-1,0,1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
    if(a>b){
        a = b; return true;
    }
    else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
    if(a<b){
        a = b; return true;
    }
    else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
    cout << a << " " << b << " " << c << "\n";
}
const ll mod = 1e9 + 7;
//const int mod = 998244353;

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

using mint = modint<mod>;

mint dp[2][305][305];
vector<vpl> ls(305);

int main(){
    ll n,m,K; cin >> n >> m >> K;
    rep(i,m){
        ll p,q,c; cin >> p >> q >> c; p--; q--;
        ls[p].emplace_back(q,c);
        dp[0][q][c] += 1;
    }
    rep(i,n-2){
        rep(j,300) rep(k,K+1) dp[1][j][k] = 0;
        rep(j,300){
            rep(k,K+1){
                for(auto l : ls[j]){
                    if(k+l.second > K) continue;
                    dp[1][l.first][k+l.second] += dp[0][j][k];
                }
            }
        }
        swap(dp[1],dp[0]);
    }
    mint ans = 0;
    rep(j,300) ans += dp[0][j][K];
    cout << ans.value() << "\n";
}