I think it would not have allowed to enter while someone had a coach mode, but 99% that no one had it. By the way, if I am not mistaken, then during the competition my friend turned it on and entered the contest, although it was impossible to do this before(to check error of K) . I have not been to do the same, but there is a possibility that I would not have been able to do it since I was creating the contest and I had a countdown

Thank you for clarifying)) I didn’t know .. I had access

Please explain why you are giving me dislikes = (

Solution to Problem A1 without using the constraint on W:

int was = 0;
was += h[0] * 2 + w*2;
int ans = was % inf;
deque<int> q;
q.push_back(0);
for(int c=1; c<n; c++){
   was += min(xl[c] - xl[c-1], w) * 2; 
   while(!q.empty() && xl[q.front()] + w < xl[c])q.pop_front();
   if(!q.empty())was += max(0ll, h[c]-h[q.front()]) * 2;
   else was += h[c] * 2;

   while(!q.empty() && h[q.back()] <= h[c])q.pop_back();
   q.push_back(c);
   was %= inf;
   ans *= was; ans %= inf;
}
cout << "Case #" << z+1 << ": " << ans << "\n";

Thanks for the advice, I didn't even think about point 1, it sounds like something impossible, but it's definitely worth trying

It's just that this is the only way for us to enter a normal university, and it gives motivation

I like olympiads with contests only, but I don’t want to additionally train for them at the university, since there is no goal to win. Apparently we just have different interests

You are absolutely right, I can’t wait for this opportunity, but I can’t greatly influence it and do it in my free time ..

Auto comment: topic has been translated by Jostic11 (original revision, translated revision, compare)

codeforces returned the rating with percent, it is a success!

You at least got a package)

Add the information to the right to capture the audience.e.

You probably didn’t follow my thought, if this is a cool subtask, then of course, but now it’s like a TREND and there is a chance that the subtask is solved simply

As far as I understand there will be sub-tasks in the round, for me personally this discourages any desire to enjoy the round. Because on CodeForces you can simply not solve a more complex subtask, and at this time people who write a simpler solution will bypass you. Yes, I understand that it may be that the subtask is also solved in a non-trivial way, then such a unit has the right to exist, but as I understand it now, it is necessary to add a subtask rather than an interesting division

with all due respect to the author of the round, this most likely refers to the latest trend

I have this message too. Could it be fake?

Not me yet :(

I had several different greedy solutions, I ran them all, and then I selected the most optimal answer for each picture separately

Of course it will not be possible to hack, but perhaps you can give time =)

(or you need to increase the time to 7 days)

By the way, I didn’t get an error when I tried to leave a comment, but just as if nothing happened after pressing the button (only logging out helped)

Only today I pushed myself with such a problem: if you do a search by name in trainings, enter some contest, and then try to return to the previous page, then nothing happens. The error number is not written, but is it related to this?

It is real to do this, and if this fails, you can always complete tasks after the competition

you can check it on the official techno cup channel

It was)) here even laid out the link, but that comment was deleted

but of course I believe in it too

hahaha and so you want to make unrated for them? Even if the honest will not just write)

but changing the country is so easy

I did not regret that I read) Very cool! Especially with 5 nested loops. I did not know that it is accelerating so much .. And by the way, where is the modulus taken from you and i is simply added, it is written that it is 4 times faster, but then there certainly is no more than 3 to be exact =)

Sorry for the English, it's just the job of a translator))

1500 (max) -> 2000 (max)

In problem D there is also a very simple solution with Dijkstra. We just have to find the maximum answer for 1 vertex and claim that it will be the same for everyone. Evidence: If from the first peak there is the worst way to some other one. Now let's iterate over everything except the other vertex. If one of them is better than the first one to this bad one, then why couldn’t we come first to this one, and then to the bad one? Then we will find a way shorter.__ My code:https://mirror.codeforces.com/contest/1081/submission/47122453

I'm not sure I can explain, but maybe you're wrong. in the analysis told the solution for log (N) (gcd works for log)

I'm 16 and I want to be yellow =)

As for me, this worsened my result by 45, but I totally agree that this is just a rating, but it's not very pleasant either

You can`t re-test only A problem without test with size = 2? I think it would be fair

Sorry, I did not understand correctly what you mean

tree hasn`t got cycles

I also think so, because the complexities were, but for a minute trying to solve a task, I solved it. Sorry for my english =)

oo ok) but (n + (n - 1) - sum) / 2 100% not right... becuse it`s always 0

Can you explain me why this formula works?