Can we please improve the quality of editorials a bit.. if I am not able to get any clue on how to approach the problem during the contest then I can't just out of the blue understand the editorial with just stating the process rather than helping with some intuition behind the problem.

Problem F editorial was written so badly in abc 380. Other low effort editorials too. Is it just me who feels this?

G is more hard then past G !

This may be a challenging G for its hiiiiiiiiiigh score!

wait why friday?

Really liked the idea of ​​the contest) Spent too much time on E so didn't solve F(

Weak system tests on D!!

My solution passes system tests but fails for this testcase:

4
2 1 1 2

I just need a little bit of hint. Is it possible to do today's E problem E problem using lazy propagation on segment tree?

I tried it and can share code if required, but other than sample none of the test cases is working fine. Should I continue to debug lazy seg tree approach or think in different direction?

Extremely difficult for problem G!

I got 4 Wa on D and 6 Wa on E. :(

for D, why does the following WA? seen makes sure that every character appears exactly twice, each consecutive character is equal and I'm only checking for lengths that are even. Maybe I'm misunderstanding the problem statement in some way?

    auto find_largest = [&](int st) {
        int l = st, r = st;
        std::vector<int> seen(n);
        int ans = 0;
        while (r + 1 < n) {
            if (a[r] == a[r + 1]) {
                if (seen[a[r]]) {
                    // we have to contract the window
                    if (ans < r - l) ans = r - l;
                    while (seen[a[r]]) {
                        // mark the elements removed so they can be used to extend later.
                        seen[a[l]] = 0;
                        l += 2;
                    }
                }
                seen[a[r]] = 1;
                r += 2;
            } else {
                if (ans < r - l) ans = r - l;
                // start a new window
                r = l = r + 2;
                seen.clear();
            }
        }
        return std::max(ans, r - l);
    };
    std::cout << std::max(find_largest(0), find_largest(1)) << std::endl;

The dataset of E too weak that brute force can accept it.

It's suggested to change the dataset.

i think it's quite not proper to put $$$\color{red}{6}$$$ string problem in an ABC.

by the way, the samples were too weak.

ABC is not the writer's amusement park, but one of the ways that the contestants improve themselves, hope to get better ABC next time.

in E
WA $$$-$$$ AC = upper_bound $$$-$$$ lower_bound

AtCoder, if you aren't able to set Gs for programming just remove them.

1122?2024/11/22?

The testcases for problem D were so weak.. so I submitted a wrong solution and got AC.

Hope the upcoming contests have a better testing system.

Editorial for E is missing !!! Is it a technical mistake or intended?

let's use O(N^2) brute forces to pass E!

Can anyone look into this, the submission from rank 1 on problem D, is giving wrong answer on stress testing. Link to Code

Test Case:
6
2 5 5 3 2 3

Correct Answer: 2

But rank1 person's code is giving output 6.

Please keep uploading testcases on dropbox link.

C~F are all very good problems.