oj.uz

Submission #749203

# Submission time Handle Problem Language Result Execution time Memory
749203 2023-05-27T14:24:05 Z kshitij_sodani Sequence (APIO23_sequence) C++17
100 / 100
 1585 ms 52040 KB 
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
typedef long long llo;
#define endl '\n'

#include "sequence.h"

#include <vector>

vector<int> it;
int ans=0;
int tree[4*500001][2];
int lazy[4*500001];

void build(int no,int l,int r){
	lazy[no]=0;
	if(l==r){
		tree[no][0]=r+1;
		tree[no][1]=-(r+1);
	}
	if(l<r){
		int mid=(l+r)/2;
		build(no*2+1,l,mid);
		build(no*2+2,mid+1,r);
		tree[no][0]=max(tree[no*2+1][0],tree[no*2+2][0]);
		tree[no][1]=max(tree[no*2+1][1],tree[no*2+2][1]);
	}
}
void push(int no,int l,int r){
	tree[no][0]+=lazy[no];
	tree[no][1]-=lazy[no];
	if(l<r){
		lazy[no*2+1]+=lazy[no];
		lazy[no*2+2]+=lazy[no];
	}
	lazy[no]=0;
}
void update(int no,int l,int r,int aa,int bb,int x){
	push(no,l,r);
	if(r<aa or l>bb or aa>bb){
		return ;
	}
	if(aa<=l and r<=bb){
		lazy[no]=x;
		push(no,l,r);
	}
	else{
		int mid=(l+r)/2;
		update(no*2+1,l,mid,aa,bb,x);
		update(no*2+2,mid+1,r,aa,bb,x);
		tree[no][0]=max(tree[no*2+1][0],tree[no*2+2][0]);
		tree[no][1]=max(tree[no*2+1][1],tree[no*2+2][1]);
	}
}
int query(int no,int l,int r,int aa,int bb,int x){
	push(no,l,r);
	if(r<aa or l>bb or aa>bb){
		return -1e8;
	}
	if(aa<=l and r<=bb){
		return tree[no][x];
		//return {tree[no][0],tree[no][1]};
	}
	int mid=(l+r)/2;
	return max(query(no*2+1,l,mid,aa,bb,x),query(no*2+2,mid+1,r,aa,bb,x));
/*	int mid=(l+r)/2;
	pair<int,int> x=query(no*2+1,l,mid,aa,bb);
	pair<int,int> y=query(no*2+2,mid+1,r,aa,bb);
	
	tree[no][0]=max(tree[no*2+1][0],tree[no*2+2][0]);
	tree[no][1]=min(tree[no*2+1][1],tree[no*2+2][1]);
	
	return {max(x.a,y.a),min(x.b,y.b)};*/
}
int xa;
int ya;
void query4(int no,int l,int r,int i){
	if(r<=i){
		ya=max(ya,tree[no][1]);
		return;
	}
	if(l>i){
		xa=max(xa,tree[no][0]);
		return;
	}
	int mid=(l+r)/2;
	query4(no*2+1,l,mid,i);
	query4(no*2+2,mid+1,r,i);
}
int tree2[4*500001];
void update2(int no,int l,int r,int i,int x){
	if(l==r){
		tree2[no]=x;
	}
	else{
		int mid=(l+r)/2;
		if(i<=mid){
			update2(no*2+1,l,mid,i,x);
		}
		else{
			update2(no*2+2,mid+1,r,i,x);
		}
		tree2[no]=max(tree2[no*2+1],tree2[no*2+2]);
	}
}
int query2(int no,int l,int r,int aa,int bb){
	if(r<aa or l>bb or aa>bb){
		return -1e8;
	}
	if(aa<=l and r<=bb){
		return tree2[no];
	}
	int mid=(l+r)/2;

	return max(query2(no*2+1,l,mid,aa,bb),query2(no*2+2,mid+1,r,aa,bb));
}
int query3(int no,int l,int r,int x){
	if(l==r){
		return l;
	}
	int mid=(l+r)/2;
	if(tree2[no*2+1]>=x){
		return query3(no*2+1,l,mid,x);
	}
	return query3(no*2+2,mid+1,r,x);
}

