結果

問題 No.1111 コード進行
コンテスト
ユーザー suta28407928
提出日時 2020-07-10 21:52:52
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,610 bytes
コンパイル時間 2,032 ms
コンパイル使用メモリ 91,000 KB
最終ジャッジ日時 2025-01-19 02:34:47
合計ジャッジ時間 3,111 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:64:16: error: ‘std::uint_fast64_t’ has not been declared
   64 | template <std::uint_fast64_t Modulus> class modint {
      |                ^~~~~~~~~~~~~
main.cpp:65:20: error: ‘uint_fast64_t’ in namespace ‘std’ does not name a type
   65 |   using u64 = std::uint_fast64_t;
      |                    ^~~~~~~~~~~~~
main.cpp:18:1: note: ‘std::uint_fast64_t’ is defined in header ‘<cstdint>’; did you forget to ‘#include <cstdint>’?
   17 | #include <complex>
  +++ |+#include <cstdint>
   18 | using namespace std;
main.cpp:68:3: error: ‘u64’ does not name a type
   68 |   u64 a;
      |   ^~~
main.cpp:70:26: error: ‘u64’ does not name a type
   70 |   constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
      |                          ^~~
main.cpp:71:13: error: ‘u64’ does not name a type
   71 |   constexpr u64 &value() noexcept { return a; }
      |             ^~~
main.cpp:72:19: error: ‘u64’ does not name a type
   72 |   constexpr const u64 &value() const noexcept { return a; }
      |                   ^~~
main.cpp:118:1: error: ‘mint’ does not name a type; did you mean ‘uint’?
  118 | mint dp[2][305][305];
      | ^~~~
      | uint
main.cpp: In function ‘int main()’:
main.cpp:126:9: error: ‘dp’ was not declared in this scope; did you mean ‘p’?
  126 |         dp[0][q][c] += 1;
      |         ^~
      |         p
main.cpp:129:31: error: ‘dp’ was not declared in this scope; did you mean ‘dy’?
  129 |         rep(j,300) rep(k,K+1) dp[1][j][k] = 0;
      |                               ^~
      |                               dy
main.cpp:134:21: error: ‘dp’ was not declared in this scope; did you mean ‘dy’?
  134 |                     dp[1][l.first][k+l.second] += dp[0][j][k];
      |                     ^~
      |                     dy
main.cpp:138:14: error: ‘dp’ was not declared in this scope; did you mean ‘dy’?
  138 |         swap(dp[1],dp[0]);
      |

ソースコード

diff # 

#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";
}
0