线段树优化建图 || CF786B Legacy

题面：786B - Legacy

代码：

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<queue>
 #define ll long long
 using namespace std;
 inline ll rd(){
     ll x=,f=;char c=getchar();
     while(c<''||c>''){if(c=='-')f=-; c=getchar();}
     while(c>=''&&c<=''){x=x*+c-''; c=getchar();}
     return f*x;
 }
 const int maxn=(1e5)+,maxq=maxn;
 const ll inf=1ll<<;
 int N,S,Q,o,v,u,ql,qr,num_edge=,edge_head[maxn*];
 int tr[maxn*][],cnt;
 ll w,Dis[maxn*];
 bool vis[maxn*];
 struct Num_{
     int id;ll dis;
     bool operator < (const Num_&a) const{
         return a.dis<dis;
     }
 }e;
 priority_queue<Num_>pri;
 struct Edge{ int to,nx; ll dis; }edge[maxn*];
 inline void Add_edge(int from,int to,int dis){
     edge[++num_edge].nx=edge_head[from];
     edge[num_edge].to=to;
     edge[num_edge].dis=dis;
     edge_head[from]=num_edge;
     return;
 }
 void Build(int x,int l,int r){
     if(l==r){
         tr[x][]=tr[x][]=l;
         return;
     }
     int m=(l+r)>>;
     tr[x][]=++cnt; tr[x][]=++cnt;
     Build(x<<,l,m); Build(x<<|,m+,r);
     Add_edge(tr[x][],tr[x<<][],);
     Add_edge(tr[x][],tr[x<<|][],);
     Add_edge(tr[x<<][],tr[x][],);
     Add_edge(tr[x<<|][],tr[x][],);
     return;
 }
 void Update(int x,int l,int r,int ql,int qr,int u,int val,int op){
     if(ql<=l&&r<=qr){
         if(op==) Add_edge(u,tr[x][],val);
         else Add_edge(tr[x][],u,val);
         return;
     }
     int m=(l+r)>>;
     if(ql<=m)Update(x<<,l,m,ql,qr,u,val,op);
     if(qr>m)Update(x<<|,m+,r,ql,qr,u,val,op);
     return;
 }
 inline void Dijkstra(int s){
     for(int i=;i<=cnt;i++)Dis[i]=inf;
     Dis[s]=;
     e.id=s;e.dis=;
     pri.push(e);
     while(!pri.empty()){
         int x=(pri.top()).id;
         pri.pop();
         if(vis[x])continue;
         vis[x]=;
         for(int i=edge_head[x];i;i=edge[i].nx){
             int y=edge[i].to;
             if(Dis[x]+edge[i].dis<Dis[y]){
                 Dis[y]=Dis[x]+edge[i].dis;
                 e.id=y;e.dis=Dis[y];
                 pri.push(e);
             }
         }
     }
     return;
 }
 int main(){
     N=rd();Q=rd();S=rd();
     cnt=N;
     Build(,,N);
     while(Q--){
         o=rd();
         if(o==){
             v=rd();u=rd();w=rd();
             Add_edge(v,u,w);
         }
         else {
             v=rd();ql=rd();qr=rd();w=rd();
             if(o==)
                 Update(,,N,ql,qr,v,w,);
             else//o==3
                 Update(,,N,ql,qr,v,w,);
         }
     }
     Dijkstra(S);
     for(int i=;i<=N;i++)
         if(Dis[i]!=inf)printf("%lld ",Dis[i]);
         else printf("-1 ");
     return ;
 }

邻接表建图版

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<queue>
 #define make(a,b) (make_pair(a,b))
 #define ll long long
 using namespace std;
 inline ll rd(){
     ll x=,f=;char c=getchar();
     while(c<''||c>''){if(c=='-')f=-; c=getchar();}
     while(c>=''&&c<=''){x=x*+c-''; c=getchar();}
     return f*x;
 }
 const int maxn=(1e5)+,maxq=maxn;
 const ll inf=1ll<<;
 int N,Q,S,trIn[maxn<<],trOut[maxn<<];
 int u,v,ql,qr,o,cnt;
 bool vis[maxn<<];
 vector<pair<int,ll> >edge[maxn<<];//to,val
 ll w,Dis[maxn<<];
 struct Num_{
     ll dis;
     int id;
     bool operator < (const Num_&a) const {
         return a.dis<dis;
     }
 }b;
 priority_queue<Num_>pri;
 void Build(int x,int l,int r){
     if(l==r){
         trIn[x]=l;
         trOut[x]=l;
         return;
     }
     int mid=(l+r)>>;
     trIn[x]=++cnt;trOut[x]=++cnt;
     Build(x<<,l,mid);Build(x<<|,mid+,r);
     edge[trIn[x]].push_back(make(trIn[x<<],));
     edge[trIn[x]].push_back(make(trIn[x<<|],));
     edge[trOut[x<<]].push_back(make(trOut[x],));
     edge[trOut[x<<|]].push_back(make(trOut[x],));
     return;
 }
 void Update(int x,int l,int r,int ql,int qr,int u,int val,int o){
     if(ql<=l&&r<=qr){
         if(o==)//In
             edge[u].push_back(make(trIn[x],val));
         else//Out
             edge[trOut[x]].push_back(make(u,val));
         return;
     }
     int mid=(l+r)>>;
     if(ql<=mid)Update(x<<,l,mid,ql,qr,u,val,o);
     if(qr>mid)Update(x<<|,mid+,r,ql,qr,u,val,o);
     return;
 }
 inline void Dijkstra(int s){
     for(int i=;i<=cnt;i++)Dis[i]=inf;
     Dis[s]=;
     b.dis=;b.id=s;
     pri.push(b);
     while(!pri.empty()){
         int x=(pri.top()).id;
         pri.pop();
         if(vis[x])continue;
         vis[x]=;
         int toi=edge[x].size();
         for(int i=;i<toi;i++){
             int y=edge[x][i].first;
             if(Dis[y]>Dis[x]+edge[x][i].second){
                 Dis[y]=Dis[x]+edge[x][i].second;
                 b.id=y;b.dis=Dis[y];
                 pri.push(b);
             }
         }
     }
     return;
 }
 int main(){
     N=rd();Q=rd();S=rd();
     cnt=N;
     Build(,,N);
     while(Q--){
         o=rd();
         if(o==){
             v=rd();u=rd();w=rd();
             edge[v].push_back(make(u,w));
         }
         else if(o==){
             v=rd();ql=rd();
             qr=rd();w=rd();
             Update(,,N,ql,qr,v,w,);
         }
         else {//o==3
             v=rd();ql=rd();
             qr=rd();w=rd();
             Update(,,N,ql,qr,v,w,);
         }
     }
     Dijkstra(S);
     for(int i=;i<=N;i++){
         if(Dis[i]!=inf) printf("%lld ",Dis[i]);
         else printf("-1 ");
     }
     return ;
 }

Vector建图版

---

By:AlenaNuna