Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 48390 | Accepted: 17841 |
Description
While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of FJ's farms comprises N (1 ≤ N ≤ 500) fields conveniently numbered 1..N, M (1 ≤ M ≤ 2500) paths, and W (1 ≤ W ≤ 200) wormholes.
As FJ is an avid time-traveling fan, he wants to do the following: start at some field, travel through some paths and wormholes, and return to the starting field a time before his initial departure. Perhaps he will be able to meet himself :) .
To help FJ find out whether this is possible or not, he will supply you with complete maps to F (1 ≤ F ≤ 5) of his farms. No paths will take longer than 10,000 seconds to travel and no wormhole can bring FJ back in time by more than 10,000 seconds.
Input
Line 1 of each farm: Three space-separated integers respectively: N, M, and W
Lines 2.. M+1 of each farm: Three space-separated numbers ( S, E, T) that describe, respectively: a bidirectional path between S and E that requires T seconds to traverse. Two fields might be connected by more than one path.
Lines M+2.. M+ W+1 of each farm: Three space-separated numbers ( S, E, T) that describe, respectively: A one way path from S to E that also moves the traveler back T seconds.
Output
Sample Input
2 3 3 1 1 2 2 1 3 4 2 3 1 3 1 3 3 2 1 1 2 3 2 3 4 3 1 8
Sample Output
NO YES
Hint
For farm 2, FJ could travel back in time by the cycle 1->2->3->1, arriving back at his starting location 1 second before he leaves. He could start from anywhere on the cycle to accomplish this.
Source
题目的题意不是太好理解,先说下题目的题意,讲的是在n个农场之间,存在m个双向路径,还存在w个单向虫洞,虫洞可以使得时光倒流,求是否能够通过虫洞来遇见出发前的自己。题目要求的是任意两点点的,所以首先想到的应该是floyd算法,所以本题要求的就是通过虫洞的时间大于通过普通路径的时间即输出yes,可以设通过虫洞的时间为-t,判断是否存在负权环即可。
#include <cstdio>
#include <cstring>
#define INF 1000005
using namespace std;
int map[505][505];
int n,m,w;
int floyd(){
for(int k = 1; k <= n; k ++){
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= n; j ++){
if(map[i][j] > map[i][k] + map[k][j])
map[i][j] = map[i][k] + map[k][j];
}
if(map[i][i] < 0)
return 1;
}
}
return 0;
}
int main(){
int f;
scanf("%d",&f);
while(f --){
scanf("%d%d%d",&n,&m,&w);
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
map[i][j] = (i == j ? 0 : INF);
int s,e,t;
for(int i = 1; i <= m; i ++){
scanf("%d%d%d",&s,&e,&t);
if(map[s][e] > t)
map[s][e] = map[e][s] = t;
}
for(int i = m+1; i <= m+w; i ++){
scanf("%d%d%d",&s,&e,&t);
if(map[s][e] > -t)
map[s][e] = -t;
}
int flag;
flag = floyd();
if(flag)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}