## Search found 6 matches

Sun Mar 19, 2006 12:12 pm
Forum: Volume 110 (11000-11099)
Topic: 11012 - Cosmic Cabbages
Replies: 29
Views: 8956
This problem is not so difficult. Once you got a simple idea, you can make out a linear algorithm. Another Hint) The manhattan distance between (0, 0) and (2, 3) between (0, 0) and (3, 2) between (0, 0) and (5, 0) ... is same. It is clear how to calculate the distance between two cabbages. Can you ...
Wed Mar 15, 2006 12:25 pm
Forum: Volume 110 (11000-11099)
Topic: 11000 - Bee
Replies: 25
Views: 12237
Yes, I got AC. I saw the problem after seeing this post so my thoughts were pretty biased. It was trivial.
Tue Mar 14, 2006 9:45 pm
Forum: Volume 110 (11000-11099)
Topic: 11000 - Bee
Replies: 25
Views: 12237
Is it really?
Sun Mar 05, 2006 8:14 am
Forum: Volume 110 (11000-11099)
Replies: 9
Views: 3195
Thanks that got me AC
Sat Mar 04, 2006 10:23 pm
Forum: Volume 110 (11000-11099)
Replies: 9
Views: 3195
Yes, I used the same method.

But ofcourse the max values of N = 3000 and PP = 100, hence this method gives a complexity of O(n*n*PP) which is too slow to execute within the 3 second time limit.
Sun Jan 29, 2006 10:30 am
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21329
Your code is wrong. Consider the following testcase:

100
45
46
47
48
49
11
1