S - Extended Traffic LightOJ - 1074
题意: 每个点有一个点权,边权为边的(终点点权-起点点权)的立方, 求从 1 出发的最短路
思路一:DJ,太简单了
结果一发WA了,妙啊,记得考虑负边权,可能有负环
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 210;
const int inf = 0x3f3f3f3f;
int mp[maxn];
int n, m;
int head[maxn], cnt, dis[maxn];
bool vis[maxn];
struct edge {
int to, next, w;
}e[maxn*maxn];
void add(int u, int v, int w) {
e[++cnt].next = head[u]; e[cnt].to = v; e[cnt].w = w; head[u] = cnt;
}
typedef struct node {
int u, dist;
node (int _u, int _dist) : u(_u), dist(_dist) {}
} cam;
bool operator < (const cam &a, const cam &b) {
return a.dist > b.dist;
}
void dijkstra() {
memset(dis, inf, sizeof(dis));
priority_queue<cam> heap;
heap.push(cam(1, 0));
while(heap.size()) {
cam now = heap.top(); heap.pop();
int u = now.u; int dist = now.dist;
if(vis[u]) continue;
vis[u] = 1;
for(int i = head[u]; i; i = e[i].next) {
int to = e[i].to;
if(dis[to] > dist + e[i].w) {
dis[to] = dist + e[i].w;
heap.push(cam(to, dis[to]));
}
}
}
}
void init() {
memset(head, 0, sizeof(head));
cnt = 0;
memset(vis, 0, sizeof(vis));
}
int main() {
// freopen("test.in", "r", stdin);
int T; scanf("%d", &T);
int kase = 0;
while(T--) {
init();
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &mp[i]);
scanf("%d", &m);
int u, v, w;
for(int i = 1; i <= m; i++) {
scanf("%d%d", &u, &v);
w = (mp[v] - mp[u])*(mp[v] - mp[u])*(mp[v] - mp[u]);
add(u, v, w);
}
dijkstra();
int q; scanf("%d", &q);
printf("Case %d:\n", ++kase);
while(q--) {
int k; scanf("%d", &k);
if(dis[k] == inf || dis[k] < 3) printf("?\n");
else printf("%d\n", dis[k]);
}
}
return 0;
}
思路二:转战 SPFA
直接判环的话: O(VE*T) == O(4E4 * 2E2 * 50) 超 1E8了, 所以如果直接在 SPFA 内不停的跑到所有负环内的点都找出来,肯定 TLE 了
那就剪枝,直接找出一个 负环 内的点后,通过dfs标记它能走到的所有点,即这些点的到起点的距离可以无限小
AC代码
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 210;
const int inf = 0x3f3f3f3f;
int mp[maxn];
int n, m;
int head[maxn], cnt, dis[maxn], num[maxn];
bool vis[maxn], flag[maxn];
struct edge {
int to, next, w;
}e[maxn*maxn];
void add(int u, int v, int w) {
e[++cnt].next = head[u]; e[cnt].to = v; e[cnt].w = w; head[u] = cnt;
}
void dfs(int u) {
flag[u] = 1;
for(int i = head[u]; i; i = e[i].next)
if(!flag[e[i].to]) dfs(e[i].to);
}
void spfa() {
memset(dis, inf, sizeof(dis));
dis[1] = 0;
queue<int> Q;
Q.push(1); vis[1] = 1;
num[1] ++;
while(Q.size()) {
int now = Q.front(); Q.pop(); vis[now] = 0;
for(int i = head[now]; i; i = e[i].next) {
int to = e[i].to;
if(dis[to] > dis[now] + e[i].w) {
dis[to] = dis[now] + e[i].w;
if(vis[to]) continue;
Q.push(to); vis[to] = 1;
if(++num[to] > n) {
dfs(to);
return ;
}
}
}
}
return ;
}
void init() {
memset(head, 0, sizeof(head));
cnt = 0;
memset(vis, 0, sizeof(vis));
memset(flag, 0, sizeof(flag));
memset(num, 0, sizeof(num));
}
int main() {
// freopen("test.in", "r", stdin);
int T; scanf("%d", &T);
int kase = 0;
while(T--) {
init();
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &mp[i]);
scanf("%d", &m);
int u, v, w;
for(int i = 1; i <= m; i++) {
scanf("%d%d", &u, &v);
w = (mp[v] - mp[u])*(mp[v] - mp[u])*(mp[v] - mp[u]);
add(u, v, w);
}
spfa();
int q; scanf("%d", &q);
printf("Case %d:\n", ++kase);
while(q--) {
int k; scanf("%d", &k);
if(flag[k] || dis[k] == inf || dis[k] < 3) printf("?\n");
else printf("%d\n", dis[k]);
}
}
return 0;
}