結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-01-22 22:58:52
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 250 ms / 2,500 ms
コード長 8,389 bytes
コンパイル時間 4,495 ms
コンパイル使用メモリ 230,376 KB
実行使用メモリ 52,696 KB
最終ジャッジ日時 2024-12-29 09:12:36
合計ジャッジ時間 12,544 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 45
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:308:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  308 |   for(auto [a,b,c,d]:eglis){
      |            ^
main.cpp:318:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  318 |     for(auto [cost,next]:g[x]){
      |              ^
main.cpp:326:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  326 |     for(auto [cost,next]:rg[x]){
      |              ^
main.cpp:333:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  333 |   for(auto [a,b,c,d]:eglis){
      |            ^

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr double eps=1e-9;
const double PI=acos(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
os<<"{";bool f=false;
for(auto& x:v){if(f)os<<",";os<<x;f=true;}
os<<"}";
return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
os<<"{";bool f=false;
for(auto& x:v){if(f)os<<",";os<<x;f=true;}
os<<"}";
return os;
}
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
void startupcpp(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(15);
}
double distance(ddatas x,ddatas y){
double a=x.first-y.first,b=x.second-y.second;
return sqrt(a*a+b*b);
}
ll modinv(ll a,ll m=mod) {
ll b=m,u=1,v=0,t;
while(b){
t=a/b;
a-=t*b; swap(a,b);
u-=t*v; swap(u,v);
}
return (u+m)%m;
}
ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}
vec modncrlistp,modncrlistm;
ll modncr(ll n,ll r){
if(n<r)return 0;
ll i,size=modncrlistp.size();
if(size<=n){
modncrlistp.resize(n+1);
modncrlistm.resize(n+1);
if(!size){
modncrlistp[0]=modncrlistm[0]=1;
size++;
}
For(i,size,n+1){
modncrlistp[i]=modncrlistp[i-1]*i%mod;
modncrlistm[i]=modinv(modncrlistp[i]);
}
}
return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}
ll modpow(ll a,ll n,ll m=mod){
ll res=1;
while(n>0){
if(n&1)res=res*a%m;
a=a*a%m;
n>>=1;
}
return res;
}
ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll countdigits(ll n,ll k=10){
ll ans=0;
while(n){n/=k;ans++;}
return ans;
}
ll sumdigits(ll n,ll k=10){
ll ans=0;
while(n){ans+=n%k;n/=k;}
return ans;
}
struct scc_graph{
public:
scc_graph(int n):_n(n){}
scc_graph(vector<vector<int>> g):_n(g.size()){
for(int i=0;i<_n;++i)for(auto& x:g[i])add_edge(i,x);
scc_ids();
}
scc_graph(vector<vector<long long>> g):_n(g.size()){
for(int i=0;i<_n;++i)for(auto& x:g[i])add_edge(i,x);
scc_ids();
}
void add_edge(int from,int to){
assert(0<=from&&from<_n);
assert(0<=to&&to<_n);
edges.push_back({from,{to}});
}
void add_clause(int i,bool f,int j,bool g){
assert(0<=i&&i*2<_n);
assert(0<=j&&j*2<_n);
add_edge(i<<1|!f,j<<1|g);
add_edge(j<<1|!g,i<<1|f);
}
//n must be *2
vector<bool> solve_twosat(){
if(!group_num)scc_ids();
int m=_n>>1;
vector<bool> answer(m);
for(int i=0;i<m;++i){
if(ids[i<<1]==ids[i<<1|1])return{};
answer[i]=ids[i<<1]<ids[i<<1|1];
}
return answer;
}
vector<vector<int>> scc(){
if(!group_num)scc_ids();
vector<int> counts(group_num);
for(auto& x:ids)counts[x]++;
vector<vector<int>> groups(group_num);
for(int i=0;i<group_num;++i)groups[i].reserve(counts[i]);
for(int i=0;i<_n;++i)groups[ids[i]].push_back(i);
return groups;
}
int size(){return group_num;}
int operator[](int k) const{return ids[k];}
private:
int _n,group_num=0;
struct edge{
int to;
};
struct csr{
vector<int> start;
vector<edge> elist;
csr(int n,const vector<pair<int,edge>>& edges):start(n+1),elist(edges.size()){
for(auto& e:edges)++start[e.first+1];
for(int i=0;i<n;++i)start[i+1]+=start[i];
auto counter=start;
for(auto& e:edges)elist[counter[e.first]++]=e.second;
}
};
vector<int> ids;
vector<pair<int,edge>> edges;
// @return pair of(# of scc,scc id)
void scc_ids(){
auto g=csr(_n,edges);
int now_ord=0;
vector<int> visited,low(_n),ord(_n,-1);
ids.resize(_n);
visited.reserve(_n);
auto dfs=[&](auto self,int v)-> void{
low[v]=ord[v]=now_ord++;
visited.push_back(v);
for(int i=g.start[v];i<g.start[v+1];++i){
auto to=g.elist[i].to;
if(ord[to]==-1){
self(self,to);
low[v]=min(low[v],low[to]);
}else{
low[v]=min(low[v],ord[to]);
}
}
if(low[v]==ord[v]){
while(true){
int u=visited.back();
visited.pop_back();
ord[u]=_n;
ids[u]=group_num;
if(u==v)break;
}
group_num++;
}
};
for(int i=0;i<_n;++i){
if(ord[i]==-1)dfs(dfs,i);
}
for(auto& x:ids){
x=group_num-1-x;
}
}
};
vector<ll> dijkstra(pmat& g,ll first){
priority_queue<datas,pvec,greater<datas>> que;
que.push(datas(0,first));
vector<ll> dist(g.size(),inf);
while(!que.empty()){
datas x=que.top();que.pop();
if(!chmin(dist[x.second],x.first))continue;
for(auto next:g[x.second]){
if(dist[next.second]<inf)continue;
next.first+=x.first;
que.push(next);
}
}
return dist;
}
struct edge{
ll from,to,cost,size;
};
vec dpf,dps;
ll N,M,K,H,W,A,B,C,D;
string s,t;
ll ans;
int main(){
startupcpp();
// int codeforces;cin>>codeforces;while(codeforces--){
ll i,j;
cin>>N>>M;++N;
dpf.resize(N,0);
dps.resize(N,0);
// vector<vector<edge>> g(N),rg(N);
vector<tuple<ll,ll,ll,ll>> eglis;
pmat dig(N),rdig(N);
scc_graph sg(N);
rep(i,M){
cin>>A>>B>>C>>D;
// g[A].push_back({B,C,D});
// rg[B].push_back({A,C,D});
dig[A].eb(1,B);
rdig[B].eb(1,A);
sg.add_edge(A,B);
eglis.emplace_back(A,B,C,D);
}
auto ch=sg.scc();
vec ok(N,0);
vec sousalis;
{
map<ll,ll> mp;
mp[sg[0]]=1;
vec dista=dijkstra(dig,0);
vec distb=dijkstra(rdig,N-1);
rep1(i,N){
if(dista[i]<inf&&distb[i]<inf){
if(mp[sg[i]]){
print("INF");
return 0;
}
ok[i]=1;
mp[sg[i]]=i;
}
}
ok[0]=1;
mp[sg[0]]=0;
for(auto x:mp)sousalis.emplace_back(x.second);
debug(ok);
debug(sousalis);
}
pmat g(N),rg(N);
for(auto [a,b,c,d]:eglis){
if(ok[a]+ok[b]<2)continue;
g[a].emplace_back(d,b);
rg[b].emplace_back(d,a);
}
debug(g);
debug(rg);
dpf[0]=1;dps[N-1]=1;
for(auto x:sousalis){
dpf[x]%=mod;
for(auto [cost,next]:g[x]){
dpf[next]+=cost*dpf[x]%mod;
}
}
debug(dpf);
reverse(all(sousalis));
for(auto x:sousalis){
dps[x]%=mod;
for(auto [cost,next]:rg[x]){
dps[next]+=cost*dps[x]%mod;
}
}
debug(dps);
ans=0;
for(auto [a,b,c,d]:eglis){
if(ok[a]+ok[b]<2)continue;
ans+=d*c%mod*dpf[a]%mod*dps[b]%mod;
}
print(ans%mod);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0