Comments
0

Div1 C is identical to a problem on SPOJ 3 years ago which requires a O(qlogn) solution. It seems that many guys just submitted their SPOJ code to get over this prob lol.
On UESTC_Nocturne → Codeforces Round #201, 13 years ago
0

Since b is no longer always zero, there are more necessary tricks to avoid getting TLE.
On UESTC_Nocturne → Codeforces Round #201, 13 years ago
0

No,most (a-b) log n program written in java got AC.
0

suppose b=1, all x[i]>a, what will happen?
+5

Actually our standard solution to C is O(b-a+n). O(b-a+n),O(b-a+nlogn),O((b-a+n)logn) are all able to pass during the test.
On UESTC_Nocturne → Codeforces Round #201, 13 years ago
+3

There exists a subtle O(a-b+n) solution.Even written in java would get accepted.
On UESTC_Nocturne → Codeforces Round #201, 13 years ago
+3

each time choose such x_i that makes a-a%x_i minimal and a-a%x_i>=b. the correctness can be proved by the monotonicity of your dp function.
On UESTC_Nocturne → Codeforces Round #201, 13 years ago
0

it seems lots of people FST in problem C. :)
On MinakoKojima → Codeforces Round #183, 13 years ago
+7

an O(n^2+ans*k^2+a_max ln ans) solution was expected.
On MinakoKojima → Codeforces Round #183, 13 years ago
+57

xiaodao's photo there >_<
On MinakoKojima → Codeforces Round #183, 13 years ago
+5

Actually they should be in Chinese..:)
On MinakoKojima → Codeforces Round #183, 13 years ago
+8

I think the problemset is easier but much more interesting this time..
On Seter → CF #172 Div1 E Editorial, 13 years ago
+13

It's a subtle solution! But its O(nlogn) implementation seems to be a little messy...
On Seter → CF #172 Div1 E Editorial, 13 years ago
+3

GJ.nice translation
+16

why sevenkplus.com ..?

"Task D is a standard data-structure problem hidden behind a classical DP model."=> "Task D is a standard data-structure problem hidden behind a classical maximum cost flow model."
On MinakoKojima → Codeforces Round #172, 13 years ago
+8

actually in standard solution,it takes O(logn) per update,O(klogn) per query. So limiting the sum of k to 10^5 would be ok.
+27

it's my (and Seter roosephu) first CF round.We wanted to make it perfect. CF is not OI which encourages one to cheat for scores.i don't think a ACTUALLY WRONG solution should get accepted in system test. contestants hack others' submissions to point out others' mistakes and get scores as a reward. when there is a wrong submission but nobody can hack it,we problem setters do have the right to execute it.

Anyway,Jacob is the hero of the contest..
On MinakoKojima → Codeforces Round #172, 13 years ago
0

Actually during the contest,only liouzhou_101 got AC. not too bad..
On MinakoKojima → Codeforces Round #172, 13 years ago
+9

tutorial for 1C,1D and 1E in Chinese https://www.13331.org/420.html
On MinakoKojima → Codeforces Round #172, 13 years ago
+10

it's my fault... better to say my heart trouble..?
On MinakoKojima → Codeforces Round #172, 13 years ago
0

1D's TL should have been 3s..Then the obvious O(k^2logn) solution would get TLE.
On MinakoKojima → Codeforces Round #172, 13 years ago
+15

it seems i am the only one holding a yellow handle among all the problem setters..lol