题目链接
首先,有的人是用SPFA卡过去的,当然是卡过去的,正确的SPFA复杂度计算是,那么都是级别的了。肯定不是出题人希望的正解了。
那么,有two_M个双向边、one_M个单向边(我就用one、two来分别定义单双向了)。我就在想了,如果是一副DAG图,岂不是很快的就能确定答案了(简直就是的时间复杂度啊),那样子,我们先把所有的边都输进来,然后呢,我们缩点来看看,一下子,就能发现了,它变成了一副DAG。但是,我们似乎之用与起点S能抵达的点,其他点没用啊。
但是,这个DAG图,我们怎样才能确定它的每个点的值呢,因为受到强连通分量内的点的影响的。
所以,既然是个DAG,不如就上拓扑咯,我们对每个强连通分量内的点去用堆优化的Dijkstra来跑最短路,对联通分量外面的结点,一定是DAG的,所以就能确定它的初始值了,然后继续跑,岂不就可以跑完整张图了,而且仅用时50ms。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define Min3(a, b, c) min(a, min(b, c))
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 25005, maxM = 1.5e5 + 7;
int N, two_M, one_M, S, head[maxN], cnt;
struct Eddge
{
int nex, to, val;
Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), val(c) {}
}edge[maxM];
inline void addEddge(int u, int v, int w)
{
edge[cnt] = Eddge(head[u], v, w);
head[u] = cnt++;
}
inline void _add(int u, int v, int w) { addEddge(u, v, w); addEddge(v, u, w); }
vector<int> B[maxN];
vector<pair<int, int>> G[maxN];
int TP_sort[maxN], _Index = 0;
struct Tarjan_Struct
{
int dfn[maxN], low[maxN], tot, Stap[maxN], Stop, Belong[maxN], Bcnt, du[maxN];
bool instack[maxN];
queue<int> Q;
Tarjan_Struct() { tot = Bcnt = Stop = 0; for(int i=0; i<maxN; i++) { dfn[i] = du[i] = 0; instack[i] = false; } }
void Tarjan(int u)
{
dfn[u] = low[u] = ++tot;
Stap[++Stop] = u;
instack[u] = true;
int v;
for(int i=head[u]; ~i; i=edge[i].nex)
{
v = edge[i].to;
if(!dfn[v])
{
Tarjan(v);
low[u] = min(low[u], low[v]);
}
else if(instack[v]) low[u] = min(low[u], dfn[v]);
}
if(low[u] == dfn[u])
{
Bcnt++;
do
{
v = Stap[Stop--];
instack[v] = false;
Belong[v] = Bcnt;
B[Bcnt].push_back(v);
} while(v != u);
}
}
inline void tp_sort()
{
while(!Q.empty()) Q.pop();
Q.push(Belong[S]);
int u, len;
while(!Q.empty())
{
u = Q.front(); Q.pop();
TP_sort[++_Index] = u;
len = (int)G[u].size();
for(int i=0, v; i<len; i++)
{
v = G[u][i].first;
du[v]--;
if(!du[v])
{
Q.push(v);
}
}
}
}
inline void Start()
{
Tarjan(S);
for(int u=1, fa_u, fa_v; u<=N; u++)
{
if(!dfn[u]) continue;
fa_u = Belong[u];
for(int i=head[u], v; ~i; i=edge[i].nex)
{
v = edge[i].to;
fa_v = Belong[v];
if(fa_u == fa_v) continue;
G[fa_u].push_back(MP(fa_v, edge[i].val));
du[fa_v]++;
}
}
tp_sort();
}
}T_T_Tarjan;
struct node
{
int id, val;
node(int a=0, int b=0):id(a), val(b) {}
friend bool operator < (node e1, node e2) { return e1.val > e2.val; }
};
priority_queue<node> Q;
int dp[maxN];
inline void Dijkstra(int id)
{
node now;
int u;
while(!Q.empty())
{
now = Q.top(); Q.pop();
u = now.id;
if(now.val > dp[u]) continue;
for(int i=head[u], v; ~i; i=edge[i].nex)
{
v = edge[i].to;
if(T_T_Tarjan.Belong[v] == id)
{
if(dp[v] > dp[u] + edge[i].val)
{
dp[v] = dp[u] + edge[i].val;
Q.push(node(v, dp[v]));
}
}
else dp[v] = min(dp[v], dp[u] + edge[i].val);
}
}
}
inline void init()
{
cnt = 0;
for(int i=1; i<=N; i++)
{
head[i] = -1;
dp[i] = INF;
}
dp[S] = 0;
}
int main()
{
scanf("%d%d%d%d", &N, &two_M, &one_M, &S);
init();
for(int i=1, u, v, w; i<=two_M; i++)
{
scanf("%d%d%d", &u, &v, &w);
_add(u, v, w);
}
for(int i=1, u, v, w; i<=one_M; i++)
{
scanf("%d%d%d", &u, &v, &w);
addEddge(u, v, w);
}
T_T_Tarjan.Start();
for(int i=1, id, siz; i<=_Index; i++)
{
id = TP_sort[i];
while(!Q.empty()) Q.pop();
siz = (int)B[id].size();
for(int j=0, u; j<siz; j++)
{
u = B[id][j];
Q.push(node(u, dp[u]));
}
Dijkstra(id);
}
for(int i=1; i<=N; i++)
{
if(dp[i] == INF) printf("NO PATH\n");
else printf("%d\n", dp[i]);
}
return 0;
}