Why downvotes are in the announcement? don't be a kid!

Hope to solve A, B, C.

Hope to solve A, B, C, D.

Hope to solve A, B, C, D, E.

Hope to Solve A, B, C, D.

GOD BLESSING ME!!!

Hope to solve A,B,C.

HOPE to solve A....This is my first atcoder contest ;}

Hope to solve A to D.

Why can't I pass problem D!!! The contest will be finished in 18 min!

Bruh, C was so annoying. Solved D in like ~10 minutes, but wasted so much time thinking for C :<

what is mistake in my code for D

https://atcoder.jp/contests/abc320/submissions/45643786

Well, I spend 30 min to understand what C was saying!

Task G it seems flow without any optimization passed.

can anybody please tell me a counter test case for C problem according to my code. or where my logic is wrong?

ll n; cin >> n;

    string s1, s2, s3; cin >> s1 >> s2 >> s3;

    

    map < char, vector < ll >  > mp1, mp2, mp3;

    for(ll i = 0; i < sz(s1); i++)
    {
        mp1[s1[i]].push_back(i);

    }

    for(ll i = 0; i < sz(s2); i++)
    {
       mp2[s2[i]].push_back(i);

    }
    for(ll i = 0; i < sz(s3); i++)
    {
        mp3[s3[i]].push_back(i);
    }


    ll mn = LLONG_MAX;
    for(char i = '0'; i <= '9'; i++)
    {
        for(auto x : mp1[i])
        {
            for(auto y : mp2[i])
            {
                for(auto z : mp3[i])
                {
                    if(x != y and y != z and z != x)
                    {
                        x %= n, y %= n, z %= n;
                        ll mx = max({x, y , z});
                        mn = min(mx, mn);
                    }
                }
            }
        }
    }
    if(mn != LLONG_MAX)
    {
        cout << mn; return;
    }

    ll got = 0;

    for(char i = '0'; i <= '9'; i++)
    {
        if(sz(mp1[i]) > 0 and sz(mp2[i]) > 0 and sz(mp3[i]) > 0)
        {
            got = 1;
            break;
        }
    }

    if(got == 0)
    {
        cout << "-1";
    }




    if(s1 == s2 and s2 == s3 and s3 == s1)
    {
        cout << n; return;
    }

Nice C. I did not thought of direct simulation. I thought to fix one string, find i th char in other two strings. Equal index in all 3 ,in one of 2 strings and not euqual indexes, all those cases just made my implementation harder.

Equal Numbers,alphabets,indexes,maximms,minimums are the tools to make question harder and sometimes even annoying if you handle it in wrong way

Me wasting 40 minutes on C not realizing there were only 3 slot machines. :(

Problem C, remains me I am still not good at logical thinking

For $$$C$$$, You can just make 3 consecutive copies of each string ($$$S_i =S_i + S_i + S_i$$$).

Try every digit[0:9] and if you found 3 different indices have the same digit, minimize the maximum index with the answer . Code : 45651190

can somebody tell me why i am stuck in problem D

https://atcoder.jp/contests/abc320/submissions/45651936

in the editorial of F: in the fourth case we need to iterate right? so how the complexity will stay O(n^3) ? https://atcoder.jp/contests/abc320/editorial/7169

Sub AtCoder it locked my account without any email or notice.

fu!

The data of question C is suggested to be strengthened

this is the hack input

8
12221222
13313331
44414414

answer:

4

Output the wrong answer '6' but accepted code. https://atcoder.jp/contests/abc320/submissions/45625948

This hack can block some greedy algorithms, including me.

Whats the mistake in my code for Question E? https://atcoder.jp/contests/abc320/submissions/45637747

I can't understand the C problem. Why the answer of testcase:

20 01234567890123456789 01234567890123456789 01234567890123456789

is 20? can't we just stop at 0 seconds so all reels show 0?

Edit: nvm, I got it, he can press only one button at any given second.

For problem G: (1) (2)

The (1) code shows about 7 times slower than (2) for test 5, and it gets TLE. (2) is AC, and the difference between (1) and (2) is the way of adding the element to the b array: for (1), i use (line 135 to 141)

        for(int i=1; i<=n; i++){
            int cur = 0;
            while(b[i].size() < n){
                b[i].push_back(b[i][cur] + m);
                cur++;
            }
        }

for (2) (line 134 to 137):

            int ts = tmp.size();
            for(int k=0; k<n; k++){
                b[i].push_back(tmp[k % ts] + m * (k / ts));
            }

Why is (1) so slow? Very thanks!