結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー first_vilfirst_vil
提出日時 2021-01-22 22:23:02
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 242 ms / 2,500 ms
コード長 7,324 bytes
コンパイル時間 2,721 ms
コンパイル使用メモリ 224,488 KB
実行使用メモリ 24,092 KB
最終ジャッジ日時 2023-08-28 11:02:37
合計ジャッジ時間 9,444 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 8 ms
4,380 KB
testcase_09 AC 4 ms
4,380 KB
testcase_10 AC 8 ms
4,376 KB
testcase_11 AC 7 ms
4,376 KB
testcase_12 AC 8 ms
4,380 KB
testcase_13 AC 129 ms
13,896 KB
testcase_14 AC 165 ms
13,896 KB
testcase_15 AC 174 ms
15,004 KB
testcase_16 AC 111 ms
11,344 KB
testcase_17 AC 60 ms
10,708 KB
testcase_18 AC 220 ms
18,512 KB
testcase_19 AC 236 ms
18,292 KB
testcase_20 AC 242 ms
18,420 KB
testcase_21 AC 238 ms
18,364 KB
testcase_22 AC 233 ms
18,296 KB
testcase_23 AC 38 ms
7,940 KB
testcase_24 AC 27 ms
5,400 KB
testcase_25 AC 102 ms
12,188 KB
testcase_26 AC 175 ms
15,836 KB
testcase_27 AC 101 ms
11,324 KB
testcase_28 AC 72 ms
9,944 KB
testcase_29 AC 89 ms
10,468 KB
testcase_30 AC 71 ms
10,128 KB
testcase_31 AC 50 ms
8,676 KB
testcase_32 AC 65 ms
9,148 KB
testcase_33 AC 154 ms
14,288 KB
testcase_34 AC 161 ms
15,400 KB
testcase_35 AC 191 ms
16,660 KB
testcase_36 AC 168 ms
15,916 KB
testcase_37 AC 62 ms
8,256 KB
testcase_38 AC 86 ms
9,564 KB
testcase_39 AC 87 ms
9,384 KB
testcase_40 AC 87 ms
9,336 KB
testcase_41 AC 85 ms
9,416 KB
testcase_42 AC 86 ms
9,488 KB
testcase_43 AC 65 ms
24,020 KB
testcase_44 AC 46 ms
14,040 KB
testcase_45 AC 60 ms
24,092 KB
testcase_46 AC 10 ms
9,672 KB
testcase_47 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#define debug(x) print(x)
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }
template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }

template<int modulo> struct ModInt {
    int x;

    ModInt() : x(0) {}
    ModInt(ll y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}

    ModInt& operator+=(const ModInt& p) {
        if ((x += p.x) >= modulo) x -= modulo;
        return *this;
    }
    ModInt& operator-=(const ModInt& p) {
        if ((x += modulo - p.x) >= modulo) x -= modulo;
        return *this;
    }
    ModInt& operator*=(const ModInt& p) {
        x = (int)(1LL * x * p.x % modulo);
        return *this;
    }
    ModInt& operator/=(const ModInt& p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt& p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt& p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt& p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt& p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt& p) const { return x == p.x; }
    bool operator!=(const ModInt& p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = modulo, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }

    ModInt pow(ll e) {
        ll a = 1, p = x;
        while (e > 0) {
            if (e % 2 == 0) {
                p = (p * p) % modulo;
                e /= 2;
            }
            else {
                a = (a * p) % modulo;
                e--;
            }
        }
        return ModInt(a);
    }

    friend ostream& operator<<(ostream& os, const ModInt<modulo>& p) {
        return os << p.x;
    }
    friend istream& operator>>(istream& is, ModInt<modulo>& a) {
        ll x;
        is >> x;
        a = ModInt<modulo>(x);
        return (is);
    }
};
using modint = ModInt<mod>;
int main() {
    init();

    int n, m; cin >> n >> m;
    vector<vector<tuple<int, int, int>>> g(n + 1), r(n + 1);
    FOR(i, 0, m) {
        int u, v, l, a; cin >> u >> v >> l >> a;
        g[u].emplace_back(v, l, a);
        r[v].emplace_back(u, l, a);
    }

    vector<bool> used(n + 1);
    stack<int> st;
    auto dfs1 = [&](auto&& f, int cur)->void {
        used[cur] = true;
        for (auto [to, l, a] : g[cur]) {
            if (used[to])continue;
            f(f, to);
        }
        st.push(cur);
    };
    FOR(i, 0, n + 1)if (!used[i])dfs1(dfs1, i);

    int cnt;
    VI loop(n + 1);
    auto dfs2 = [&](auto&& f, int cur)->bool {
        used[cur] = true;
        ++cnt;
        for (auto [to, l, a] : r[cur]) {
            if (used[to])continue;
            f(f, to);
        }
        if (cnt > 1) {
            loop[cur] = 1;
            return true;
        }
        return false;
    };
    used.assign(n + 1, false);
    while (!st.empty()) {
        cnt = 0;
        dfs2(dfs2, st.top());
        st.pop();
    }
    used.assign(n + 1, false);
    queue<int> bfs;
    bfs.push(0);
    while (!bfs.empty()) {
        int cur = bfs.front();
        bfs.pop();
        for (auto [to, l, a] : g[cur]) {
            if (used[to])continue;
            used[to] = true;
            bfs.push(to);
        }
    }
    FOR(i, 0, n)loop[i] += used[i];
    used.assign(n + 1, false);
    bfs.push(n);
    while (!bfs.empty()) {
        int cur = bfs.front();
        bfs.pop();
        for (auto [to, l, a] : r[cur]) {
            if (used[to])continue;
            used[to] = true;
            bfs.push(to);
        }
    }
    FOR(i, 0, n)loop[i] += used[i];
    VI in(n + 1);
    FOR(cur, 0, n + 1)for (auto [to, l, a] : g[cur])++in[to];
    vector<modint> dp1(n + 1);
    dp1[0] = 1;
    FOR(i, 0, n + 1)if (in[i] == 0) {
        bfs.push(i);
    }
    while (!bfs.empty()) {
        int cur = bfs.front();
        bfs.pop();
        for (auto [to, l, a] : g[cur]) {
            dp1[to] += dp1[cur] * a;
            if (--in[to] == 0)bfs.push(to);
        }
    }
    in.assign(n + 1, 0);
    FOR(cur, 0, n + 1)for (auto [to, l, a] : r[cur])++in[to];
    vector<modint> dp2(n + 1);
    dp2[n] = 1;
    FOR(i, 0, n + 1)if (in[i] == 0) {
        bfs.push(i);
    }
    while (!bfs.empty()) {
        int cur = bfs.front();
        bfs.pop();
        for (auto [to, l, a] : r[cur]) {
            dp2[to] += dp2[cur] * a;
            if (--in[to] == 0)bfs.push(to);
        }
    }
    if (*max_element(all(loop)) >= 3)END("INF");
    modint ans = 0;
    FOR(i, 0, n + 1)for (auto [to, l, a] : g[i])ans += dp1[i] * dp2[to] * l * a;
    print(ans);

    return 0;
}
0