All of teams from China has been blocked by covid-19.

God and his toolmen is shanquan2 ,me and someone I forget his codeforces ID

Our team won't go to wf2020

I think D's O(nlogn) solution is very interesting, but unfortunately std is O(n^1.5)

I guess that the std of D is O(n^1.5) . (because of so large time limit)

I calculate that 119+23+5+1=153 during the contest. It caused this problem to waste me a lot of time.

I directly calculate the total answer of all situations by Dp.And finally output .I dont know why double is work,but it accept.

My solution of problem D is O(n^3) and only use double，I dont know why it can accept

Could you please change Skydec to SkyDec? QAQ

I think some coders will get runtime error if r>n

For description of DIV1 E. I think you should let (1<=l<=r<=100000) be (1<=l<=r<=n)

My code for Div1 Hard is O(max(2^S*n,2^(n-S)))

I set S=28,And then I failed system test

After contest I set S=27 and I have accepted it

Good Game

I think you put wrong problem statement at http://codeforces.me/gym/101194

By the editorial we can prove that we only need to consider the top log(a_i) number。 We didn't find it before contest. I'm very sorry.

Yes

Auto comment: topic has been updated by SkyDec (previous revision, new revision, compare).

Sorry,I don't want to participate in finals. And I am the same grade as matthew99,so I am ineligible.

Team China is colorful :)

no jb.just jabby

I spend very much time understanding the meaning of Problem B.QAQ

The first round in 2015 :)

I thought you want to hack the task C(DIV1) using bit?

it's already 15:40 :(

The data of Problem E is too weak 7644499 The time complexity of his algorithm is O(q*height) Why can he accept?