I wasted so much time optimizing this. Post-contest, my friend showed me their brute force got AC. Absolute pain.

int cntOne = 0, cntTwo = 0, cntThree = 0;

        bool cond = 0;

        for (int i = 0; i < n - 2; i++)
        {
            if (arr[i] == 1)
                cntOne++;
            if (arr[i] == 2)
                cntTwo++;
            if (arr[i] == 3)
                cntThree++;

            if (cntOne >= cntTwo + cntThree)
            {
                int One = 0, Two = 0, Three = 0;
                for (int j = i + 1; j < n - 1; j++)
                {
                    if (arr[j] == 1)
                        One++;
                    if (arr[j] == 2)
                        Two++;
                    if (arr[j] == 3)
                        Three++;

                    if (One + Two >= Three)
                    {
                        cond = 1;
                        break;
                    }
                }
            }

            if (cond)
                break;
        }

        if (cond)
            cout << "YES" << "\n";
        else
            cout << "NO" << "\n";

seems like an n^2 solution to me, but it got ac. Can anyone explain why ?

I saw some people solving B using just brute force, and I don't know why it works!

ios_base::sync_with_stdio(0); cin.tie(0); for not adding this I think

Dear Codeforces team,

I am appealing the skipped verdicts on my submissions for both Problem A (Add or Xor) and Problem B (Line Segment) in Round 1035 (Div. 2). I want to clearly state that I did not cheat, collaborate, or share my code with anyone. Below is a detailed explanation of my approaches and supporting context:

Problem A (2119A – Add or Xor): The task is to transform a to b using +1 (cost x) and XOR with 1 (cost y) at minimum cost. I modeled this as a shortest path problem, where each integer is a node and operations define the edges with associated costs. This directly maps to Dijkstra's algorithm , I used my own Dijkstra template, which I regularly use in contests.

My code uses a priority_queue and visited-distance tracking, and I limited the state space to a fixed size. I now understand that many others independently arrived at a similar Dijkstra solution, which likely caused this mass flagging. But the logic and template used are part of my personal style, not copied from any contestant.

Problem B (2119B – Line Segment): My approach for this problem was if the actual dist is in between the max dist from the source and min dist from the source then we can reach the terminal point so It would say Yes else No.

This approach was derived independently during the contest . It's a clean mathematical solution and not something I copied. And my code style is always the same .

I kindly request a manual review of my submissions. I understand the difficulty of handling mass similarity cases, but I hope my explanation clarifies that I competed honestly, with my own logic and coding style.

Submission IDs:

A:327563324

B:327606925

https://codeforces.me/contest/2121/submission/327441927

for which test case is this failing? can anyone help me figure it out?