Let me introduce an experience to you. "The point values" are generally mentioned in the announcement. You can see that those with a big gap are very difficult. Usually, the difference between E-F-G is smaller. It looks normal this time.

(Maybe F will be a little more difficult this time.)

81 years ago ...

Hope I'll solve F/G again. Can I fly?

fuck,my classmate use my own account!

In the last contest,I only solve A to D.And I want solve 5 problems this time.

Wait, I think I need to give a quick heads up for some people

We know what day it is today. Don't send things like that or flood the comments pls.

This should be a place for discussing problems, not for stirring up ethnic hatred OK?

Hope no one talks about nationalism in today's discussion. Avoid that pls.

Please don't post any extreme nationalist comments, and don't forget how many people got heavily downvoted last December 13.

Please note that Codeforces is NOT a website for political discussion.

I hope I can solve F.

Wish everyone can AK ABC!

Please don’t vote before the contest starts

I hope I can solve E and F.

I AK IOI

If you believe that this time, the ranking of the difficulty for these questions is correct, DOWNVOTE me.

Do not publish content unrelated to algorithms/data structures on CodeForces.

qwq

Chinese Can Fly.

I hope I solve A,B,C,D,E.

Hope I can solve at least five problems and improve my AtCoder rating.

I was wrong,I'm sorry for that.

Chinese people can fly!!!

I am a beginner in OI, so I hope I can solve A, B, and C in this contest. Good luck to everyone!

QP

Good luck and have fun everyone!!!!

Today is August 15th, and many Chinese people know what day it is. World peace is everyone's desire. But I don't think it's correct to send relevant content on atcoder, not to forget national humiliation, rather than to provoke ethnic conflicts. This is just a programming website, it just holds ABC on Saturdays as usual, and you obviously shouldn't provoke ethnic conflicts and ethnic opposition here. Extreme nationalists have almost achieved it.

the discuss of ABC is in CF? So crazy

i m chinese ,i can fly !

Hope i can solve ABCDEF

Thanks to my teacher,I need to leave at 9:10 p.m. But I must solve A-E. What can I say?

I hope I can solve A~D.

Accessing AT is very stuck now, and there may be some obstacles.

I hope I can solve ABCDE.

In spite of the fact that it's August 15th, the 81st anniversary of Japanese invasion, world peace is what we all like and AtCoder just provides a programming contest as usual. No ethnic nationality bias should appear. Takahashi does not do anything wrong.

I want gold perf! I want blue name!

I solved A, B, D so far

D is so easy, isn't it?

Good problems, ran out of time solving $$$F$$$ :(

bruh WA on 1 test case...

Man, I was stuck on C... can anyone explain how to solve?

Solution discussion: https://www.youtube.com/watch?v=mL5MxaOwdo8

Why so many NTT?

Why this is not working ??? for Problem D got wrong at some hidden test cases

void Solve(){
    ll q,v;cin>>q>>v;
    priority_queue<pair<ll,ll>>maxx;
    while(q--){
        ll t,w;
        ll que;cin>>que;
        if(que==1){
          cin>>t>>w;
          if(!maxx.empty()){
            ll x = maxx.top().first;
            ll y = maxx.top().second;
            ll ele = x + abs(y-t);
            ele = min(ele,v);
            if(ele > w){
                maxx.pop();
                maxx.push({ele,t});
            }
          }
          maxx.push({w,t});
        }
        else{
            cin>>t;
            if(maxx.empty()){
                cout<<-1<<"\n";
                continue;
            }
            ll x = maxx.top().first;
            ll y = maxx.top().second;
            ll ele = x + abs(t-y);
            cout<<min(v,ele)<<"\n";
            maxx.pop();
        }
    }
}

What's the difficulty of ABC today?

F is so dirty and G is an NTT template.

Well, I think F do not fit very well in ABC.

Can You please tell me for which case it is failing for Problem C

https://atcoder.jp/contests/abc471/tasks/abc471_c

// This is code
#include <bits/stdc++.h>
using namespace std;
#define ll long long

void solve()
{
    ll n;
    cin >> n;

    vector <int> lw, rw;

    ll l = 0, r = 0;
    
    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;

        if (x < 0) 
        {
            lw.push_back(x);
            l++;
        }
        else 
        {
            rw.push_back(x);
            r++;
        }
    }

    lw.push_back(-INT_MAX);
    rw.push_back(INT_MAX);

    ll ini_pos = 0, g = 0, h = 0;
    ll ans = 0;

    sort(lw.rbegin(), lw.rend());
    sort(rw.begin(), rw.end());

    while (g <= l || h <= r)
    {
        ll ld = abs(lw[g] - ini_pos), rd = abs(rw[h] - ini_pos);

        if (g < l && ld == rd)
        {
            ini_pos = lw[g];
            ans += ld;
            g++;
        }
        else if (g < l && ld < rd)
        {
            ini_pos = lw[g];
            ans += ld;
            g++;
        }
        else if (h < r)
        {
            ini_pos = rw[h];
            ans += rd;
            h++;
        }
        else break;
    }
    
    cout << ans << endl;
}

int main()
{
    int t = 1;
    // cin >> t;

    while (t--)
    {
        solve();
    }
}