結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー n_vipn_vip
提出日時 2021-01-22 21:56:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 9,381 bytes
コンパイル時間 2,327 ms
コンパイル使用メモリ 159,508 KB
実行使用メモリ 48,016 KB
最終ジャッジ日時 2023-08-27 18:49:32
合計ジャッジ時間 12,107 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
16,076 KB
testcase_01 AC 52 ms
16,196 KB
testcase_02 AC 54 ms
16,324 KB
testcase_03 AC 55 ms
16,032 KB
testcase_04 AC 53 ms
16,024 KB
testcase_05 AC 54 ms
15,964 KB
testcase_06 AC 55 ms
15,968 KB
testcase_07 AC 52 ms
16,040 KB
testcase_08 AC 62 ms
18,224 KB
testcase_09 AC 55 ms
16,516 KB
testcase_10 AC 62 ms
17,364 KB
testcase_11 AC 60 ms
17,732 KB
testcase_12 AC 59 ms
17,244 KB
testcase_13 AC 186 ms
33,520 KB
testcase_14 AC 193 ms
29,616 KB
testcase_15 AC 215 ms
32,856 KB
testcase_16 AC 154 ms
26,888 KB
testcase_17 AC 127 ms
29,340 KB
testcase_18 AC 285 ms
39,744 KB
testcase_19 AC 287 ms
39,760 KB
testcase_20 AC 283 ms
39,812 KB
testcase_21 AC 289 ms
40,172 KB
testcase_22 AC 292 ms
40,004 KB
testcase_23 WA -
testcase_24 AC 79 ms
18,012 KB
testcase_25 AC 133 ms
24,100 KB
testcase_26 WA -
testcase_27 AC 131 ms
22,312 KB
testcase_28 AC 108 ms
22,192 KB
testcase_29 AC 125 ms
21,548 KB
testcase_30 AC 112 ms
22,264 KB
testcase_31 WA -
testcase_32 AC 108 ms
20,360 KB
testcase_33 AC 165 ms
25,792 KB
testcase_34 AC 170 ms
27,900 KB
testcase_35 AC 215 ms
33,232 KB
testcase_36 AC 198 ms
31,328 KB
testcase_37 AC 110 ms
20,440 KB
testcase_38 AC 134 ms
22,756 KB
testcase_39 AC 133 ms
22,652 KB
testcase_40 AC 131 ms
22,832 KB
testcase_41 AC 131 ms
22,624 KB
testcase_42 AC 131 ms
22,764 KB
testcase_43 AC 137 ms
48,016 KB
testcase_44 AC 111 ms
34,300 KB
testcase_45 AC 117 ms
36,820 KB
testcase_46 AC 76 ms
29,056 KB
testcase_47 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return move(re);}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}
vv<int> readG(const int &n){ return readG(n,n-1);}
#define TT cauto TTT=read();rep(_,TTT)
const ll MOD=1e9+7; //998244353;
using Graph=vv<int>;
bool topodfs(const Graph &g,int v,vector<int> &order,vector<int> &usd){
  usd[v]=1;
  for(const int &e:g[v]){
    if(usd[e]==2) continue;
    if(usd[e]==1) return 0;
    if(!topodfs(g,e,order,usd)) return 0;
  }
  order.pb(v); usd[v]=2;
  return 1;
}
// bool topodfs(const Graph &g,int v,vector<int> &order,vector<int> &usd){
//   usd[v]=1;
//   for(const Edge &e:g[v]){
//     if(usd[e.dst]==2) continue;
//     if(usd[e.dst]==1) return 0;
//     if(!topodfs(g,e.dst,order,usd)) return 0;
//   }
//   order.pb(v); usd[v]=2;
//   return 1;
// }
bool topoSort(const Graph &g,vector<int> &order){
  int n=g.size();
  vector<int> usd(n);
  rep(i,n)if(!usd[i])
    if(!topodfs(g,i,order,usd))return 0;
  reverse(all(order));
  return 1;
}

