oj.uz

Submission #933029

# Submission time Handle Problem Language Result Execution time Memory
933029 2024-02-24T22:06:17 Z Edu175 Sequence (APIO23_sequence) C++17
53 / 100
 2000 ms 67232 KB 
#include "sequence.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,apio=b;i<apio;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) for(auto slkdh:v)cout<<slkdh<<" ";cout<<"\n"
using namespace std;
typedef int ll;
typedef pair<ll,ll> ii;
const ll INF=5e6;
struct node{
	ll mxp,mnp,mxs,mns,sum;
};
node oper(node a, node b){
	a.mxp=max(a.mxp,a.sum+b.mxp);
	a.mnp=min(a.mnp,a.sum+b.mnp);
	a.mxs=max(a.mxs+b.sum,b.mxs);
	a.mns=min(a.mns+b.sum,b.mns);
	a.sum+=b.sum;
	return a;
}
node NEUT({-INF,INF,-INF,INF,0});
struct STcustom{
	vector<node>t; ll n;
	STcustom(ll n):t(2*n+5,node({0,0,0,0,0})),n(n){}
	void upd(ll p, ll v){
		p+=n;
		t[p].mxp+=v,t[p].mnp+=v,t[p].mxs+=v,t[p].mns+=v,t[p].sum+=v;
		for(;p>1;p>>=1)p^=p&1,t[p>>1]=oper(t[p],t[p^1]);
	}
	node query(ll l, ll r){
		node izq=NEUT,der=NEUT;
		for(l+=n,r+=n;l<r;l>>=1,r>>=1){
			if(l&1)izq=oper(izq,t[l++]);
			if(r&1)der=oper(t[--r],der);
		}
		return oper(izq,der);
	}
};
const ll C=5e5,MAXN=2*C+5;
struct STree{
	vector<ll>t; ll n;
	STree(ll n):t(2*n+5,INF),n(n){}
	void upd(ll p, ll v){
		for(p+=n,t[p]=min(t[p],v);p>1;p>>=1)t[p>>1]=min(t[p],t[p^1]);
	}
	ll query(ll l, ll r){
		ll res=INF;
		for(l+=n,r+=n;l<r;l>>=1,r>>=1){
			if(l&1)res=min(res,t[l++]);
			if(r&1)res=min(res,t[--r]);
		}
		return res;
	}
};
ll l[MAXN],r[MAXN];
bool cmp(ll i, ll j){
	return ii({l[i],i})<ii({l[j],j});
}
const ll B=283;
int sequence(int N, std::vector<int> A) {
	ll n=N;
	vector<ll>a(n);
	fore(i,0,n)a[i]=A[i]-1;
	vector<ll>pos[n];
	fore(i,0,n)pos[a[i]].pb(i);
	STcustom st(n);
	fore(i,0,n)st.upd(i,1);
	ll res=1;
	vector<ll>s(n);
	fore(i,0,n)s[i]=1;
	fore(i,0,n)if(SZ(pos[i])){
		for(auto j:pos[i])st.upd(j,-1),s[j]--;
		if(SZ(pos[i])<B){
			fore(s,0,SZ(pos[i]))fore(e,s+1,SZ(pos[i])){
				ll l=pos[i][s],r=pos[i][e];
				ll dif=st.query(l,r+1).sum;
				node pre=st.query(0,l+1),suf=st.query(r,n);
				if(dif<=0){
					if(dif+pre.mxs+suf.mxp+e-s+1>=0)res=max(res,e-s+1);
				}
				else {
					if(dif+pre.mns+suf.mnp-(e-s+1)<=0)res=max(res,e-s+1);
				}
			}
		}
		else {
			ll sum=0,rew=0;
			vector<ll>rw(n+1);
			vector<ll>ev{n};
			l[n]=r[n]=rw[n]=0;
			fore(j,0,n){
				sum+=s[j],rew+=a[j]==i;
				rw[j]=rew;
				l[j]=sum-rew,r[j]=sum+rew;
				ev.pb(j);
			}
			sort(ALL(ev),cmp); reverse(ALL(ev));
			STree st(2*n+5+C);
			for(auto i:ev){
				res=max(res,rw[i]-st.query(0,r[i]+C+1));
				st.upd(r[i]+C,rw[i]);
			}
		}
		for(auto j:pos[i])st.upd(j,-1),s[j]--;
	}
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 13 ms 604 KB Output is correct
16 Correct 15 ms 612 KB Output is correct
17 Correct 5 ms 6648 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 11 ms 604 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Correct 3 ms 6492 KB Output is correct
22 Correct 3 ms 6492 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 305 ms 49488 KB Output is correct
3 Correct 305 ms 49488 KB Output is correct
4 Correct 696 ms 65696 KB Output is correct
5 Correct 328 ms 51652 KB Output is correct
6 Correct 315 ms 51788 KB Output is correct
7 Execution timed out 2081 ms 67232 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 396 ms 65676 KB Output is correct
3 Correct 400 ms 66448 KB Output is correct
4 Correct 403 ms 66336 KB Output is correct
5 Correct 439 ms 66556 KB Output is correct
6 Correct 319 ms 66384 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 55240 KB Output is correct
2 Correct 293 ms 55376 KB Output is correct
3 Correct 300 ms 54612 KB Output is correct
4 Correct 313 ms 54864 KB Output is correct
5 Correct 291 ms 51280 KB Output is correct
6 Correct 296 ms 51280 KB Output is correct
7 Correct 273 ms 49948 KB Output is correct
8 Correct 287 ms 49748 KB Output is correct

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 13 ms 604 KB Output is correct
16 Correct 15 ms 612 KB Output is correct
17 Correct 5 ms 6648 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 11 ms 604 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Correct 3 ms 6492 KB Output is correct
22 Correct 3 ms 6492 KB Output is correct
23 Correct 65 ms 8308 KB Output is correct
24 Correct 53 ms 8280 KB Output is correct
25 Correct 57 ms 8536 KB Output is correct
26 Execution timed out 2070 ms 17940 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 13 ms 604 KB Output is correct
16 Correct 15 ms 612 KB Output is correct
17 Correct 5 ms 6648 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 11 ms 604 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Correct 3 ms 6492 KB Output is correct
22 Correct 3 ms 6492 KB Output is correct
23 Correct 305 ms 49488 KB Output is correct
24 Correct 305 ms 49488 KB Output is correct
25 Correct 696 ms 65696 KB Output is correct
26 Correct 328 ms 51652 KB Output is correct
27 Correct 315 ms 51788 KB Output is correct
28 Execution timed out 2081 ms 67232 KB Time limit exceeded
29 Halted 0 ms 0 KB -