HDU1317:XYZZY(Floyd+Bellman)

原创 2013年12月03日 21:34:31
Problem Description
It has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment on the Y-Crate. Your job is to test a number of these designs to see which are winnable. 
Each game consists of a set of up to 100 rooms. One of the rooms is the start and one of the rooms is the finish. Each room has an energy value between -100 and +100. One-way doorways interconnect pairs of rooms. 

The player begins in the start room with 100 energy points. She may pass through any doorway that connects the room she is in to another room, thus entering the other room. The energy value of this room is added to the player's energy. This process continues until she wins by entering the finish room or dies by running out of energy (or quits in frustration). During her adventure the player may enter the same room several times, receiving its energy each time. 
 

Input
The input consists of several test cases. Each test case begins with n, the number of rooms. The rooms are numbered from 1 (the start room) to n (the finish room). Input for the n rooms follows. The input for each room consists of one or more lines containing: 

the energy value for room i 
the number of doorways leaving room i 
a list of the rooms that are reachable by the doorways leaving room i 
The start and finish rooms will always have enery level 0. A line containing -1 follows the last test case. 
 

Output
In one line for each case, output "winnable" if it is possible for the player to win, otherwise output "hopeless". 
 

Sample Input
5 0 1 2 -60 1 3 -60 1 4 20 1 5 0 0 5 0 1 2 20 1 3 -60 1 4 -60 1 5 0 0 5 0 1 2 21 1 3 -60 1 4 -60 1 5 0 0 5 0 1 2 20 2 1 3 -60 1 4 -60 1 5 0 0 -1
 

Sample Output
hopeless hopeless winnable winnable
 


题意:出发点就有100点能量,到达一个新点能得到一个正或者负的能量,可走重复的点 ,所以如果有环,且环能得到总能量大于0,则必定可以到最终点

 

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define inf 99999999
using namespace std;

struct node
{
    int now,to;
} e[10005];
int first[105],next[10005];
int power[105],map[105][105],n;

void add_edge(node e,int k)
{
    next[k] = first[e.now];
    first[e.now] = k;
}

void Floyd()
{
    int i,j,k;
    for(k = 1; k<=n; k++)
        for(i = 1; i<=n; i++)
            for(j = 1; j<=n; j++)
                if(!map[i][j])
                    map[i][j] = map[i][k]&&map[k][j];
}

int bellman_ford(int len)
{
    int dis[105];
    int i,k,now,to;
    for(i = 1; i<=n; i++)
        dis[i] = -inf;
    dis[1] = 100;
    for(k = 0; k<n-1; k++)
    {
        for(i = 0; i<len; i++)
        {
            now = e[i].now;
            to = e[i].to;
            if(dis[to]<dis[now]+power[to] && dis[now]+power[to]>0)
                dis[to] = dis[now]+power[to];
        }
    }
    for(i = 0; i<len; i++)
    {
        now = e[i].now;
        to = e[i].to;
        if(dis[to]<dis[now]+power[to] && dis[now]+power[to]>0 && map[to][n])//判断环,要注意判断这个环能到终点
            return 1;
    }
    return dis[n]>0;
}

int main()
{
    int i,j,len,m;
    while(~scanf("%d",&n),n>0)
    {
        memset(e,0,sizeof(e));
        memset(power,0,sizeof(power));
        memset(map,0,sizeof(map));
        memset(first,-1,sizeof(first));
        memset(next,-1,sizeof(next));
        len = 0;
        for(i = 1; i<=n; i++)
        {
            scanf("%d%d",&power[i],&m);
            for(j = 0; j<m; j++)
            {
                int x;
                scanf("%d",&x);
                e[len].now = i;
                e[len].to = x;
                map[i][x] = 1;
                add_edge(e[len],len);
                len++;
            }
        }
        Floyd();
        if(!map[1][n])
        {
            printf("hopeless\n");
            continue;
        }
        if(bellman_ford(len))
            printf("winnable\n");
        else
            printf("hopeless\n");
    }

    return 0;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU1317( 负权处理)

题意:有n个房间(n 思路: 1.首先可以发现,只要知道到第n个房间时最大可以获得多少能量值(当然必须保证中途都大于0),就能知道能否赢。 2.考虑到负环情况,跑SPFA的时候最...

HDU 1317 XYZZY

题意是指 从1 到 N 能否保证 到达每个点的时候 能量都为正数。 起点 1 初始100 点能量。 输入是 从 1 ~ N , 分别是 能量,能到m个房间, 分别是 a1,a2,a3,…,...

hdu-1317-XYZZY-Bellman-Ford判环、Floyd算法

hdu-1317-XYZZY-Bellman-Ford判环、Floyd算法

Hdu 1317 XYZZY[floyd+bellman_ford]

题目链接:点击打开链接 简单来说,就是从房间1走到n的可能性,如果可能,winnable,否则,hopeless。每到达一个房间可以得到,一个房间内的能量。能量小于等于0的时候,就是游戏结束的时候。 ...

hdoj1317-XYZZY(floyd + bellman_ford)

题目链接题目大意       一个冒险家从1号房间出发时,有100点能量值,然后题目中给出从一个房间能到达另一个房间的路,然后到达每个房间能获得的能量值(-100到100),当冒险家的能量值小于或等于...

hdu 1317 XYZZY【BellmanFord+Floyd】

XYZZY Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total ...

【HDU】1317 XYZZY spfa判负环+floyd求传递闭包

传送门:【HDU】1317 XYZZY 题目分析:首先我们可以用spfa判fu

HDU 1317 XYZZY (SPFA 找正环 + Floyd 判连通)

HDU 1317 XYZZY (SPFA 找正环 + Floyd 判连通)

hdoj1317-XYZZY(bellman-ford)

转自:http://www.cnblogs.com/SolarWings/archive/2013/03/16/2963961.html思路        这道题纠结了俩小时,总觉得网上的解法存在点问...

hdoj 1317 XYZZY 【spfa判断正环求最长路径&&floyd求传递闭包】

XYZZY Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Su...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU1317:XYZZY(Floyd+Bellman)
举报原因:
原因补充:

(最多只允许输入30个字)