ll modpow_(ll r,ll n,ll m=MOD){
  ll re=1,d=r%m;
  if(n<0)(n%=m-1)+=m-1;
  for(;n;n/=2){
    if(n&1)(re*=d)%=m;
    (d*=d)%=m;
  }
  return re;
}
template <int mod=MOD> struct ModInt{
  int v;
  ModInt(int v=0):v(v){}
  ModInt operator+(const ModInt &n)const{return v+n.v<mod ? v+n.v : v+n.v-mod;}
  ModInt operator-(const ModInt &n)const{return v-n.v<0 ? v-n.v+mod : v-n.v;}
  ModInt operator*(const ModInt &n)const{return ll(v)*n.v%mod;}
  ModInt operator/(const ModInt &n)const{return ll(v)*modpow_(n.v%mod,-1,mod)%mod;}
  ModInt operator+(const ll &n)const{return v+n<mod ? v+n : v+n-mod;}
  ModInt operator-(const ll &n)const{return v-n<0 ? v-n+mod : v-n;}
  ModInt operator*(const ll &n)const{return ll(v)*(n%mod)%mod;}
  ModInt operator/(const ll &n)const{return ll(v)*modpow_(n%mod,-1,mod)%mod;}
  ModInt& operator+=(const ModInt &n){v+=n.v; if(v>=mod) v-=mod; return *this;}
  ModInt& operator-=(const ModInt &n){v-=n.v; if(v<0) v+=mod; return *this;}
  ModInt& operator*=(const ModInt &n){v=ll(v)*n.v%mod; return *this;}
  ModInt& operator/=(const ModInt &n){v=ll(v)*modpow_(n.v,-1,mod)%mod; return *this;}
  ModInt& operator+=(const ll &n){v+=n; if(v>=mod) v-=mod; return *this;}
  ModInt& operator-=(const ll &n){v-=n; if(v<0) v+=mod; return *this;}
  ModInt& operator*=(const ll &n){v=ll(v)*n%mod; return *this;}
  ModInt& operator/=(const ll &n){v=ll(v)*modpow_(n,-1,mod)%mod; return *this;}
	bool operator==(const ModInt &n)const{return v==n.v;};
	bool operator!=(const ModInt &n)const{return v!=n.v;};
	ModInt& operator++(){ return operator+=(1); }
	ModInt& operator--(){ return operator-=(1); }
	ModInt operator++(int i){ ModInt tmp(*this); operator++(); return tmp; }
	ModInt operator--(int i){ ModInt tmp(*this); operator--(); return tmp; }
};
#ifdef NUIP
class MINT_FRAC____{
public:
	unordered_map<int,pii> dict;
	MINT_FRAC____(int n){
		rep(p,n+1)reps(q,1,n+1)if(__gcd(p,q)==1){
			dict[1ll*p*modpow_(q,-1)%MOD]=pii(p,q);
			dict[MOD-1ll*p*modpow_(q,-1)%MOD]=pii(-p,q);
		}
	}
} Il1Il1Il1(1000);
template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){if(Il1Il1Il1.dict.count(n.v)) os<<n.v<<"("<<Il1Il1Il1.dict[n.v].X<<"/"<<Il1Il1Il1.dict[n.v].Y<<")";else os<<n.v;return os;};
#else
template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){return os<<n.v;};
#endif
template<int mod> ModInt<mod> operator+(const ll &n,const ModInt<mod> &m){return m.v+n<mod ? m.v+n : m.v+n-mod;}
template<int mod> ModInt<mod> operator-(const ll &n,const ModInt<mod> &m){return n-m.v<0 ? n-m.v+mod : n-m.v;}
template<int mod> ModInt<mod> operator*(const ll &n,const ModInt<mod> &m){return ll(m.v)*(n%mod)%mod;}
template<int mod> ModInt<mod> operator/(const ll &n,const ModInt<mod> &m){return ModInt<mod>(n%mod)/m;}
typedef ModInt<MOD> mint;
template <int mod> ModInt<mod> modpow(ModInt<mod> r,ll n){ ModInt<mod> re(1); if(n<0)(n%=mod-1)+=mod-1; for(;n;n/=2){if(n&1) re*=r; r*=r;} return re;}
vector<mint> fact,finv,inv;
mint comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]*finv[r];}
class Doralion{
  void Modinvs(vector<mint> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i);}
  void Facts(vector<mint> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1);}
  void Factinvs(vector<mint> &re,const vector<mint> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1];}
