Submission #933552

# Submission time Handle Problem Language Result Execution time Memory
933552 2024-02-25T21:41:29 Z Edu175 Sequence (APIO23_sequence) C++17
100 / 100
707 ms 111536 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;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
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 MAXN=5e5+5;
ll n;
ll a[MAXN];
vector<ll>pos[MAXN];
vector<node> pre[MAXN],suf[MAXN];

bool can(ll x){
	if(x==1)return 1;
	fore(i,0,n){
		fore(s,0,SZ(pos[i])){
			ll e=s+x-1;
			if(e>=SZ(pos[i]))break;
			ll dif=pre[i][e].sum-pre[i][s].sum;
			if(dif<=0){
				if(dif+pre[i][s].mxs+suf[i][e].mxp+e-s-1>=0)return 1;
			}
			else {
				if(dif+pre[i][s].mns+suf[i][e].mnp-(e-s-1)<=0)return 1;
			}
		}
	}
	return 0;
}
int sequence(int N, std::vector<int> A) {
	n=N;
	fore(i,0,n)a[i]=A[i]-1;
	fore(i,0,n)pos[a[i]].pb(i);
	STcustom st(n);
	fore(i,0,n)st.upd(i,1);
	fore(i,0,n){
		pre[i].resize(SZ(pos[i]));
		suf[i].resize(SZ(pos[i]));
		fore(j,0,SZ(pos[i])){
			pre[i][j]=st.query(0,pos[i][j]+1);
			suf[i][j]=st.query(pos[i][j],n);
		}
		for(auto j:pos[i])st.upd(j,-1);
		fore(j,0,SZ(pos[i])){
			pre[i][j].sum=st.query(0,pos[i][j]+1).sum;
			suf[i][j].sum=st.query(pos[i][j],n).sum;
		}
		for(auto j:pos[i])st.upd(j,-1);
		fore(j,0,SZ(pos[i])){
			pre[i][j].mns=st.query(0,pos[i][j]+1).mns;
			suf[i][j].mnp=st.query(pos[i][j],n).mnp;
		}
	}
	ll l=1,r=n+5;
	while(l<=r){
		ll m=(l+r)/2;
		if(can(m))l=m+1;
		else r=m-1;
	}
	return r;
}
# Verdict Execution time Memory Grader output
1 Correct 9 ms 37468 KB Output is correct
2 Correct 7 ms 37468 KB Output is correct
3 Correct 8 ms 37464 KB Output is correct
4 Correct 8 ms 37468 KB Output is correct
5 Correct 8 ms 37468 KB Output is correct
6 Correct 8 ms 37468 KB Output is correct
7 Correct 8 ms 37540 KB Output is correct
8 Correct 8 ms 37468 KB Output is correct
9 Correct 8 ms 37468 KB Output is correct
10 Correct 9 ms 37344 KB Output is correct
11 Correct 8 ms 37536 KB Output is correct
12 Correct 8 ms 37468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 37468 KB Output is correct
2 Correct 7 ms 37468 KB Output is correct
3 Correct 8 ms 37464 KB Output is correct
4 Correct 8 ms 37468 KB Output is correct
5 Correct 8 ms 37468 KB Output is correct
6 Correct 8 ms 37468 KB Output is correct
7 Correct 8 ms 37540 KB Output is correct
8 Correct 8 ms 37468 KB Output is correct
9 Correct 8 ms 37468 KB Output is correct
10 Correct 9 ms 37344 KB Output is correct
11 Correct 8 ms 37536 KB Output is correct
12 Correct 8 ms 37468 KB Output is correct
13 Correct 9 ms 37724 KB Output is correct
14 Correct 9 ms 37720 KB Output is correct
15 Correct 9 ms 37704 KB Output is correct
16 Correct 9 ms 37724 KB Output is correct
17 Correct 9 ms 37540 KB Output is correct
18 Correct 9 ms 37724 KB Output is correct
19 Correct 9 ms 37784 KB Output is correct
20 Correct 9 ms 37724 KB Output is correct
21 Correct 10 ms 37724 KB Output is correct
22 Correct 10 ms 37544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 37468 KB Output is correct
2 Correct 482 ms 97624 KB Output is correct
3 Correct 456 ms 97836 KB Output is correct
4 Correct 366 ms 82656 KB Output is correct
5 Correct 444 ms 96092 KB Output is correct
6 Correct 441 ms 96332 KB Output is correct
7 Correct 366 ms 83032 KB Output is correct
8 Correct 364 ms 83284 KB Output is correct
9 Correct 372 ms 82664 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 37468 KB Output is correct
2 Correct 366 ms 82684 KB Output is correct
3 Correct 364 ms 82652 KB Output is correct
4 Correct 364 ms 82768 KB Output is correct
5 Correct 359 ms 82680 KB Output is correct
6 Correct 364 ms 82848 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 567 ms 107852 KB Output is correct
2 Correct 577 ms 108144 KB Output is correct
3 Correct 564 ms 106920 KB Output is correct
4 Correct 567 ms 106836 KB Output is correct
5 Correct 490 ms 100208 KB Output is correct
6 Correct 494 ms 100172 KB Output is correct
7 Correct 412 ms 97644 KB Output is correct
8 Correct 415 ms 97108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 37468 KB Output is correct
2 Correct 7 ms 37468 KB Output is correct
3 Correct 8 ms 37464 KB Output is correct
4 Correct 8 ms 37468 KB Output is correct
5 Correct 8 ms 37468 KB Output is correct
6 Correct 8 ms 37468 KB Output is correct
7 Correct 8 ms 37540 KB Output is correct
8 Correct 8 ms 37468 KB Output is correct
9 Correct 8 ms 37468 KB Output is correct
10 Correct 9 ms 37344 KB Output is correct
11 Correct 8 ms 37536 KB Output is correct
12 Correct 8 ms 37468 KB Output is correct
13 Correct 9 ms 37724 KB Output is correct
14 Correct 9 ms 37720 KB Output is correct
15 Correct 9 ms 37704 KB Output is correct
16 Correct 9 ms 37724 KB Output is correct
17 Correct 9 ms 37540 KB Output is correct
18 Correct 9 ms 37724 KB Output is correct
19 Correct 9 ms 37784 KB Output is correct
20 Correct 9 ms 37724 KB Output is correct
21 Correct 10 ms 37724 KB Output is correct
22 Correct 10 ms 37544 KB Output is correct
23 Correct 90 ms 47036 KB Output is correct
24 Correct 90 ms 47088 KB Output is correct
25 Correct 90 ms 46928 KB Output is correct
26 Correct 71 ms 44884 KB Output is correct
27 Correct 71 ms 44860 KB Output is correct
28 Correct 73 ms 44884 KB Output is correct
29 Correct 62 ms 44628 KB Output is correct
30 Correct 61 ms 44684 KB Output is correct
31 Correct 62 ms 44752 KB Output is correct
32 Correct 71 ms 48724 KB Output is correct
33 Correct 88 ms 46672 KB Output is correct
34 Correct 86 ms 46688 KB Output is correct
35 Correct 97 ms 47004 KB Output is correct
36 Correct 86 ms 46676 KB Output is correct
37 Correct 86 ms 46688 KB Output is correct
38 Correct 88 ms 46708 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 37468 KB Output is correct
2 Correct 7 ms 37468 KB Output is correct
3 Correct 8 ms 37464 KB Output is correct
4 Correct 8 ms 37468 KB Output is correct
5 Correct 8 ms 37468 KB Output is correct
6 Correct 8 ms 37468 KB Output is correct
7 Correct 8 ms 37540 KB Output is correct
8 Correct 8 ms 37468 KB Output is correct
9 Correct 8 ms 37468 KB Output is correct
10 Correct 9 ms 37344 KB Output is correct
11 Correct 8 ms 37536 KB Output is correct
12 Correct 8 ms 37468 KB Output is correct
13 Correct 9 ms 37724 KB Output is correct
14 Correct 9 ms 37720 KB Output is correct
15 Correct 9 ms 37704 KB Output is correct
16 Correct 9 ms 37724 KB Output is correct
17 Correct 9 ms 37540 KB Output is correct
18 Correct 9 ms 37724 KB Output is correct
19 Correct 9 ms 37784 KB Output is correct
20 Correct 9 ms 37724 KB Output is correct
21 Correct 10 ms 37724 KB Output is correct
22 Correct 10 ms 37544 KB Output is correct
23 Correct 482 ms 97624 KB Output is correct
24 Correct 456 ms 97836 KB Output is correct
25 Correct 366 ms 82656 KB Output is correct
26 Correct 444 ms 96092 KB Output is correct
27 Correct 441 ms 96332 KB Output is correct
28 Correct 366 ms 83032 KB Output is correct
29 Correct 364 ms 83284 KB Output is correct
30 Correct 372 ms 82664 KB Output is correct
31 Correct 366 ms 82684 KB Output is correct
32 Correct 364 ms 82652 KB Output is correct
33 Correct 364 ms 82768 KB Output is correct
34 Correct 359 ms 82680 KB Output is correct
35 Correct 364 ms 82848 KB Output is correct
36 Correct 567 ms 107852 KB Output is correct
37 Correct 577 ms 108144 KB Output is correct
38 Correct 564 ms 106920 KB Output is correct
39 Correct 567 ms 106836 KB Output is correct
40 Correct 490 ms 100208 KB Output is correct
41 Correct 494 ms 100172 KB Output is correct
42 Correct 412 ms 97644 KB Output is correct
43 Correct 415 ms 97108 KB Output is correct
44 Correct 90 ms 47036 KB Output is correct
45 Correct 90 ms 47088 KB Output is correct
46 Correct 90 ms 46928 KB Output is correct
47 Correct 71 ms 44884 KB Output is correct
48 Correct 71 ms 44860 KB Output is correct
49 Correct 73 ms 44884 KB Output is correct
50 Correct 62 ms 44628 KB Output is correct
51 Correct 61 ms 44684 KB Output is correct
52 Correct 62 ms 44752 KB Output is correct
53 Correct 71 ms 48724 KB Output is correct
54 Correct 88 ms 46672 KB Output is correct
55 Correct 86 ms 46688 KB Output is correct
56 Correct 97 ms 47004 KB Output is correct
57 Correct 86 ms 46676 KB Output is correct
58 Correct 86 ms 46688 KB Output is correct
59 Correct 88 ms 46708 KB Output is correct
60 Correct 696 ms 101048 KB Output is correct
61 Correct 704 ms 101300 KB Output is correct
62 Correct 707 ms 101180 KB Output is correct
63 Correct 498 ms 85588 KB Output is correct
64 Correct 500 ms 85704 KB Output is correct
65 Correct 520 ms 85664 KB Output is correct
66 Correct 368 ms 83716 KB Output is correct
67 Correct 375 ms 83892 KB Output is correct
68 Correct 382 ms 85952 KB Output is correct
69 Correct 444 ms 111536 KB Output is correct
70 Correct 648 ms 99536 KB Output is correct
71 Correct 652 ms 99012 KB Output is correct
72 Correct 606 ms 98248 KB Output is correct
73 Correct 638 ms 98564 KB Output is correct
74 Correct 626 ms 97888 KB Output is correct
75 Correct 645 ms 98808 KB Output is correct