Thursday, February 16, 2012

truly amazing, am now 14th

Rank Hacker Country Score Submissions Solved
11 diogoaos Brazil 811.00 55 21
12 liangjiaxing Canada 778.00 50 19
13 jin.ubc Canada 763.00 42 20
14 lantimilan USA 761.00 78 18
15 uwi Japan 760.00 39 19
15 megaterik Belarus 760.00 102 22
17 hadi Iran 740.00 48 19
18 Amtrix Germany 735.00 20 19
19 chhung6 Hong Kong 732.00 76 19
20 yuke Canada 730.00 39 19

Fairy Chess cpp 2012-02-16 14:10:49 Processed Accepted View Details
Fairy Chess cpp 2012-02-16 14:03:34 Processed Wrong Answer
0/8 testcases passed
View Details
Fairy Chess cpp 2012-02-16 13:37:18 Processed Wrong Answer
5/8 testcases passed
View Details
Fairy Chess cpp 2012-02-16 11:49:12 Processed Wrong Answer
2/8 testcases passed
View Details
Fairy Chess cpp 2012-02-16 11:48:07 Processed Wrong Answer
1/8 testcases passed
View Details

1 comment:

  1. Hi, I have thought about the Fairy Chess for quite a long time. And I found it difficult to lower the time complexity from O(n^4) to relatively reasonable O(n^3).So can you share your trick to deal with the problem.

    ReplyDelete