although my submission only passed 2/8, and TLE for the rest 6 cases, I entered top 20 for the first time. (TLE is better than WA)
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 uwi Japan 760.00 39 19
14 megaterik Belarus 760.00 102 22
16 hadi Iran 740.00 48 19
17 Amtrix Germany 735.00 20 19
18 lantimilan USA 733.00 75 17
19 chhung6 Hong Kong 732.00 76 19
20 yuke Canada 730.00 39 19
Submissions /
Fairy Chess
# Status Signal Time
1 Passed Your code produced correct output for this testcase. 2.77617
2 Failed Your code exceeded the timelimit for this testcase. 6.00837
3 Failed Your code exceeded the timelimit for this testcase. 9.25258
4 Failed Your code exceeded the timelimit for this testcase. 12.4928
5 Failed Your code exceeded the timelimit for this testcase. 15.721
6 Passed Your code produced correct output for this testcase. 18.9332
7 Failed Your code exceeded the timelimit for this testcase. 22.1734
8 Failed Your code exceeded the timelimit for this testcase. 25.4016
Subscribe to:
Post Comments (Atom)
Hey! I got the same problem with TLE, how did you manage to fix it? :) What is your big O?
ReplyDeleteI was moving a diamond to compute each cell, and keep some moving diagonal sum updated with O(1) amortized time. I think my code is roughly O(1) per cell. with O(1) being about 5 or 6.
ReplyDeleteHi..I was doing the same thing but getting TLE :( ...did you fix it?
ReplyDeleteI have AC on that problem. You probably has some computation that could be folded into partial sums.
ReplyDeleteCould you explain your algorithm more detailed? Thank you very much .
DeleteThis comment has been removed by the author.
ReplyDeleteThis comment has been removed by the author.
ReplyDeleteI am trying to solve this problem now, but am missing the partial sums concept. Can you please give a stronger hint?
ReplyDelete