結果

問題 No.1111 コード進行
ユーザー Ogtsn99Ogtsn99
提出日時 2020-07-10 21:56:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 388 ms / 2,000 ms
コード長 6,709 bytes
コンパイル時間 2,300 ms
コンパイル使用メモリ 213,560 KB
実行使用メモリ 240,512 KB
最終ジャッジ日時 2024-10-11 09:05:55
合計ジャッジ時間 16,653 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 227 ms
240,384 KB
testcase_01 AC 228 ms
240,512 KB
testcase_02 AC 227 ms
240,384 KB
testcase_03 AC 227 ms
240,384 KB
testcase_04 AC 229 ms
240,512 KB
testcase_05 AC 229 ms
240,512 KB
testcase_06 AC 252 ms
240,512 KB
testcase_07 AC 252 ms
240,512 KB
testcase_08 AC 256 ms
240,512 KB
testcase_09 AC 259 ms
240,384 KB
testcase_10 AC 238 ms
240,384 KB
testcase_11 AC 246 ms
240,512 KB
testcase_12 AC 268 ms
240,512 KB
testcase_13 AC 240 ms
240,512 KB
testcase_14 AC 270 ms
240,384 KB
testcase_15 AC 234 ms
240,384 KB
testcase_16 AC 269 ms
240,384 KB
testcase_17 AC 232 ms
240,512 KB
testcase_18 AC 233 ms
240,512 KB
testcase_19 AC 230 ms
240,384 KB
testcase_20 AC 235 ms
240,384 KB
testcase_21 AC 234 ms
240,384 KB
testcase_22 AC 234 ms
240,512 KB
testcase_23 AC 241 ms
240,512 KB
testcase_24 AC 235 ms
240,512 KB
testcase_25 AC 268 ms
240,384 KB
testcase_26 AC 289 ms
240,512 KB
testcase_27 AC 273 ms
240,384 KB
testcase_28 AC 229 ms
240,512 KB
testcase_29 AC 233 ms
240,512 KB
testcase_30 AC 266 ms
240,384 KB
testcase_31 AC 233 ms
240,512 KB
testcase_32 AC 274 ms
240,384 KB
testcase_33 AC 384 ms
240,384 KB
testcase_34 AC 228 ms
240,384 KB
testcase_35 AC 229 ms
240,512 KB
testcase_36 AC 282 ms
240,384 KB
testcase_37 AC 273 ms
240,512 KB
testcase_38 AC 288 ms
240,512 KB
testcase_39 AC 388 ms
240,384 KB
testcase_40 AC 294 ms
240,512 KB
testcase_41 AC 234 ms
240,512 KB
testcase_42 AC 270 ms
240,512 KB
testcase_43 AC 334 ms
240,384 KB
testcase_44 AC 246 ms
240,512 KB
testcase_45 AC 244 ms
240,384 KB
testcase_46 AC 246 ms
240,384 KB
testcase_47 AC 294 ms
240,512 KB
testcase_48 AC 258 ms
240,512 KB
testcase_49 AC 254 ms
240,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key) 
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI=3.14159265358979323846;
template <typename T> 
int getIndexOfLowerBound(vector <T> &v, T x){
    return lower_bound(v.begin(),v.end(),x)-v.begin();
}
template <typename T> 
int getIndexOfUpperBound(vector <T> &v, T x){
    return upper_bound(v.begin(),v.end(),x)-v.begin();
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
    Real a, b; is >> a >> b; p = Point(a, b); return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &p_var) {
    is >> p_var.first >> p_var.second;
    return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    DUMPOUT<<'{';
    os << pair_var.first;
    DUMPOUT<<',';
    os << " "<< pair_var.second;
    DUMPOUT<<'}';
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    DUMPOUT<<'[';
    for (int i = 0; i < vec.size(); i++) 
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    DUMPOUT<<']';
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
  for (auto& vec : df) os<<vec;
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    DUMPOUT << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) DUMPOUT << ", ";
        itr--;
    }
    DUMPOUT << "}";
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    DUMPOUT << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) DUMPOUT << ", ";
        itr--;
    }
    DUMPOUT << "}";
    return os;
}
void print() {cout << endl;}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(tail) != 0) cout << " ";
  print(forward<Tail>(tail)...);
}
void dump_func() {DUMPOUT << '#'<<endl;}
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
using mint = Fp<1000000007>;
vector<vector<vector<mint>>> dp (310, vector<vector<mint>>(310, vector<mint>(310)));
// i, now, complex
int n, m, K; 
WeightedGraph g;


signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
    cin>>n>>m>>K;
    //vector <int> p(m), q(m), c(m);
    g.resize(320);
    rep(i, m){
        //cin>>p[i] >> q[i] >> c[i];
        int u, v, complex; cin>>u>>v>>complex;
        u--, v--;
        g[u].pb({v, complex});
    }
    for(int i=0;i<300;i++) dp[0][i][0] = 1;
    for(int i=0;i<=300;i++){
        for(int j=0;j<=300;j++){
            for(int k=0;k<=300;k++){
                for(auto e: g[j]){
                    if(e.S + k <= K) dp[i+1][e.F][e.S + k] += dp[i][j][k];
                }
            }
        }
    }
    mint ans = 0;
    for(int i=0;i<=300;i++){
        ans += dp[n-1][i][K];
    }
    print(ans);
}
0