OJ Board

Yes, DP works fine. Nice problem, enjoyed solving it at the contest.
I wish we had such nice problems in my region.

I considered the 1st, 3rd...(odd numbered) boards and 2nd, 4th.. (even numbered) ones separately as Jhonny's and Maria's boards respectively and processed them one by one. For any board I precalculated the its result with 'X' as the first player and 'O' as the second, so incase of Maria's board I ...

Imagine an ICPC Regional contest going on with a ranklist showing only which team solved how many problems and no other information about which problems are being solved by which team or when or anything else. And at the end of the contest you figure out that one of the easiest problem remained ...

"3 Ghz = 3 billion operations/second" is not a correct interpretation, it should be 3 billion cycles/second and it is the system's clock speed but not all operations necessarily take 1 cycle, only the very basic operations can be done in a cycle but the operations that we do in our codes (mod or ...

Never Mind got AC!

I have passed the given test cases but still WA.

Can someone please verify my outputs for the following cases.

Input: My Output: Thanks in advance.

sorry i forgot to login...

I think I'm missing something in this problem. I saw dozens of people solved it in online contest but I find the problem unclear.

The enemy ships are pretty dumb, so that they will always move to the closest position they can get to you, ...

Consider the following situation at some portion of ...

I think you've partially posted your inputs because the last 7 outputs you've posted corresponds to the 7 inputs but the 1st 4 inputs are missing. The inputs that you've posted here produces the correct output (i.e. the last 7 outputs are correct for your 7 inputs).

I can't remember exatly whether ...

Can someone please give me a good idea to solve this problem in a compact way? all I can think of is pretty complicated and I don't feel confident that they will be accepted.

Thanks in advance

long ago i tried to solve this problem and got several WA and now again when i'm trying fresh its all the same.. WA :(

so i'm posting my code and hope someone will point out a test case that it fails...




#include <stdio.h>
#include <math.h>

const long double pi=3 ...

I don't see why someone needs to use the stl map. stl set is good enough for this problem I think.

I am afraid stl set isn't fast enough for this problem. I did a simple bit of hashing to get AC with a poor timing (7 sec). May be I'll try something better later on for a better timing.

Hello Admins,

Please update the contests summary ranklist at:

http://acm.uva.es/contest/summaries/summary05.html

Thanks you.

We can easily speed up the multiplication process... ie, d^3 can be reduced... think about it.

I don't think so. Actually during the contest I was really surprised with the 2 sec timelimit because I couldnot think of a solution that would run so fast at OJ, so I mailed a clarification and then later all the solutions were rejudged with increased timelimit but again this time due to the "900 ...