oj.uz

Submission #933028

# Submission time Handle Problem Language Result Execution time Memory
933028 2024-02-24T21:58:39 Z Edu175 Sequence (APIO23_sequence) C++17
41 / 100
 2000 ms 53324 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);
	}
};

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;
	fore(i,0,n)if(SZ(pos[i])){
		for(auto j:pos[i])st.upd(j,-1);
		/*cout<<i<<":\n";
		cout<<"{" ; fore(j,0,n)cout<<st.query(j,j+1).sum<<" ";cout<<"}\n";
		cout<<"{" ; fore(j,0,n)cout<<st.query(j,j+1).mns<<" ";cout<<"}\n";*/
		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);
			//cout<<s<<","<<e<<" ("<<l<<","<<r<<"): "<<dif<<" ";
			if(dif<=0){
				if(dif+pre.mxs+suf.mxp+e-s+1>=0)res=max(res,e-s+1);
				//cout<<e-s+1<<" "<<pre.mxs<<" "<<suf.mxp<<" = "<<dif+pre.mxs+suf.mxp+e-s+1<<"\n";
			}
			else {
				if(dif+pre.mns+suf.mnp-(e-s+1)<=0)res=max(res,e-s+1);
				//cout<<-(e-s+1)<<" "<<pre.mns<<" "<<suf.mnp<<" = "<<dif+pre.mns+suf.mnp-(e-s+1)<<"\n";
			}
			//cout<<res<<"\n";
		}
		for(auto j:pos[i])st.upd(j,-1);
		//cout<<"\n";
	}
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 12 ms 440 KB Output is correct
16 Correct 13 ms 600 KB Output is correct
17 Correct 104 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 10 ms 604 KB Output is correct
20 Correct 21 ms 616 KB Output is correct
21 Correct 15 ms 604 KB Output is correct
22 Correct 13 ms 604 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 441 ms 47440 KB Output is correct
3 Correct 455 ms 47528 KB Output is correct
4 Execution timed out 2055 ms 39652 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2020 ms 39672 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 53324 KB Output is correct
2 Correct 433 ms 52996 KB Output is correct
3 Correct 449 ms 52680 KB Output is correct
4 Correct 444 ms 52560 KB Output is correct
5 Correct 448 ms 49348 KB Output is correct
6 Correct 454 ms 49496 KB Output is correct
7 Correct 435 ms 51388 KB Output is correct
8 Correct 443 ms 51076 KB Output is correct

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 12 ms 440 KB Output is correct
16 Correct 13 ms 600 KB Output is correct
17 Correct 104 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 10 ms 604 KB Output is correct
20 Correct 21 ms 616 KB Output is correct
21 Correct 15 ms 604 KB Output is correct
22 Correct 13 ms 604 KB Output is correct
23 Correct 77 ms 8280 KB Output is correct
24 Correct 73 ms 8280 KB Output is correct
25 Correct 80 ms 8432 KB Output is correct
26 Execution timed out 2044 ms 7260 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 12 ms 440 KB Output is correct
16 Correct 13 ms 600 KB Output is correct
17 Correct 104 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 10 ms 604 KB Output is correct
20 Correct 21 ms 616 KB Output is correct
21 Correct 15 ms 604 KB Output is correct
22 Correct 13 ms 604 KB Output is correct
23 Correct 441 ms 47440 KB Output is correct
24 Correct 455 ms 47528 KB Output is correct
25 Execution timed out 2055 ms 39652 KB Time limit exceeded
26 Halted 0 ms 0 KB -