Gym - 101986F Pizza Delivery 最短路可行边+tarjan求桥 求必经边

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define p_queue priority_queue
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)

//前向星
int n , m;
int judge[500000];
int head[200000], f_head[200000], t_head[200000];
int cnt = 0, f_cnt = 0, t_cnt = 0;
struct e{
    int f ,t ,next ,w ,id;
}edge[500000], f_edge[500000], t_edge[500000];
void add(int f, int t, int w)
{
    edge[cnt].f = f;
    edge[cnt].t = t;
    edge[cnt].w = w;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
void f_add(int f, int t, int w)
{
    f_edge[f_cnt].f = f;
    f_edge[f_cnt].t = t;
    f_edge[f_cnt].w = w;
    f_edge[f_cnt].next = f_head[f];
    f_head[f] = f_cnt ++;
}
void t_add(int f, int t, int id)
{
    t_edge[t_cnt].id = id;
    t_edge[t_cnt].t = t;
    t_edge[t_cnt].next = t_head[f];
    t_head[f] = t_cnt ++;
}
//堆优化dij
struct node
{
    int v;
    ll value;
    node(int a, ll b):v(a),value(b){};
    bool operator < (const node& no) const {
        return value > no.value;
    }
};
ll dis1[200000];
int vis1[200000];
void dijkstra1()
{
    for (int i = 0 ; i < 199999 ; i ++)
        dis1[i] = 1e18;
    mem(vis1,0);
    p_queue <node> q;
    dis1[1] = 0;
    q.push(node(1,0));
    while(!q.empty())
    {
        node no = q.top();
        q.pop();
        int u = no.v;
        if(vis1[u]) continue;
        vis1[u] = 1;
        for(int i = head[u] ; i != -1 ; i = edge[i].next)
        {
            int v = edge[i].t , w = edge[i].w;
            if(dis1[v] > dis1[u] + w)
            {
                dis1[v] = dis1[u] + w;
                q.push(node(v,dis1[v]));
            }
        }
    }
}
ll dis2[200000];
int vis2[200000];
void dijkstra2()
{
    for (int i = 0 ; i < 199999 ; i ++)
        dis2[i] = 1e18;
    mem(vis2,0);
    p_queue <node> q;
    dis2[2] = 0;
    q.push(node(2,0));
    while(!q.empty())
    {
        node no = q.top();
        q.pop();
        int u = no.v;
        if(vis2[u]) continue;
        vis2[u] = 1;
        for(int i = f_head[u] ; i != -1 ; i = f_edge[i].next)
        {
            int v = f_edge[i].t , w = f_edge[i].w;
            if(dis2[v] > dis2[u] + w)
            {
                dis2[v] = dis2[u] + w;
                q.push(node(v,dis2[v]));
            }
        }
    }
}
//tarjan
int dfn[200000] ,low[200000], times;
void tarjan(int u, int id)
{
    dfn[u] = low[u] = ++times;
    for(int i = t_head[u] ; i != -1 ; i = t_edge[i].next)
    {
        int v = t_edge[i].t, x = t_edge[i].id;
        if(!dfn[v])
        {
            tarjan(v,i);
            low[u] = min (low[u] , low[v]);
            if(low[v] > dfn[u])
                judge[x] = 2;
        }
        else if(i != (id ^ 1)) // 如果有重边
            low[u] = min(low[u], dfn[v]);
    }
}
int main(void)
{
    scanf("%d %d", &n, &m);
    mem(head,-1);
    mem(f_head,-1);
    mem(t_head,-1);
    for (int i = 1 ;i <= m ; i ++)
    {
        int u ,v , w;
        scanf("%d %d %d",&u , &v , &w);
        add (u, v, w);
        f_add (v, u, w);
    }
    dijkstra1();
    dijkstra2();
    for (int i = 0 ; i < cnt ; i ++)
    {
        int u = edge[i].f , v = edge[i].t, w = edge[i].w;
        if(dis1[v] + dis2[u] + w < dis1[2])
            judge[i] = 1;
        if(dis1[u] + dis2[v] + w == dis1[2])
            t_add(u, v, i), t_add(v, u, i);
    }
    tarjan(1,0);
    for (int i = 0 ; i < cnt ; i ++)
    {
        if (judge[i] == 2)
            printf("SAD\n");
        else if (judge[i] == 1)
            printf("HAPPY\n");
        else
            printf("SOSO\n");
    }
}