OJ Board

Hi!
I tried this problem with algorithm mentioned here: http://www.algorithmist.com/index.php/UVa_10883
which is: ((n-1)C0 * a1 + (n-1)C1 * a2 + .....+(n-1)Cmid-1 * a mid + ... + (n-1)C0 * an) / 2 ^ (n-1)

As we have nCr = nCn-r , so, i just modified the algorithm to this:
((n-1)C0 * a1 + (n-1 ...

Don't know, Its such an easy problem. But, still not able to get AC in it :(
O tries Floyd but, it timed out and now I've tries with BFS but, still no luck. Getting TLE for long time! Please guide me, if any problem is there with my code?
Or, I how can I refine my algorithm ?

Regards,
SITZ ...

Well, You can simply use Floyd-Warshall to get AC in this question, that will suffice for it

Regards,
SITZ

Well, I thought the same way, but, actually it did pass
For ur belief you can check the verdict of judge here : http://felix-halim.net/uva/hunting.php? ... hrivastava

Hi Igor9669 !
But, I don't understand how people can't understand the simple question that I have posted here :(
I said I have got Accepted with a time of around 0.338 s using Floyd-Warshall Algorithm...

I just wanted to ask if the above implementation using queues can be optomized to get Ac or ...

@Shafeet_du : My TLE code (given above) aslo gives the same outputs...
But, can we do it the way I have done it ? Or, not ?

Is the solution really log2(n) as I keep on getting WA applying the same algorithm
Or please provide some critical test cases

Thanx

As I told before... I know that it can be solved by standard graph algorithm and, I have done it too with "Floyd-Warshall" Algorithm.
But, can anyone tell me is it possible to do the same by QUEUE implementation as in my above code ?

And if yes, then where is the problem in my code... It gives TLE ...

Hi All !
I was trying this question from the Brazilian Contest. Though, it seems to be standard Floyd-Warshall Algorithm, I was using simpler queue implementation.
I think my approach is correct, but, getting TLE :( Any reasons for TLE in this code :


#include <vector>
#include <list>
#include ...