int ind5[500001];
vector<int> pre[500001];
void solve(int n){
	for(int i=0;i<n;i++){
		pre[i].clear();
	}
	for(int i=0;i<n;i++){
		pre[it[i]].pb(i);	
	}

	build(0,0,n);
	for(int i=0;i<n;i++){
		if(pre[i].size()==1){
			for(auto j:pre[i]){
				update(0,0,n,j+1,n,-2);
			}
		}
		
		if(pre[i].size()>1){
			for(auto j:pre[i]){
				update(0,0,n,j+1,n,-1);
			}
			vector<pair<int,int>> zz;
			for(int j=0;j<pre[i].size();j++){
				ind5[pre[i][j]]=j;
				zz.pb({-query(0,0,n,pre[i][j],pre[i][j],0),j});
			}
			sort(zz.begin(),zz.end());
			int nn=zz.size();
			for(int j=0;j<4*nn;j++){
				tree2[j]=-1e8;
			}
			for(auto j:zz){
				int ha=-j.a;
				xa=-1e8;
				ya=-1e8;
				query4(0,0,n,pre[i][j.b]);
				int x=xa-ha;
				//cur=x+j.a.a+1
				llo ac=-(x+j.b+1+ha);//query(0,0,n,j.b.b,j.b.b).a);
				//find min index with sum>=ac
				llo low=0;
				if(tree2[0]>=ac){
				/*	llo low=query3(0,0,n-1,ac);
					if(low<pre[i][j.b]){
						ans=max(ans,j.b-ind5[low]+1);
					}*/
					int low=query3(0,0,nn-1,ac);
					if(low<j.b){
						ans=max(ans,j.b-low+1);
					}
				}
				int y=ha+ya;//.b;
				//update2(0,0,n-1,pre[i][j.b],y-j.b-ha);
				update2(0,0,nn-1,j.b,y-j.b-ha);
			}
			for(auto j:pre[i]){
				update(0,0,n,j+1,n,-1);
			//update2(0,0,n-1,j,-(1e8));
			}
		}
		
	}
}
int sequence(int n,vector<int> aa) {
	it=aa;
	for(int i=0;i<n;i++){
		it[i]--;
	}
	ans=1;
	solve(n);
	for(int i=0;i<n;i++){
		it[i]=n-1-it[i];
	}
	solve(n);





	return ans;
}

Compilation message

