lol just asking but, are there problem statements for those who didn't participate, or any judge to submit on? Thanks.

Hi, a while ago, I saw that the contest contributors have published the editorial on the website, however it seems like now whenever I try to access the website it says "502 bad gateway" (it has been like this for a few days already).

So is there anyone who has previously downloaded the editorial and willing to share, as the website has been down for quite some time already, and I'm not sure when it'll be fixed lol. Thank you in advance.

Hi do you know where we can test solutions to the contest problems? As far as I know, the cms judge is down after the contest. If not, do you know where to find the test data? Thank you. :)

No lol, my query function was something like a pointer based one.

Here's an outline of what i did: https://ideone.com/ormfB2

Thanks.

does link-cut work with treap, instead of splay?

lol tbh make video editorials for JOI problems, since most of them don't come with english editorials, ur videos will be very helpful for some of us :)

Also why does the scoreboard only show people who did session 2 of the contest lol. XD

When I click the contest information page link, I see that Round 2 is 16:00 JST but that does not seems to match ur 08:00 GMT timing. Maybe there was a mistake with the timing?

Update: I have noticed that the contest information page has changed the timing to 07:00 GMT, which now matches the 16:00 JST, but the timing at this cf blog still indicates 08:00 GMT? ._.

Hi, when I clicked on the problem link, I got the pop-up message: "You are not allowed to view the contest". Maybe u made a mistake with the links?

TheRealLeviAckerman Not really, u may have missed out the case where 0 < x < 1 (like for e.g 0.5, which is possible given the constraints), where log(log(0.5)) will bring an imaginary number and complicate things.

Hi nocriz, do u know whether there are editorials for the CTS 2019/NOI 2019 problems on www.uoj.ac? If yes, where can i find them? Btw thanks for providing all the links above :)

Err, the limits of A,B and C are way too big to be computed like this lol. (Read the qn again i guess).

Oh, then Kaban-5 are u allowed to describe just that problem or something? rather than sharing the whole editorial? If not is someone else able to give some other problems which utilises the trick? or at least describe some common scenarios in which this can be used? Thanks in advance, sorry for the trouble.

Hi Kaban-5, may I ask which question was that, which u learnt the trick from? Thanks in advance :)

Just wondering but will the pointer method be slower than adding an offset manually, like for example if u access the array many times? Because i heard pointers take up more time, so yea just curious. Thanks in advance.

Have the test data been released? Charis02

BOI has editorials.

Ok thanks, at least there's some.

hi harniver may i ask if problems will be available after the contest? So people can upsolve or something? Thanks :)

Are variables in namespace initialised to 0 for c++? Thanks in advance.

Hi, can anyone who have solved d3p3("Bitaro who leaps through time") please describe ur solution? Thank u.

Hi, I was trying to upload mergers from day 4 to my country's online judge, but when i downloaded the input there were a few input files like "0123.txt", does that mean that I should put this input file in multiple subtasks or something? Can someone help pls? Thanks :)

[Edit: Solved]

Btw, one can achieve Q log N, with a segment tree trick as well. So instead of binary searching then querying ur segtree, one should "binary search" inside ur segtree.

Brief description:

for each range store ur min value

if the min value of our whole range is > x (we will just return R+1 signifying that no such index exists.)

then when ur at a range, u can decide to either go left or right.

So if the min val in left is <= x, then we can safely go to left. Else we go to the right.

(C++ code will look something like): http://ideone.com/2onLzj

Do u still do virtuals on school days? Or just solving in analysis?

Can anyone pls explain why for F, the answer is number of subsegments of length k, 2k, 3k ... ?

Shouldn't it be k, 2k-1, 3k-2...? Like for example in sample input 1, there are 1 subsegments of length 2 and one of length 3. when k=2.

Thanks.

Hi E869120, I know there usually isn't much math in ioi questions, but there usually are some in our national selections. So is atcoder or topcoder better at practising math questions, that will help? Which do u recommend? Thanks :)

hmm the inc part looks like point update to me? R u sure that's range update?? Like by range I mean for e.g. (a,b) to (c,d), for a<=c && b<=d.

How early does your school end to be able to practice 7-7.5 hours?

Wow how many hours do u sleep a day to be able to practise that hard E869120?

But isn't this the same as the code I provided? Since the while grid[i][j] != expected input I will do another getchar? Thanks.

How about problems tagged "dp", I mean, dp is quite common in ioi too right? lol

Is there a reason u choose to use Kosaraju instead of Tarjan? Also can Tarjan be used in this case? Thanks! :)