As a tester, I observe that the problems were prepared by a tsundere and a chuunibyou, which certainly does make a combo for preparing rounds.

P.S. look at their profile pictures :)

I wish we could have a

When the score distribution will be updated?

Please make a note about unusual contest starting time also.

I'm waiting for score distribution too.

Score distribution?

Will round be rated?

Been training myself to wake up at 4:30 am for next 2 rounds. Can't wait to drop back to purple.

Sorry to ask, but does the scoring distribution indicate the toughness of the problem? I've never really paid attention to this.

rated?

This is the first time I see the starting time of contest is 6 hours earlier than usual contest

ABC would seal the deal for many of us.

6 problems, 3 hours. seems hard contest

The score distribution suggests that this contest will be good for fast solvers. Many users will solve three problems, and the fourth one will be critical, as it has a 2250 score, so those who solve the first three fast will be in a better rank.

Best of luck to all(me included).

just 15k people?

Why no extra registration?

the questions were terribly worded!!

wat the fox with the statement of problem B in div 2? terrible

bro i am not able to understand B. The explanation is really bad...

i want to know if it is allowed to use chatgpt to provide a clear problem meaning during the contest, so that i wont waste so much time reading in B and C

problem b is L

I can't understand the problem statement, it's a terrible experience.

Is it only me or the questions are terribly written?

I understood B after 60 minute.... Dont know how to solve! :(( after asking them 4 questions too. I am crying

I think my english comprehension skill have been dragged through the mud today.

RIP people from div. 2

Also post a separate editorial on how to comprehend these questions.

Уничтожить учетную запись DocinhoS is cheater. skipped: https://mirror.codeforces.com/submissions/DocinhoS/contest/2070 Strange submission from edu round: https://mirror.codeforces.com/contest/2043/submission/298277798 and there are more like this. Suspicious submission times today. Ban account.

problem b is cooked... still can't understand what it is trying to say...

It took me an eternity to understand the language of div2 B problem but just a minute to write the code for it : (

Problem B was hell. Took 1 hour to understand and 3 min to code.

LanguageForces

It is so challenging to understand problems B & C. Problem statements are not clear and example explanations are poor. It took me a significant amount of time to comprehend how the samples produce the specified results.

UnderstandingForces ... spent time understand what is happening in B

that also made me overthink and difficult in C to understand

oh no.. I found problem E tempting and wasted all my time there ...and I didn't attempt D

I thought E was some diophantine equation kind of thing, but couldn't fully solve it :P

text-understanding-speed forces

In problem Div2C, how its possible for Vadim to guarantee success in testcase-3?

Div 2 problem B was a nightmare. I was using a static version of this website and did not see the post on problem B until I logged on to the main page, costing 1 hour and 30 minutes of contest time to be lost. I hope that next time the authors can put a little more time into making these problems, and clearly explain the ambiguity on the problems before the contest starts, thanks.

how to solve D? I tried making a graph that only included cells belong to at least 1 path, but wasn't able to calculate the answer from the graph

Add a new tag named Reading.

Bro what did I do in recent 3 hours :(

Wtf is 1C 1D?

if problem doesn't seem hard enough make problem statement harder to understand. simple :)

My solution for failed on 4th pretest..I am storing the frequency of every element and sorting them in ascending order then I am checking the frequencies of consecutive elements.. Am I missing any other cases here?

void solve(){
    int n;
    cin>>n;
    vector<int> a(n);
    for(int i=0;i<n;i++) cin>>a[i];

    map<int,int> mp;
    for(int i=0;i<n; i++){
        mp[a[i]] +=1;
    }

    vector<vector<int>> cnt;
    for(auto it: mp){
        cnt.push_back({it.first, it.second});
    }

    int m = cnt.size();

    for(int i=0;i<m;i++){
        if(cnt[i][1] > 3){
            cout<<"YES"<<endl;
            return;
        }

        if(cnt[i][1] >= 2){
            if(i+1 < m && cnt[i+1][0] == cnt[i][0]+1 && cnt[i+1][1] >=2){
                cout<<"YES"<<endl;
                return;
            }
            if(i+2<m && cnt[i+2][0] == cnt[i][0]+2 && cnt[i+2][1] >= 2){
                cout<<"YES"<<endl;
                return;
            }
        } 
    }

    cout<<"NO"<<endl;
}

Worst Div2 B,C in recent times

Worst contest which I gave till now!

In question C (Div 2) for input — 5 2 2 3 4 4

could some tell me what would be the output ?

problem C was way easier than B. but it had many cases to consider, i cant believe i submitted 5 time.

got WA on i'th pretest on i'th submission for 1<=i<=4. and finally AC on 5'th. lmao

What a bad description

Insanely quick system testing

Also, does anyone think problem A is weird for only having 1 pretest

This night contest and the last night contest were both so bad. Everytime I do one, I wish I just went back to sleep

Absolute bad problem description for B!! Please do something to fix this in future rounds.

Why does sorting and calculating ranges based off medians if the all windows of size $$$n - k$$$ not work?

problem statements for both b and c were really vague, on top of all of that, 2d and 2e had a really large gap both difficulty-wise and knowledge-wise. talking to someone who solved 2d, I didn't even know some of the things(e.g. gaussian elimintaion). I had a solution for e using some magic with crt (i don't know if it even works), still geometry&crt for a 2e is too much in my opinion.

.

Do you really like geometry and linear algebra?

please all downvote this contest

Edit:Task achieved

how to solve D ?