http://acm.hdu.edu.cn/showproblem.php?pid=1317
题意:给你n个房间,每个房间都有可以补充的能量,有些是负的。刚开始玩家有100的体力,接下来的输入每行代表该行所对应房间序号的能量值w,连接的房间个数num(注意是单向的),连接房间的序号。玩家从1号房走到n号房,求玩家是否有体力可以到达。
ps:题意也不怎么好懂。
思路:以前求的是最短路,所以中间要判断是否有负环,有的话这条最短路就不存在。现在是求最长路,那就要判断是否有正环了,如果有,在这正环里一直绕体力就可以变为无限。那么判环条件还是看入队次数,如果某点入队次数大于n则有环。这里有一点没有想通,为何不能入队时统计次数,想通了再补。
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
const int N = 600;
const int INF = 0x3f3f3f3f;
int G[N][N], dis[N], out[N], w[N], n;
bool inque[N];
vector <int> edge[N];
int spfa()
{
queue<int>que;
for(int i = 1; i <= n; i++)
{
dis[i] = -INF;
out[i] = 0;
}
dis[1] = 100;
inque[1] = true;
que.push(1);
while(!que.empty())
{
int u = que.front();
que.pop();
inque[u] = false;//记得还原!!
out[u]++;
if(out[u] > n) continue;
if(out[u] == n) dis[u] = INF;
for(int i = 0; i < edge[u].size(); i++)
{
int v = edge[u][i];
if(dis[u]+w[v]>dis[v] && w[v]+dis[u]>0)
{
dis[v] = dis[u]+w[v];
if(v == n) return true;
if(!inque[v])
{
inque[v] = true;
que.push(v);
}
}
}
}
return 0;
}
int main()
{
// freopen("in.txt", "r", stdin);
int num, x;
while(~scanf("%d", &n))
{
if(n == -1) break;
memset(w, 0, sizeof(w));
memset(inque, false, sizeof(inque));
for(int i = 1; i <= n; i++)
{
edge[i].clear();
scanf("%d%d", &w[i], &num);
while(num--)
{
scanf("%d", &x);
edge[i].push_back(x);
}
}
if(spfa()) printf("winnable\n");
else printf("hopeless\n");
}
return 0;
}
错误:
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
const int N = 600;
const int INF = 0x3f3f3f3f;
int G[N][N], dis[N], in[N], w[N], n;
bool inque[N];
vector <int> edge[N];
int spfa()
{
queue<int>que;
for(int i = 1; i <= n; i++)
{
dis[i] = -INF;
in[i] = 0;
}
dis[1] = 100;
inque[1] = true;
que.push(1);
while(!que.empty())
{
int u = que.front();
que.pop();
inque[u] = false;//记得还原!!
for(int i = 0; i < edge[u].size(); i++)
{
int v = edge[u][i];
if(dis[u]+w[v]>dis[v] && w[v]+dis[u]>0)
{
dis[v] = dis[u]+w[v];
if(v == n) return true;
if(!inque[v])
{
inque[v] = true;
in[v]++;
if(in[v] > n) break;
if(in[v] == n) dis[v] = INF;
que.push(v);
}
}
}
}
return 0;
}
int main()
{
// freopen("in.txt", "r", stdin);
int num, x;
while(~scanf("%d", &n))
{
if(n == -1) break;
memset(w, 0, sizeof(w));
memset(inque, false, sizeof(inque));
for(int i = 1; i <= n; i++)
{
edge[i].clear();
scanf("%d%d", &w[i], &num);
while(num--)
{
scanf("%d", &x);
edge[i].push_back(x);
}
}
if(spfa()) printf("winnable\n");
else printf("hopeless\n");
}
return 0;
}