public:
  Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n);}
} doralion(1123456);
using pmm=pair<mint,mint>;
mint modpow(ll r,ll n){ return modpow_(r,n);}

typedef vv<int> Graph;
struct Scc{
  stack<int> S;
  vector<int> inS,low,num;
  int time=0;
public:
  Graph dag;
  vector<int> inv;
  vv<int> scc;
  void visit(const Graph &g, int v){
    low[v] = num[v] = ++time;
    S.push(v); inS[v]=1;
    for(const int  &w:g[v]){
      if(!num[w]){
				visit(g,w);
				low[v]=min(low[v],low[w]);
      }else if(inS[w]) low[v]=min(low[v],num[w]);
    }
    if(low[v]==num[v]){
      scc.eb();
      while(1){
				int w = S.top(); S.pop(); inS[w]=0;
				scc.back().pb(w);
				if(v==w) break;
      }
    }
  }
  Scc(const Graph &g) {
    const int n = g.size();
    num.resize(n); low.resize(n); inS.resize(n);
    rep(u,n)if(!num[u]) visit(g,u);
    reverse(all(scc));
    
    inv.resize(n); dag.resize(scc.size());
    rep(i,scc.size())for(auto v:scc[i]) inv[v]=i;
    rep(i,scc.size())for(auto v:scc[i])for(auto e:g[v])
			if(inv[e]!=i)	dag[i].pb(inv[e]);
  }
};

vector<mint> solve(const vector<tuple<int,int,int,int>> &es,const vector<int> &ord,int s,int n){
	vv<pii> g(n);
	for(cauto &[a,b,ignore,c]:es) g[a].eb(b,c);
	vector<mint> re(n);
	rep(i,n) re[s]=1;
	for(cauto &v:ord)for(cauto [u,w]:g[v]) re[u]+=re[v]*w;
	return re;
}

int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout<<fixed<<setprecision(0);
	cauto n=read(-1);
	cauto m=read(0);
	vector<tuple<int,int,int,int>> es(m);
	for(auto &[a,b,c,d]:es) cin>>a>>b>>c>>d;
	vector<int> ord;
	Scc h({});
	{
		vv<int> g(n);
		for(cauto &[a,b,ig,nore]:es) g[a].eb(b);
		h=Scc(g);
	}
	rep(i,h.scc.size()) ord.eb(h.scc[i][0]);
	cauto L=solve(es,ord,0,n);
	for(auto &e:es) swap(get<0>(e),get<1>(e));
	reverse(all(ord));
	cauto R=solve(es,ord,n-1,n);
	out(ord,L,R,1);
	cauto no=[](){ cout<<"INF" NL; exit(0);};
	{
		cauto &g=h.dag;
		cauto n=(int)g.size();
		vector<int> dp0(n); dp0[h.inv[0]]=1;
		rep(v,n)for(cauto w:g[v]) dp0[w]|=dp0[v];
		vector<int> dp1(n); dp1[h.inv[n-1]]=1;
		rrep(v,n)for(cauto w:g[v]) dp1[v]|=dp1[w];
		rep(v,n)if(dp0[v]&&dp1[v]&&h.scc[v].size()>1) no();
	}
	mint re=0;
	for(cauto &[a,b,c,d]:es) re+=L[b]*R[a]*c*d;
	cout<<re NL;
  return 0;
}
0