[最长路（模板题）] poj1932 XYZZY

最新推荐文章于 2022-02-25 18:31:12 发布

原创

最新推荐文章于 2022-02-25 18:31:12 发布 · 579 阅读

2 ·

CC 4.0 BY-SA版权

文章标签：

#poj #acm #最长路 #最短路

该博客介绍了POJ1932题目的解题思路，这是一道关于最长路的ACM题目。通过将原图的边权取反并求最短路来判断玩家是否能从起点到达终点，保持能量值为正。博客内容包括题目描述、输入输出格式、样例输入输出以及关键的题目分析和解题代码。对于存在正环的情况，需要特别处理可达性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

@(ACM题目)[最长路]

Description

…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.