結果
問題 | No.1364 [Renaming] Road to Cherry from Zelkova |
ユーザー | kappybar |
提出日時 | 2021-01-23 17:12:28 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,544 bytes |
コンパイル時間 | 2,248 ms |
コンパイル使用メモリ | 194,176 KB |
実行使用メモリ | 37,164 KB |
最終ジャッジ日時 | 2023-08-30 01:45:03 |
合計ジャッジ時間 | 13,293 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 14 ms
4,724 KB |
testcase_09 | AC | 7 ms
4,376 KB |
testcase_10 | AC | 15 ms
4,380 KB |
testcase_11 | AC | 13 ms
4,452 KB |
testcase_12 | AC | 14 ms
4,376 KB |
testcase_13 | AC | 205 ms
18,372 KB |
testcase_14 | AC | 275 ms
17,660 KB |
testcase_15 | AC | 277 ms
19,360 KB |
testcase_16 | AC | 197 ms
14,048 KB |
testcase_17 | AC | 100 ms
13,828 KB |
testcase_18 | AC | 367 ms
24,708 KB |
testcase_19 | AC | 360 ms
24,224 KB |
testcase_20 | AC | 368 ms
24,496 KB |
testcase_21 | AC | 361 ms
24,420 KB |
testcase_22 | AC | 367 ms
24,964 KB |
testcase_23 | AC | 79 ms
9,380 KB |
testcase_24 | AC | 76 ms
5,728 KB |
testcase_25 | AC | 214 ms
13,652 KB |
testcase_26 | AC | 339 ms
18,180 KB |
testcase_27 | AC | 251 ms
13,036 KB |
testcase_28 | AC | 151 ms
10,772 KB |
testcase_29 | AC | 236 ms
12,156 KB |
testcase_30 | AC | 158 ms
11,216 KB |
testcase_31 | AC | 104 ms
9,752 KB |
testcase_32 | AC | 180 ms
10,356 KB |
testcase_33 | AC | 318 ms
16,296 KB |
testcase_34 | AC | 302 ms
17,968 KB |
testcase_35 | WA | - |
testcase_36 | AC | 317 ms
20,000 KB |
testcase_37 | AC | 181 ms
9,392 KB |
testcase_38 | AC | 245 ms
11,628 KB |
testcase_39 | AC | 245 ms
11,344 KB |
testcase_40 | AC | 245 ms
11,936 KB |
testcase_41 | AC | 245 ms
11,588 KB |
testcase_42 | AC | 245 ms
11,660 KB |
testcase_43 | AC | 158 ms
37,164 KB |
testcase_44 | AC | 128 ms
20,776 KB |
testcase_45 | AC | 147 ms
30,060 KB |
testcase_46 | AC | 36 ms
16,140 KB |
testcase_47 | AC | 2 ms
4,380 KB |
ソースコード
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<(int)(n);i++) #define chmin(x,y) x = min((x),(y)); #define chmax(x,y) x = max((x),(y)); using namespace std; using ll = long long ; using P = pair<int,int> ; using pll = pair<long long,long long>; const int INF = 1e9; const long long LINF = 1e17; const int MOD = 1000000007; //const int MOD = 998244353; const double PI = 3.14159265358979323846; #include <atcoder/scc> using namespace atcoder; template<int mod> struct ModInt{ long long x=0; constexpr ModInt(long long x=0):x((x%mod+mod)%mod){} constexpr ModInt operator+(const ModInt& r)const{return ModInt(*this)+=r;} constexpr ModInt operator-(const ModInt& r)const{return ModInt(*this)-=r;} constexpr ModInt operator*(const ModInt& r)const{return ModInt(*this)*=r;} constexpr ModInt operator/(const ModInt& r)const{return ModInt(*this)/=r;} constexpr ModInt& operator+=(const ModInt& r){ if((x+=r.x)>=mod) x-=mod; return *this;} constexpr ModInt& operator-=(const ModInt& r){ if((x-=r.x)<0) x+=mod; return *this;} constexpr ModInt& operator*=(const ModInt& r){ if((x*=r.x)>=mod) x%=mod; return *this;} constexpr ModInt& operator/=(const ModInt& r){ return *this*=r.inv();} ModInt inv() const { long long s=x,sx=1,sy=0,t=mod,tx=0,ty=1; while(s%t!=0){ long long temp=s/t,u=s-t*temp,ux=sx-temp*tx,uy=sy-temp*ty; s=t;sx=tx;sy=ty; t=u;tx=ux;ty=uy; } return ModInt(tx); } ModInt pow(long long n) const { ModInt a=1; ModInt b=*this; while(n>0){ if(n&1) a*=b; b*=b; n>>=1; } return a; } friend constexpr ostream& operator<<(ostream& os,const ModInt<mod>& a) {return os << a.x;} friend constexpr istream& operator>>(istream& is,ModInt<mod>& a) {return is >> a.x;} }; using mint = ModInt<MOD>; struct edge{ ll to,l,a; }; mint dp[100005]; mint cnt[100005]; int main(){ int n,m; cin >> n >> m; vector<vector<edge>> G(n+1); scc_graph graph(n+1); rep(i,m){ ll u,v,l,a; cin >> u >> v >> l >> a; G[u].push_back(edge{v,l,a}); graph.add_edge(u,v); } vector<vector<int>> topo = graph.scc(); map<int,int> real_temp; rep(i,topo.size()){ for(int j:topo[i]){ real_temp[j] = i; } } vector<int> seen(topo.size(),0); vector<bool> dfs_res(topo.size(),false); int n_temp = real_temp[n]; bool cycle = false; auto dfs = [&](auto&& dfs,int i) -> bool{ if(seen[i] == 1) return dfs_res[i]; seen[i] = 1; bool ok = false; if(i == n_temp) ok = true; for(int j:topo[i]){ for(auto e:G[j]){ int to = real_temp[e.to]; if(seen[to] == 1) continue; bool temp = dfs(dfs,to); if(temp) ok = true; } } if(ok && (int)topo[i].size() > 1){ cycle = true; } return dfs_res[i] = ok; }; dfs(dfs,0); if(seen[n_temp] == 0){ cout << 0 << endl; return 0; } if(cycle){ cout << "INF" << endl; return 0; } dp[0] = 0; cnt[0] = 1; int zero_temp = real_temp[0]; for(int ii=zero_temp;ii<topo.size();ii++){ int i = topo[ii][0]; for(auto e:G[i]){ dp[e.to] += dp[i] * e.a + cnt[i] * e.a * e.l; cnt[e.to] += cnt[i] * e.a; } } cout << dp[n] << endl; return 0; }