結果
問題 | No.1364 [Renaming] Road to Cherry from Zelkova |
ユーザー | ゆにぽけ |
提出日時 | 2024-02-23 06:20:49 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,608 bytes |
コンパイル時間 | 1,464 ms |
コンパイル使用メモリ | 139,520 KB |
実行使用メモリ | 22,784 KB |
最終ジャッジ日時 | 2024-09-29 04:48:50 |
合計ジャッジ時間 | 6,240 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 2 ms
6,816 KB |
testcase_05 | AC | 1 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,820 KB |
testcase_07 | AC | 2 ms
6,820 KB |
testcase_08 | AC | 6 ms
6,816 KB |
testcase_09 | AC | 3 ms
6,820 KB |
testcase_10 | AC | 6 ms
6,816 KB |
testcase_11 | AC | 6 ms
6,816 KB |
testcase_12 | AC | 7 ms
6,816 KB |
testcase_13 | AC | 75 ms
8,832 KB |
testcase_14 | AC | 93 ms
8,704 KB |
testcase_15 | AC | 93 ms
9,344 KB |
testcase_16 | AC | 65 ms
7,424 KB |
testcase_17 | AC | 36 ms
7,168 KB |
testcase_18 | AC | 120 ms
11,044 KB |
testcase_19 | AC | 124 ms
11,136 KB |
testcase_20 | AC | 126 ms
11,136 KB |
testcase_21 | AC | 120 ms
11,136 KB |
testcase_22 | AC | 128 ms
11,008 KB |
testcase_23 | AC | 25 ms
6,820 KB |
testcase_24 | AC | 25 ms
6,820 KB |
testcase_25 | AC | 59 ms
7,040 KB |
testcase_26 | AC | 98 ms
8,448 KB |
testcase_27 | AC | 69 ms
6,912 KB |
testcase_28 | AC | 41 ms
6,816 KB |
testcase_29 | AC | 72 ms
6,912 KB |
testcase_30 | AC | 45 ms
6,816 KB |
testcase_31 | AC | 31 ms
6,820 KB |
testcase_32 | AC | 56 ms
6,820 KB |
testcase_33 | AC | 89 ms
8,064 KB |
testcase_34 | AC | 84 ms
8,704 KB |
testcase_35 | WA | - |
testcase_36 | AC | 83 ms
9,600 KB |
testcase_37 | AC | 58 ms
6,816 KB |
testcase_38 | AC | 75 ms
6,816 KB |
testcase_39 | AC | 76 ms
6,820 KB |
testcase_40 | AC | 78 ms
6,816 KB |
testcase_41 | AC | 79 ms
6,816 KB |
testcase_42 | AC | 76 ms
6,820 KB |
testcase_43 | AC | 51 ms
22,784 KB |
testcase_44 | AC | 35 ms
10,112 KB |
testcase_45 | AC | 48 ms
22,760 KB |
testcase_46 | AC | 5 ms
7,168 KB |
testcase_47 | AC | 2 ms
6,816 KB |
ソースコード
#include <iostream> #include <vector> #include <algorithm> #include <array> #include <iterator> #include <string> #include <cctype> #include <cstring> #include <cstdlib> #include <cassert> #include <cmath> #include <ctime> #include <iomanip> #include <numeric> #include <stack> #include <queue> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <bitset> #include <random> #include <utility> #include <functional> using namespace std; template<int m> struct modint { private: unsigned int value; static constexpr int mod() {return m;} public: constexpr modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= mod()) { y %= mod(); if(y < 0) y += mod(); } value = (unsigned int)y; } static constexpr int get_mod() noexcept {return m;} static constexpr int primitive_root() noexcept { assert(m == 998244353); return 3; } constexpr unsigned int val() noexcept {return value;} constexpr modint &operator+=(const modint &other) noexcept { value += other.value; if(value >= mod()) value -= mod(); return *this; } constexpr modint &operator-=(const modint &other) noexcept { unsigned int x = value; if(x < other.value) x += mod(); x -= other.value; value = x; return *this; } constexpr modint &operator*=(const modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int) (x % mod()); return *this; } constexpr modint &operator/=(const modint &other) noexcept { return *this *= other.inverse(); } constexpr modint inverse() const noexcept { assert(value); long long a = value,b = mod(),x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return modint(x); } constexpr modint power(long long N) const noexcept { assert(N >= 0); modint p = *this,ret = 1; while(N) { if(N & 1) ret *= p; p *= p; N >>= 1; } return ret; } constexpr modint operator+() {return *this;} constexpr modint operator-() {return modint() - *this;} constexpr modint &operator++(int) noexcept {return *this += 1;} constexpr modint &operator--(int) noexcept {return *this -= 1;} friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;} friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;} friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;} friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;} friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;} }; /* using mint = modint<998244353>; */ using mint = modint<1000000007>; void Main() { int N,M; cin >> N >> M; vector<vector<tuple<int,int,int>>> G(N + 1); for(int i = 0;i < M;i++) { int u,v,l,a; cin >> u >> v >> l >> a; G[v].push_back(make_tuple(u,l,a)); } vector<mint> dp(N + 1),way(N + 1); vector<int> seen(N + 1),fin(N + 1); bool inf = false; auto dfs = [&](auto dfs,int u) -> void { seen[u] = 1; if(u == 0) { dp[u] = 0; way[u] = 1; } for(const auto &[v,l,a] : G[u]) { if(seen[v]) { if(fin[v]); else { inf = true; return; } } else { dfs(dfs,v); if(inf) { return; } } dp[u] += (dp[v] + l * way[v]) * a; way[u] += way[v] * a; } fin[u] = 1; return; }; dfs(dfs,N); if(inf) { cout << "INF\n"; } else { cout << dp[N] << "\n"; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; /* cin >> tt; */ while(tt--) Main(); }