結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー suta28407928suta28407928
提出日時 2021-01-22 23:11:28
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,361 bytes
コンパイル時間 2,688 ms
コンパイル使用メモリ 203,588 KB
実行使用メモリ 23,552 KB
最終ジャッジ日時 2024-06-08 17:50:08
合計ジャッジ時間 11,470 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 65 ms
8,320 KB
testcase_24 AC 68 ms
6,912 KB
testcase_25 AC 161 ms
13,440 KB
testcase_26 AC 251 ms
18,688 KB
testcase_27 AC 206 ms
16,000 KB
testcase_28 AC 121 ms
10,752 KB
testcase_29 AC 201 ms
15,488 KB
testcase_30 AC 120 ms
10,880 KB
testcase_31 AC 79 ms
9,344 KB
testcase_32 AC 151 ms
14,208 KB
testcase_33 AC 249 ms
17,792 KB
testcase_34 AC 216 ms
16,640 KB
testcase_35 AC 194 ms
12,712 KB
testcase_36 AC 189 ms
12,160 KB
testcase_37 AC 152 ms
12,160 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 98 ms
15,744 KB
testcase_44 AC 77 ms
12,160 KB
testcase_45 AC 93 ms
15,360 KB
testcase_46 AC 5 ms
7,936 KB
testcase_47 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
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) - 1;
const ll linf = 1LL<<61;
const int MAX = 510000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int 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){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    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";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

template <int mod> struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        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 = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

using mint = ModInt<mod>;

struct edge{
    ll to,l,a;
};

int main(){
    int n,m; cin >> n >> m;
    vector<vector<edge>> G(n+1), rG(n+1);
    rep(i,m){
        ll u,v,l,a; cin >> u >> v >> l >> a;
        rG[v].push_back({u,l,a});
    }
    vb visit(n+1,false);
    visit[n] = true;
    queue<int> q;
    q.push(n);
    while(!q.empty()){
        int u = q.front(); q.pop();
        for(auto v : rG[u]){
            if(visit[v.to]) continue;
            visit[v.to] = true;
            q.push(v.to);
        }
    }
    if(!visit[0]){
        cout << 0 << "\n";
        return 0;
    }
    vl indeg(n+1,0);
    rep(i,n+1){
        if(visit[i]){
            for(auto e : rG[i]){
                G[e.to].push_back({i,e.l,e.a});
                indeg[i]++;
            }
        }
    }
    vector<mint> num(n+1,0);
    rep(i,n) if(visit[i] && indeg[i] == 0){
        num[i] = 1;
        q.push(i);
    }
    mint ans = 0;
    while(!q.empty()){
        int u = q.front(); q.pop();
        for(auto v : G[u]){
            num[v.to] += num[u];
            indeg[v.to]--;
            if(indeg[v.to] == 0){
                q.push(v.to);
            }
        }
    }
    if(accumulate(all(indeg),0LL)){
        cout << "INF\n";
        return 0;
    }
    rG.clear();
    rG.resize(n+1);
    rep(i,n+1){
        for(auto v : G[i]){
            rG[v.to].push_back({i,v.l,v.a});
            indeg[i]++;
        }
    }
    vector<mint> num2(n+1,0);
    rep(i,n+1){
        if(visit[i] && indeg[i] == 0){
            num2[i] = 1;
            q.push(i);
        } 
    }
    while(!q.empty()){
        int u = q.front(); q.pop();
        for(auto v : rG[u]){
            num2[v.to] += num2[u] * v.a;
            indeg[v.to]--;
            if(indeg[v.to] == 0){
                q.push(v.to);
            }
        }
    }
    if(accumulate(all(indeg),0LL)) cout << "INF\n";
    else{
        rep(i,n){
            for(auto v : G[i]){
                ans += num[i] * num2[v.to] * v.a * v.l;
            }
        }
    }
    cout << ans << "\n";
}
0