CodeForces 567E President and Roads（最短路 + tarjan求桥）

//最短路+桥
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long LL;
const int M=100100,N=100010;
const LL INF=0x7fffffffffffff;
struct Edge{
    int from,to,cap,next;
    int id;
}edge[2*M];
int head[2][N];
int cnt;
struct road
{
    int u,v,w;
    int flag;
    LL ans;
}R[M];
void init(){
    cnt=0;
    memset(head, -1, sizeof(head));
}
void addedge(int u,int v,int w,int ii,int flag){
    edge[cnt].from=u;edge[cnt].to=v;edge[cnt].cap=w;edge[cnt].id=ii;
    edge[cnt].next=head[flag][u];head[flag][u]=cnt++;
}
struct HeapNode{
    LL dis;
    int id;
    bool operator<(const HeapNode &A)const{
        return dis>A.dis;
    }
};
LL dis[2][N];
int vis[N];
void Dijstra(int s,int flag,int n){
    priority_queue<HeapNode>Q;
    for(int i=1;i<=n;i++){
        dis[flag][i]=INF;
        vis[i]=0;
    }
    dis[flag][s]=0;
    Q.push((HeapNode){0,s});
    while(!Q.empty()){
        HeapNode k=Q.top();
        Q.pop();
        int u=k.id;
        if(vis[u])continue;
        vis[u]=1;
        for(int i=head[flag][u];i!=-1;i=edge[i].next){
            int v=edge[i].to;
            if(dis[flag][u]+edge[i].cap<dis[flag][v]){
                dis[flag][v]=dis[flag][u]+edge[i].cap;
                Q.push((HeapNode){dis[flag][v],v});
            }
        }
    }
}
void Reduce(int m,int t){
    LL mincost=dis[0][t];
    init();
    for(int i=0;i<m;i++){
        int u=R[i].u,v=R[i].v;
        if(dis[0][u]==INF||dis[1][v]==INF){
            R[i].flag=-2;continue;
        }
        if(dis[0][u]+dis[1][v]+(LL)R[i].w>mincost){
            R[i].flag=-1;
            R[i].ans=(LL)R[i].w+1-(mincost-dis[0][u]-dis[1][v]);
        }
        else if(dis[0][u]+dis[1][v]+(LL)R[i].w==mincost){
            addedge(u,v,R[i].w,i,0);
            addedge(v,u,R[i].w,i,0);
        }
    }
}
int dfn[N],low[N];
int indx;
int fa[N];//fa[v]记录的是来边的编号
void tarjan(int u){//重边求桥
    dfn[u]=low[u]=++indx;
    for(int i=head[0][u];i!=-1;i=edge[i].next){
        int v=edge[i].to;
        if(dfn[v]==-1){
            fa[v]=edge[i].id;
            tarjan(v);
            low[u]=min(low[u],low[v]);
            if(low[v]>dfn[u]){//子节点到不了u及以上
                R[edge[i].id].flag=1;
            }
        }
        else {
            if(fa[u]!=edge[i].id){
                low[u]=min(low[u],dfn[v]);
            }
        }
    }
}
void output(int m){
    for(int i=0;i<m;i++){
        if(R[i].flag==-1){
            if(R[i].ans<R[i].w&&R[i].ans>0)
                printf("CAN %lld\n",R[i].ans);
            else
                printf("NO\n");
        }
        else if(R[i].flag==1){
            printf("YES\n");
        }
        else {
            if(R[i].w>1&&R[i].flag!=-2)
                printf("CAN 1\n");
            else
                printf("NO\n");
        }
    }
}
int main(){
    int n,m,s,t;
    init();
    scanf("%d%d%d%d",&n,&m,&s,&t);
    for(int i=0;i<m;i++){
        scanf("%d%d%d",&R[i].u,&R[i].v,&R[i].w);
        addedge(R[i].u,R[i].v,R[i].w,i,0);
        addedge(R[i].v,R[i].u,R[i].w,i,1);
    }
    Dijstra(s,0,n);
    Dijstra(t,1,n);
    Reduce(m,t);
    memset(dfn, -1, sizeof(dfn));
    memset(low, 0, sizeof(low));
    indx=0;
    tarjan(s);
    output(m);
    return 0;
}