OJ Board

At first I got accepted in ZJU judge but still was getting wa in uva.

After a lot of trials and errors finally i got ac with edge variable type as long int . I found that there are some inputs where u = v & w != 0 . I was relaxing edges where u and v are not equal (as i was using a adjacency matrix ...

I also did the same thing mentioned by andmej and in addition i also resubmitted the solution considering the graph to be undirected but still getting wa. Can anyone who solved this give some sample i/o (and/or tricky)?

I think its not illegal to disclose the last pair :
Hope it will help to debug your code and guess the range.

My AC program generates below outputs for the following intputs:

INPUT:
0.2 128
0.4 128
0.6 128
0.8 128
1 128
1.2 128
1.4 128
1.6 128
1.8 128
2 128
2.2 128
2.4 128
2.6 128
2.8 128
3 128
3.2 128
3.4 128
3.6 128
3.8 128
4 128
4.2 128
4.4 128
4.6 128
4.8 128
5 128
5.2 128
5.4 128
5.6 128
5.8 128
6 ...

Can there be any inputs like below?
The problem description doesn't clarify this...
Input:

I'm getting wa.
For the below Inputs my code generates following outputs.

Input: 15
5
0 3
4 1
3 -1
-3 -1
-4 1
5
-3 -1
3 -1
4 1
0 3
-4 1
8
0 0
0 1
2 3
4 1
4 -3
2 -3
2 -1
0 -1
7
0 1
0 -1
2 -1
2 -3
4 -3
4 1
2 3
7
0 1
2 3
4 1
4 -3
2 -3
2 -1
0 -1
7
0 -1
2 -1
2 -3
4 -3
4 1
2 3
0 1
7
4 -3
4 1
2 3
0 1
0 ...

Followings are some inputs/outputs generated by my AC code:
Input: Output:

Thanks for the discussion.

My mindset took this problem like a count down timer and i was thinking that it will count from say, 4 3 2 1 0 9 8 7 ... But i got ac now after considering there is not wrapping around . I wasn't careful at the statement " N, with value greater than zero (0) and less than ...

following input/output may help (generated by my AC program using greedy algo):
Input
2 1
Donald
Dagobert
Donald Dagobert 15
4 4
John
Mary
Cindy
Arnold
John Mary 100
John Cindy 200
Cindy Mary 40
Cindy Arnold 150
2 2
A
B
A B 10
B A 10
5 6
A
B
C
D
E
A B 50
B C 10
D E 20
E A 5
A D 20
D B 15
0 0 ...

Yes,
Greedy seems enough to comply with "Your solution must consist of at most n-1 transactions."
I also got AC with greedy to compute the transactions.

Following considerations may help to avoid WA for this problem.

1. Consider the array size at least to hold 80 * 3(if the ASCII is >= 100) + 1(Null char)= 2401 characters.
2. Consider the reverse of 100 (for d) as 001 and same for others ending with 0.
3. Consider that there may be empty line in ...

My code is below. Always getting WA. The code may seem hasty. Please somebody help me to point out the error. Please help.

Hi,
I've checked with many sets of inputs from file and it works perfectly but getting WA from OJ. Could there be any tricky input which i might be missing?

Hi Jan,
Don't know whether you'll notice this post on this old fat issue. This is my first posting in this forum. Thanks a million for your info on eps without which i possibly could never get the problem accepted.