結果

問題 No.1111 コード進行
ユーザー rniyarniya
提出日時 2020-07-11 11:43:30
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 380 ms / 2,000 ms
コード長 5,783 bytes
コンパイル時間 1,719 ms
コンパイル使用メモリ 172,032 KB
実行使用メモリ 229,324 KB
最終ジャッジ日時 2023-08-02 22:42:34
合計ジャッジ時間 8,007 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
7,184 KB
testcase_01 AC 5 ms
6,388 KB
testcase_02 AC 4 ms
5,644 KB
testcase_03 AC 4 ms
5,652 KB
testcase_04 AC 4 ms
5,636 KB
testcase_05 AC 7 ms
6,360 KB
testcase_06 AC 11 ms
10,092 KB
testcase_07 AC 14 ms
13,864 KB
testcase_08 AC 11 ms
13,112 KB
testcase_09 AC 8 ms
7,212 KB
testcase_10 AC 19 ms
17,720 KB
testcase_11 AC 10 ms
11,776 KB
testcase_12 AC 11 ms
10,344 KB
testcase_13 AC 9 ms
9,364 KB
testcase_14 AC 16 ms
13,124 KB
testcase_15 AC 13 ms
16,104 KB
testcase_16 AC 12 ms
10,864 KB
testcase_17 AC 18 ms
17,692 KB
testcase_18 AC 11 ms
13,116 KB
testcase_19 AC 4 ms
5,640 KB
testcase_20 AC 7 ms
7,164 KB
testcase_21 AC 13 ms
14,616 KB
testcase_22 AC 20 ms
16,844 KB
testcase_23 AC 11 ms
12,364 KB
testcase_24 AC 11 ms
11,092 KB
testcase_25 AC 21 ms
17,728 KB
testcase_26 AC 16 ms
15,448 KB
testcase_27 AC 5 ms
6,432 KB
testcase_28 AC 182 ms
138,544 KB
testcase_29 AC 146 ms
132,724 KB
testcase_30 AC 127 ms
92,036 KB
testcase_31 AC 27 ms
22,124 KB
testcase_32 AC 199 ms
173,036 KB
testcase_33 AC 86 ms
59,672 KB
testcase_34 AC 147 ms
116,964 KB
testcase_35 AC 241 ms
202,324 KB
testcase_36 AC 226 ms
139,976 KB
testcase_37 AC 140 ms
129,436 KB
testcase_38 AC 103 ms
93,384 KB
testcase_39 AC 134 ms
87,448 KB
testcase_40 AC 201 ms
147,544 KB
testcase_41 AC 213 ms
162,536 KB
testcase_42 AC 164 ms
138,520 KB
testcase_43 AC 116 ms
89,872 KB
testcase_44 AC 91 ms
80,748 KB
testcase_45 AC 168 ms
136,248 KB
testcase_46 AC 228 ms
229,092 KB
testcase_47 AC 380 ms
229,324 KB
testcase_48 AC 224 ms
229,112 KB
testcase_49 AC 214 ms
229,152 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1e9+7;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    cout << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

template<uint_fast64_t Modulus> class modint{
    using u64=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) noexcept{
        a+=rhs.a;
        if (a>=Modulus) a-=Modulus;
        return *this;
    }
    constexpr modint operator+(const modint &rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint &operator++() noexcept{
        return ++a,*this;
    }
    constexpr modint operator++(int) noexcept{
        modint t=*this; return ++a,t;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{
        if (a<rhs.a) a+=Modulus;
        a-=rhs.a;
        return *this;
    }
    constexpr modint operator-(const modint &rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint &operator--() noexcept{
        return --a,*this;
    }
    constexpr modint operator--(int) noexcept{
        modint t=*this; return --a,t;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        a=a*rhs.a%Modulus;
        return *this;
    }
    constexpr modint operator*(const modint &rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        u64 exp=Modulus-2;
        while(exp){
            if (exp&1) *this*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return *this;
    }
    constexpr modint operator/(const modint &rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint operator-() const noexcept{
        return modint(Modulus-a);
    }
    constexpr bool operator==(const modint &rhs) const noexcept{
        return a==rhs.a;
    }
    constexpr bool operator!=(const modint &rhs) const noexcept{
        return a!=rhs.a;
    }
    constexpr bool operator!() const noexcept{return !a;}
    friend constexpr modint pow(modint rhs,long long exp) noexcept{
        modint res{1};
        while(exp){
            if (exp&1) res*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept{
        return modint(x)+y;
    }
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept{
        return modint(x)-y;
    }
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept{
        return modint(x)*y;
    }
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept{
        return modint(x)/y;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept{
        return s << rhs.a;
    }
    friend istream &operator>>(istream &s,modint &rhs) noexcept{
        u64 a; rhs=modint{(s >> a,a)}; return s;
    }
};

using mint=modint<MOD>;

const int MAX_N=310;

mint dp[MAX_N][MAX_N][MAX_N];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M,K; cin >> N >> M >> K;
    vector<vector<pair<int,int>>> G(MAX_N);
    for (int i=0;i<M;++i){
        int P,Q,K; cin >> P >> Q >> K;
        G[--P].emplace_back(--Q,K);
    }
    for (int i=0;i<MAX_N-1;++i){
        G[MAX_N-1].emplace_back(i,0);
    }
    dp[0][MAX_N-1][0]=1;
    for (int i=0;i<=N;++i){
        for (int j=0;j<MAX_N;++j){
            for (int k=0;k<=K;++k){
                for (auto e:G[j]){
                    if (k+e.second<=K){
                        dp[i+1][e.first][k+e.second]+=dp[i][j][k];
                    }
                }
            }
        }
    }
    mint ans=0;
    for (int j=0;j<MAX_N;++j) ans+=dp[N][j][K];
    cout << ans << '\n';
}
0