Is multiple file submissions planned?

I don't like scrolling to find where I put a function.

I know __float128 is supported by most of the 64-bit compilers but is there a way to use the quad precision functions like sqrtq, absq and similar? Also printing with high precision is complicated I guess.

Why can't editorials be already prepared before the round even started?

Can someone explain or prove, why calculating all possible values for every interval doesn't get TLE?

I think it should be $$$O(n!)$$$.

My solution.

Problem link.

How often does someone get the same place in IOI two times in the row? (except winner like Benq)

I was solving this task: https://oj.uz/problem/view/IOI17_mountains. The first submission got 20 points (brute-force using bitsets). The second submission got 70 points because I used memoization. After that, I wrote my own bitset with custom hash and got 100! Can someone suggest why the number of different bitsets is $$$O(n^2)$$$?

I was solving this problem and after I solved it by myself I decided to implement editorial's solution. Strangely my first submission was really slow 55982450, but after changing the order of dimensions it got 5x faster 55999256.