LightOJ 1221 Travel Company（贝尔曼最短路判负环）

C - Travel Company

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Description

A travel company is planning to launch their bus service in a new route. So they conducted a survey and made a list of all possible roads connecting different cities. Each of the roads has a certain amount of income based on current fare. But at the same time, each road has some expenses too (this includes fuel and maintenance cost, staff payments, taxes and tribute to labor union which is recently approved by the Government). The travel company is looking for a cyclic route. That is, the bus will start from any city, then visit one or more cities each exactly once and return to the starting city. The company is also concerned with the profit on the route. In fact the directors of the company have a strict requirement of a profit ratio strictly greater than P. Otherwise they will not launch the service. A profit ratio for a route is the ratio between the total incomes to the total expenses for that route.

One of your friends works in that company and he asks for a little help from you. All you have to do is to determine if there exists such route, so that the company has a profit ratio of P.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a blank line and three integers N, R, P (2 ≤ N ≤ 100, 0 ≤ R ≤ 9900, 1 ≤ P ≤ 100).N, R and P represents number of cities, number of road links and the expected profit ratio respectively. Then Rlines follow. Each line contains four integers A_i, B_i, I_i, E_i (0 ≤ A_i, B_i < N, 0 ≤ I_i ≤ 5000, 1 ≤ E_i ≤ 5000). (A_i, B_i) represents directed road link from city A_i to B_i. I_i and E_i are the incomes and expenses of the road link respectively. You may assume that (A_i, B_i) ≠ (A_j, B_j), if i ≠ j and A_i ≠ B_i for any i.

Output

For each case, print the case number and "YES" if there is a cyclic route for which the profit ratio is greater than P or "NO", if there is no such route.

Sample Input

3

 

5 8 3

0 1 17 8

1 0 10 5

1 2 11 5

1 4 5 3

2 3 13 7

3 1 9 4

4 3 11 1

3 0 11 6

 

5 8 3

0 1 17 8

1 0 10 5

1 2 11 5

1 4 5 3

2 3 13 7

3 1 9 4

4 3 11 2

3 0 11 6

 

5 8 2

0 1 17 8

1 0 10 5

1 2 11 5

1 4 5 3

2 3 13 7

3 1 9 4

4 3 11 5

3 0 11 6

Sample Output

Case 1: YES

Case 2: NO

Case 3: YES

贝尔曼最短路算法判负环，因为把i写成了j。。导致调了好长时间。。。比赛完才AC的。。sad。。。第一次还看错题意了。。。。sssssad。。。。

代码如下：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
#include <queue>
#include <map>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
int d[200], cnt, n;
struct node
{
    int u, v, w;
} edge[1000000];
void add(int u, int v, int w)
{
    edge[cnt].u=u;
    edge[cnt].v=v;
    edge[cnt++].w=w;
}
void berman()
{
    memset(d,INF,sizeof(d));
    int i, j;
    for(i=0;i<n-1;i++)
    {
        for(j=0;j<cnt;j++)
        {
            if(d[edge[j].v]>d[edge[j].u]+edge[j].w)
            {
                d[edge[j].v]=d[edge[j].u]+edge[j].w;
            }
        }
    }
    for(i=0;i<cnt;i++)
    {
        if(d[edge[i].v]>d[edge[i].u]+edge[i].w)
        {
            printf("YES\n");
            return ;
        }
    }
    printf("NO\n");
}
int main()
{
    int t, u, v, w, cost, m, num=0, p;
    scanf("%d",&t);
    while(t--)
    {
        num++;
        scanf("%d%d%d",&n,&m,&p);
        cnt=0;
        while(m--)
        {
            scanf("%d%d%d%d",&u,&v,&w,&cost);
            add(u,v,cost*p-w);
        }
        printf("Case %d: ",num);
        berman();
    }
    return 0;
}