結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー fastmathfastmath
提出日時 2021-01-22 23:39:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,905 bytes
コンパイル時間 2,510 ms
コンパイル使用メモリ 207,684 KB
実行使用メモリ 41,600 KB
最終ジャッジ日時 2023-08-28 12:09:39
合計ジャッジ時間 10,452 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
12,520 KB
testcase_01 AC 6 ms
12,600 KB
testcase_02 AC 7 ms
12,540 KB
testcase_03 AC 7 ms
12,504 KB
testcase_04 AC 7 ms
12,556 KB
testcase_05 AC 6 ms
12,552 KB
testcase_06 AC 7 ms
12,688 KB
testcase_07 AC 6 ms
12,508 KB
testcase_08 AC 13 ms
13,612 KB
testcase_09 AC 10 ms
13,088 KB
testcase_10 AC 14 ms
13,788 KB
testcase_11 AC 13 ms
13,628 KB
testcase_12 AC 14 ms
13,696 KB
testcase_13 AC 143 ms
25,812 KB
testcase_14 AC 208 ms
30,856 KB
testcase_15 AC 205 ms
29,936 KB
testcase_16 AC 135 ms
25,548 KB
testcase_17 AC 59 ms
19,700 KB
testcase_18 AC 241 ms
32,124 KB
testcase_19 AC 237 ms
32,144 KB
testcase_20 AC 243 ms
32,208 KB
testcase_21 AC 243 ms
32,204 KB
testcase_22 AC 244 ms
32,192 KB
testcase_23 AC 48 ms
17,600 KB
testcase_24 AC 40 ms
17,308 KB
testcase_25 AC 143 ms
24,844 KB
testcase_26 AC 229 ms
31,072 KB
testcase_27 AC 154 ms
27,668 KB
testcase_28 AC 96 ms
21,568 KB
testcase_29 AC 139 ms
27,280 KB
testcase_30 AC 96 ms
21,784 KB
testcase_31 AC 65 ms
18,940 KB
testcase_32 AC 103 ms
25,436 KB
testcase_33 AC 209 ms
30,164 KB
testcase_34 AC 220 ms
28,996 KB
testcase_35 AC 208 ms
27,804 KB
testcase_36 AC 195 ms
27,412 KB
testcase_37 AC 94 ms
23,928 KB
testcase_38 AC 155 ms
27,688 KB
testcase_39 AC 151 ms
27,924 KB
testcase_40 AC 151 ms
27,620 KB
testcase_41 AC 148 ms
27,692 KB
testcase_42 AC 156 ms
27,824 KB
testcase_43 AC 100 ms
41,600 KB
testcase_44 AC 57 ms
23,848 KB
testcase_45 AC 82 ms
30,664 KB
testcase_46 AC 7 ms
12,600 KB
testcase_47 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}

//need define int long long
namespace Stuff {
const int MOD = 1e9+7;
int mod(int n) {
    n %= MOD;
    if (n < 0) return n + MOD;
    else return n;
}   
int fp(int a, int p) {
    int ans = 1, c = a;
    for (int i = 0; (1ll << i) <= p; ++i) {
        if ((p >> i) & 1) ans = mod(ans * c);
        c = mod(c * c);
    }   
    return ans;
}   
int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); }
};
struct M {
ll x;
M (int x_) { x = Stuff::mod(x_); }   
M () { x = 0; }
M operator + (M y) {
    int ans = x + y.x;
    if (ans >= Stuff::MOD)
        ans -= Stuff::MOD;
    return M(ans);
}
M operator - (M y) {
    int ans = x - y.x;
    if (ans < 0)
        ans += Stuff::MOD;
    return M(ans);            
}   
M operator * (M y) { return M(x * y.x % Stuff::MOD); }   
M operator / (M y) { return M(x * Stuff::fp(y.x, Stuff::MOD - 2) % Stuff::MOD); }   
M operator + (int y) { return (*this) + M(y); }
M operator - (int y) { return (*this) - M(y); }   
M operator * (int y) { return (*this) * M(y); }   
M operator / (int y) { return (*this) / M(y); }   
M operator ^ (int p) { return M(Stuff::fp(x, p)); }   
void operator += (M y) { *this = *this + y; }   
void operator -= (M y) { *this = *this - y; }   
void operator *= (M y) { *this = *this * y; }
void operator /= (M y) { *this = *this / y; }   
void operator += (int y) { *this = *this + y; }   
void operator -= (int y) { *this = *this - y; }   
void operator *= (int y) { *this = *this * y; }
void operator /= (int y) { *this = *this / y; }   
void operator ^= (int p) { *this = *this ^ p; }
bool operator == (M y) { return x == y.x; }
};  
std::ostream& operator << (std::ostream& o, const M& a)
{
    cout << a.x;
    return o;
}

const int N = 1e5+7;
V <vi> g[N];
vi gr[N], rg[N];
bool del[N];

bool used[N];
void dfs(int u, vi g[N]) {
    used[u] = 1;
    for (int v : g[u])
        if (!used[v])   
            dfs(v, g);
}    

vi top;
int pos[N];
void jfs(int u) {
    used[u] = 1;
    for (auto v : gr[u]) {
        if (!used[v]) {
            jfs(v);
        }   
    }   
    top.app(u);
}   

int n;
M cnt[N], sum[N];
void calc(int u) {
    used[u] = 1;

    if (u == n) {
        sum[u] = 0;
        cnt[u] = 1;

    /*
    debug(u);
    debug(cnt[u]);
    debug(sum[u]);
    */

        return;
    }   

    for (auto e : g[u]) {
        int v = e[0];
        int l = e[1];
        int a = e[2];
        if (!used[v]) {
            calc(v);
        }   
        cnt[u] += cnt[v] * a;
        sum[u] += sum[v] * a + cnt[v] * a * l;
    }   
    /*
    debug(u);
    debug(cnt[u]);
    debug(sum[u]);
    */
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int m;
    cin >> n >> m;
    FOR (i, m) {
        int u, v, l, a;
        cin >> u >> v >> l >> a;
        g[u].app({v, l, a});
        gr[u].app(v);
        rg[v].app(u);
    }   
    dfs(0, gr);
    FOR (i, n + 1) {
        if (!used[i])
            del[i] = 1;
    }   
    memset(used, 0, sizeof used);
    dfs(n, rg);
    FOR (i, n + 1) {
        if (!used[i])
            del[i] = 1;
    }   
    if (del[0] || del[n]) {
        cout << 0 << endl;
        exit(0);
    }   
    memset(used, 0, sizeof used);
    jfs(0);
    reverse(all(top));
    FOR (i, (int)top.size())
        pos[top[i]] = i;

    FOR (u, n + 1)
        trav(v, gr[u])
            if (pos[u] > pos[v]) {
                cout << "INF" << endl;
                exit(0);
            }   

    memset(used, 0, sizeof used);
    calc(0);
    cout << sum[0] << endl;
}
0