OJ Board

I try all case in this thread
but still got WA
Who can help me?

My code as follow Thank's a lot helloneo

Jan,Thank you!
I got AC

First,I use BFS search and pruning to solve the problem
When I submit my code.I got Runtime Error.
I don't know what is worng in my code.
Who can help me to look my code.
Thanks in advance!

I use DP method to solve the problem,but still got WA. Who can give me test data to test my program? Thanks in advance! #include <stdio.h> #include <limits.h> int table[100][100]={0}; int profit[100][100]={0}; int data[100]; int n; int len; void process(){ int i,j,k,min=INT_MAX; for(i=n-1;i>=1;i--) ...

I used set-union to solve the problem but it always got WA My code as follow Who can help me to find the mistake? I find my mistake and get AC! The input data 4 0.0 0.0 1.0 -1.5 -1.5 0.5 1.5 1.5 0.5 -2.0 2.0 3.5 3 3.0 2.0 2.0 0.0 -0.5 1.0 0.0 0.0 2.0 5 -2.0 0.0 1.0 1.0 -1.0 1.0 0.0 1.0 0.5 2.0 0.0 1...

Thanks to rio and helloneo!
I know how to solve it.

I used the same algorithm and got AC with 0.355. I think your implementation of function : number -> coordinate and function : coordinate -> number isn't efficient enough. My step1 & step2 isn't efficient enough. I can't think how to speed it. My method is find the number on which loop then step by...

Who can show me some good idea or algorithm to speed up the problem.
First,I find the the coordinate of the number.
Second,I use the coordinate to find other number.
I use this method then got TLE.
Thanks in advance!

Darko wrote:Try adding EPS to the result before printing. It fixed my solution.

Thank you!
I set EPS to 10^-9 and got AC!

My previous code is accept.
When I submit it again,it got WA.
I don't know what change in the problem.
I test many test data then still got WA.

Does the problem be rejudged?

Thank you!
I got AC!

Does have this input data?

3
Schumacher : 3 min 23 sec 172 ms
Barrichello : 2 min 12 sec 999 ms
Schumacher : 1 min 23 sec 172 ms


is the output as follow?

Row 1
Schumacher
Barrichello

It doesn't use long long to solve the problem.....
I see your method.It doesn't got TLE.
You must to check what step make infinite loop....

Thanks to mf...
I know do this will be very slow.
I just want to know the method is work.