Hi there. I've been trying to solve http://www.spoj.com/problems/AKBAR/ for some time, but the only thing I can seem to come up with is starting a BFS from each of the soldiers as the source until the soldier's strength depth. However, that approach gives me a TLE. Any help regarding how to solve this problem would be appreciated. Thanks.

Here's the code for my approach that I tried (TLE): https://gist.github.com/paramsingh/81d728295e6bd01860a0

say ALLAHU AKBAR and problem will solve itself.

Making FUN with one's

Religionis not funny :)RVyrodov You are a cheap minded person. You can't have fun with other religions. It is a very bad habit.

okay.. say OLA hu UBER and it will take you ur solution destination :p

using memset in lines 39+40 gave you the TLE

you don't need to do it for every soldier, if any city is previously visited by another soldier, then the flag turns false...

remember that "every city is protected by one and only one soldier.According to Akbar , this is the optimum placement."

if you need more help, just tell me ^_^

Oh man, that was a really stupid mistake! Thanks a lot for the help, I've got it accepted now.

:)

can you help me with that TLE I'm unable understand above explanantion for AKBAR — Akbar , The great(spoj) problem

Can you please tell me how to resolve TLE in this code http://ideone.com/ljgRhi ?

rghv same mistake:

using memset in line 42 gave you the TLE

you don't need to do it for every soldier, if any city is previously visited by another soldier, then you should return false...

remember that "every city is protected by one and only one soldier.According to Akbar , this is the optimum placement."

Thank you.

what is wrong in my soluton for AKBAR? https://ideone.com/AonT8k

I didn't even read a problem's statement, but by just looking to your code, I see some not reliable things...

You should write:

`for (it = adj[s].begin(); it != adj[s].end(); it++)`

And since you don't need iterator, You better use:`for (int value : adj[s])`

ROIgold it did'nt make any difference.now?

nice

Can you please help me? I'm getting WA in this problem.

My code: here

Hey, I also used the same approach and getting TLE. Here's my code http://ideone.com/ljgRhi. Any help would be appreciated.

.

I have been trying the question for a day now. Can someone please tell me what is wrong in this solution? I don't want to put up a blog about this. So whoever sees this comment please help me. I would really appreciate it.

Try these changes maybe:

Yeah, it worked. I also understood my mistake. Thanks a lot for your help.

Can someone please see my solution. I'm getting a WA. This is the link https://ideone.com/hnGtXy

Hey I am getting TLE in this problem; here is my code: HELP PLEASE!

please help me with the same problem, why my solution getting WA??

MY_Solution