Doubt in chef and circle run problem

general
,
1

Guys… it’s so embarrassing for me to post this here… Coz this particular problem is haunting me like anything…
I don’t know why am i getting constantly WA verdict for 2nd and 3rd subtasks…
I’ve prepared all possible corner cases and checked it…
I’ve been on it for the past 5 days…
Still i’m unable to figure out the bug…
Here by i ask you guys to gimme some test cases which you feel tricky…
then i could test them with my code…
I’m exhausted at last… How weird… i’ve never faced such an insane problem…

2

Um, since the contest is still going on, no user can provide you with test cases.

1 Like
3

then i’ll post my code here…
any one could check with their test cases which they feel tricky…
here is my code… in C… https://www.codechef.com/viewsolution/11169457

4

1
5
-6 3 -7 -8 2
output: -18??

5

Thanks for your reply…
But mention it clearly…

6

1(first line, no. of test cases)
5(second line, no. of nodes)
-6 3 -7 -8 2(third line, edge weights)
1 5(Sorry missed it.)
What is your output?

7

and I dont think people can access your code. Can they?

8

output should be -34

9

sorry…output is -40…
my code is correct…

10

i’ve just manually calculated first… sorry for that…My code says… the answer is -40

11

yes! that’s right

12

1 -> 2 -> 1 -> 5 -> 4 -> 3 -> 4 -> 5
this is the walk

13

I’m sure that the test cases they check for are too bad… i’m damn sure about it…

14

looks fine…no idea

15

And the worst part is the tester and the setter of this problem are not at all responding in the comment section…

16

I guess they want the contest to end. I too had a doubt whether if once the end point is reached can you go around it. But it seems fine.

17

Yeah… you could go…in any direction till no edge is traced more than twice… and more over you have to start the walk at the “begin”…and you have to finish it with “end”…

18 
1
6
2 -3 -4 4 -6 -3
1 6
try with above testcase
output should be -25
19

Yup… mine is giving -25…
thanks for your reply…