sequence.cpp: In function 'void solve(int)':
sequence.cpp:154:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |    for(int j=0;j<pre[i].size();j++){
      |                ~^~~~~~~~~~~~~~
sequence.cpp:172:9: warning: unused variable 'low' [-Wunused-variable]
  172 |     llo low=0;
      |         ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 9 ms 12068 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12088 KB Output is correct
5 Correct 9 ms 12024 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 7 ms 12052 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 6 ms 11996 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 9 ms 12028 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 9 ms 12068 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12088 KB Output is correct
5 Correct 9 ms 12024 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 7 ms 12052 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 6 ms 11996 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 9 ms 12028 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 9 ms 12188 KB Output is correct
16 Correct 11 ms 12116 KB Output is correct
17 Correct 14 ms 12204 KB Output is correct
18 Correct 8 ms 12208 KB Output is correct
19 Correct 10 ms 12116 KB Output is correct
20 Correct 9 ms 12116 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 10 ms 12116 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 914 ms 45888 KB Output is correct
3 Correct 894 ms 45900 KB Output is correct
4 Correct 1166 ms 39640 KB Output is correct
5 Correct 919 ms 45924 KB Output is correct
6 Correct 938 ms 45924 KB Output is correct
7 Correct 1117 ms 37408 KB Output is correct
8 Correct 1078 ms 37620 KB Output is correct
9 Correct 1132 ms 42780 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12068 KB Output is correct
2 Correct 1154 ms 47452 KB Output is correct
3 Correct 1240 ms 42564 KB Output is correct
4 Correct 1231 ms 42624 KB Output is correct
5 Correct 1168 ms 48004 KB Output is correct
6 Correct 1151 ms 44384 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 45876 KB Output is correct
2 Correct 573 ms 46540 KB Output is correct
3 Correct 629 ms 47088 KB Output is correct
4 Correct 675 ms 46908 KB Output is correct
5 Correct 811 ms 46888 KB Output is correct
6 Correct 817 ms 46992 KB Output is correct
7 Correct 776 ms 44480 KB Output is correct
8 Correct 844 ms 45232 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 9 ms 12068 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12088 KB Output is correct
5 Correct 9 ms 12024 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 7 ms 12052 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 6 ms 11996 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 9 ms 12028 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 9 ms 12188 KB Output is correct
16 Correct 11 ms 12116 KB Output is correct
17 Correct 14 ms 12204 KB Output is correct
18 Correct 8 ms 12208 KB Output is correct
19 Correct 10 ms 12116 KB Output is correct
20 Correct 9 ms 12116 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 10 ms 12116 KB Output is correct
23 Correct 163 ms 18576 KB Output is correct
24 Correct 151 ms 18508 KB Output is correct
25 Correct 153 ms 18516 KB Output is correct
26 Correct 176 ms 17600 KB Output is correct
27 Correct 190 ms 17680 KB Output is correct
28 Correct 176 ms 17612 KB Output is correct
29 Correct 169 ms 17576 KB Output is correct
30 Correct 183 ms 17692 KB Output is correct
31 Correct 177 ms 19952 KB Output is correct
32 Correct 64 ms 18520 KB Output is correct
33 Correct 160 ms 18820 KB Output is correct
34 Correct 172 ms 18900 KB Output is correct
35 Correct 173 ms 18876 KB Output is correct
36 Correct 201 ms 18920 KB Output is correct
37 Correct 176 ms 18836 KB Output is correct
38 Correct 176 ms 18956 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 9 ms 12068 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12088 KB Output is correct
5 Correct 9 ms 12024 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 7 ms 12052 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 6 ms 11996 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 9 ms 12028 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 9 ms 12188 KB Output is correct
16 Correct 11 ms 12116 KB Output is correct
17 Correct 14 ms 12204 KB Output is correct
18 Correct 8 ms 12208 KB Output is correct
19 Correct 10 ms 12116 KB Output is correct
20 Correct 9 ms 12116 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 10 ms 12116 KB Output is correct
23 Correct 914 ms 45888 KB Output is correct
24 Correct 894 ms 45900 KB Output is correct
25 Correct 1166 ms 39640 KB Output is correct
26 Correct 919 ms 45924 KB Output is correct
27 Correct 938 ms 45924 KB Output is correct
28 Correct 1117 ms 37408 KB Output is correct
29 Correct 1078 ms 37620 KB Output is correct
30 Correct 1132 ms 42780 KB Output is correct
31 Correct 1154 ms 47452 KB Output is correct
32 Correct 1240 ms 42564 KB Output is correct
33 Correct 1231 ms 42624 KB Output is correct
34 Correct 1168 ms 48004 KB Output is correct
35 Correct 1151 ms 44384 KB Output is correct
36 Correct 551 ms 45876 KB Output is correct
37 Correct 573 ms 46540 KB Output is correct
38 Correct 629 ms 47088 KB Output is correct
39 Correct 675 ms 46908 KB Output is correct
40 Correct 811 ms 46888 KB Output is correct
41 Correct 817 ms 46992 KB Output is correct
42 Correct 776 ms 44480 KB Output is correct
43 Correct 844 ms 45232 KB Output is correct
44 Correct 163 ms 18576 KB Output is correct
45 Correct 151 ms 18508 KB Output is correct
46 Correct 153 ms 18516 KB Output is correct
47 Correct 176 ms 17600 KB Output is correct
48 Correct 190 ms 17680 KB Output is correct
49 Correct 176 ms 17612 KB Output is correct
50 Correct 169 ms 17576 KB Output is correct
51 Correct 183 ms 17692 KB Output is correct
52 Correct 177 ms 19952 KB Output is correct
53 Correct 64 ms 18520 KB Output is correct
54 Correct 160 ms 18820 KB Output is correct
55 Correct 172 ms 18900 KB Output is correct
56 Correct 173 ms 18876 KB Output is correct
57 Correct 201 ms 18920 KB Output is correct
58 Correct 176 ms 18836 KB Output is correct
59 Correct 176 ms 18956 KB Output is correct
60 Correct 1401 ms 45848 KB Output is correct
61 Correct 1401 ms 45792 KB Output is correct
62 Correct 1434 ms 45896 KB Output is correct
63 Correct 1547 ms 38472 KB Output is correct
64 Correct 1489 ms 38428 KB Output is correct
65 Correct 1585 ms 38468 KB Output is correct
66 Correct 1236 ms 39948 KB Output is correct
67 Correct 1209 ms 40424 KB Output is correct
68 Correct 1236 ms 52040 KB Output is correct
69 Correct 395 ms 45900 KB Output is correct
70 Correct 1495 ms 47316 KB Output is correct
71 Correct 1402 ms 48112 KB Output is correct
72 Correct 1434 ms 48244 KB Output is correct
73 Correct 1391 ms 48120 KB Output is correct
74 Correct 1362 ms 48292 KB Output is correct
75 Correct 1442 ms 48016 KB Output is correct