Why does this have so many downvotes?

Hope this round can be harder and more interesting than last one. Please do not make standard problems any more!

Wish Atcoder Beginner Contest will not be 「AI Beat Contest」.

By the way, it seems AGC disappeared.

Terrible speedcoder. Took <40min to AK Div 4 in disguise. The last problem is just extra...

If next ABC as shit as this, I will ban you.

maybe we should call this: AI Beginner Contest

it this a AI Beginner Contest?

"Who has better AI" contest

GPT-4o solved A,B,C and OpenAI o3-mini (Free Tier) solved D,E,F, but only 1 participant solved G (until 21:15).

Who can hold a better contest on every Saturday evening?

Our coach orders us to take part in ABC.I want an other contest instead ：(

Oh, maybe G should be used in AHC, not ABC.

ez ac ABCDEF,Im vegeableness

The length of the solution is 30,000 characters!!!It's unbelievable!!!

Update:The problem is G.

How G

Looking at the editorial to G, I wanna kill myself.

Great contest. Upvoted. I have no excuse why I could not solve E and wasted all my time on it. But great problems.

Terrible contest :( I would prefer quality over quantity if this is happening due to more frequent ABCs. Such contests are ruining the overall leaderboard as well.

Why can not we use simplex method to solve problem G?

I haven't tried it yet, has anyone tried it?

I believe G is too hard as an ABC G, but since ARC and AGC both focus on thinking, and AHC shouldn't contain problems solvable in deterministic time, I think it should take place as the hardest problem in an ICPC Contest.

IT SHOULDN'T APPEAR HERE!!!!!!

I solved ABCDE lightning fast lol. Weren't they kind of really easy?

We can classify ABC problems into two categories: 1. Standard / classical (a.k.a trash speedrun AI-friendly problems) 2. PHD level (you may encounter it once in your whole CP-career, not worth learning) In short, both are trash.

how to solve F?

G can easily be harder than an AHC problem

Although I didn't like the contest much, I appreciate the effort on preparing the editorial for Problem G.

On a side note, is it a standard problem if we consider the total cost cannot exceed some non negative integer P (not sure about the bounds) and we can only choose some positive integer x in Problem G.

F!HELP ME!

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5e6+5;
int n,q,a[N],b[N],c[N],dp[N],ans[N];
int t[N];
struct qquery{int r,x,id;}qu[N];
int lb(int x){return x&(-x);}
int query(int x)
{int res=0;for(;x>=1;x-=lb(x))res=max(res,t[x]);return res;}
void update(int x,int y)
{for(;x<=n;x+=lb(x))t[x]=max(t[x],y);}
signed main()
{
	cin.tie(0)->sync_with_stdio(0);
    //离散化a
	cin>>n>>q;
    for(int i=1;i<=n;i++)cin>>a[i],b[i]=a[i];
    int m=n;
    for(int i=1;i<=q;i++)
    {
        int r,x;
        cin>>r>>x;
        qu[i].r=r;qu[i].x=x;
        qu[i].id=i;
        b[++m]=x;
    }
    sort(b+1,b+m+1);
    m=unique(b+1,b+m+1)-b-1;
    for(int i=1;i<=n;i++)
        c[i]=lower_bound(b+1,b+m+1,a[i])-b;
    for(int i=1;i<=n;i++)
    {
        dp[i]=query(c[i]-1)+1;
        update(c[i],dp[i]);
    }
    memset(t,0,sizeof(t));
    sort(qu+1,qu+q+1,[](qquery a,qquery b){return a.r<b.r;});
    int it=0;
    for(int i=1;i<=q;i++)
    {
        qu[i].x=lower_bound(b+1,b+m+1,qu[i].x)-b;
        for(int j=it+1;j<=qu[i].r;j++)
            update(c[j],dp[j]);
        it=qu[i].r;
        ans[qu[i].id]=query(qu[i].x);
    }
    for(int i=1;i<=q;i++)cout<<ans[i]<<'\n';
	return 0;
}

I solved problem D for the first time in ABC!

Can someone please explain the solution for problem E?

AI Better Contest, huh?