oj.uz

Submission #930237

# Submission time Handle Problem Language Result Execution time Memory
930237 2024-02-19T07:15:27 Z Wansur Sequence (APIO23_sequence) C++17
100 / 100
 889 ms 53184 KB 
#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'
 
using namespace std;
typedef long long ll;
const int mxn=5e5+12;
const int mod=998244353;
 
vector<int> g[mxn];
int p[mxn*4];
int mn[mxn*4];
int mx[mxn*4];
 
void build(int v,int tl,int tr){
	p[v]=0;
	if(tl==tr){
		mn[v]=mx[v]=tl;
	}
	else{
		int mid=tl+tr>>1;
		build(v*2,tl,mid);
		build(v*2+1,mid+1,tr);
		mn[v]=min(mn[v*2],mn[v*2+1]);
		mx[v]=max(mx[v*2],mx[v*2+1]);
	}
}
 
void push(int v,int tl,int tr){
	if(tl==tr){
		return;
	}
	mn[v*2]+=p[v];
	mn[v*2+1]+=p[v];
	p[v*2]+=p[v];
	p[v*2+1]+=p[v];
	mx[v*2]+=p[v];
	mx[v*2+1]+=p[v];
	p[v]=0;
}
 
void upd(int v,int tl,int tr,int l,int r,int x){
	push(v,tl,tr);
	if(tl>r || l>tr)return;
	if(tl>=l && tr<=r){
		mn[v]+=x;
		mx[v]+=x;
		p[v]+=x;
		return;
	}
	int mid=tl+tr>>1;
	upd(v*2,tl,mid,l,r,x);
	upd(v*2+1,mid+1,tr,l,r,x);
	mn[v]=min(mn[v*2],mn[v*2+1]);
	mx[v]=max(mx[v*2],mx[v*2+1]);
}
 
pair<int,int> get(int v,int tl,int tr,int l,int r){
	push(v,tl,tr);
	if(tl>r || l>tr)return {1e9,-1e9};
	if(tl>=l && tr<=r){
		return {mn[v],mx[v]};
	}
	int mid=tl+tr>>1;
	pair<int,int> x=get(v*2,tl,mid,l,r),y=get(v*2+1,mid+1,tr,l,r);
	return {min(x.f,y.f),max(x.s,y.s)};
}
 
int sequence(int n, std::vector<int> A){
	vector<int> a={0};
	for(int x:A){
		a.push_back(x);
	}
	for(int i=1;i<=n;i++){
		g[a[i]].push_back(i);
	}
	for(int i=1;i<=n;i++){
		upd(1,0,n,i,n,1);
	}
	int ans=1;
	for(int x=1;x<=n;x++){
		for(int i:g[x]){
			upd(1,0,n,i,n,-2);
		}
		for(int i=g[x].size()-1;i>=0;i--){
			int l=g[x][i];
			upd(1,0,n,l,n,2);
			pair<int,int> L=get(1,0,n,0,l-1);
			while(i+ans<g[x].size()){
				int r=g[x][i+ans];
				pair<int,int> R=get(1,0,n,r,n);
				R.f-=(ans+1)*2; 
				if(max(L.f,R.f)<=min(L.s,R.s)){
					ans++;
				}
				else break;
			}
		}
		for(int i:g[x]){
			upd(1,0,n,i,n,-2);
		}
	}
	return ans;
}

Compilation message

sequence.cpp: In function 'void build(int, int, int)':
sequence.cpp:22:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |   int mid=tl+tr>>1;
      |           ~~^~~
sequence.cpp: In function 'void upd(int, int, int, int, int, int)':
sequence.cpp:52:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |  int mid=tl+tr>>1;
      |          ~~^~~
sequence.cpp: In function 'std::pair<int, int> get(int, int, int, int, int)':
sequence.cpp:65:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |  int mid=tl+tr>>1;
      |          ~~^~~
sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:90:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |    while(i+ans<g[x].size()){
      |          ~~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14776 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 5 ms 14940 KB Output is correct
14 Correct 5 ms 14940 KB Output is correct
15 Correct 5 ms 14940 KB Output is correct
16 Correct 5 ms 14972 KB Output is correct
17 Correct 5 ms 14936 KB Output is correct
18 Correct 5 ms 15032 KB Output is correct
19 Correct 5 ms 14940 KB Output is correct
20 Correct 5 ms 14940 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 5 ms 14940 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14936 KB Output is correct
2 Correct 677 ms 44036 KB Output is correct
3 Correct 665 ms 43968 KB Output is correct
4 Correct 689 ms 36852 KB Output is correct
5 Correct 669 ms 43148 KB Output is correct
6 Correct 676 ms 43012 KB Output is correct
7 Correct 645 ms 36688 KB Output is correct
8 Correct 660 ms 36804 KB Output is correct
9 Correct 681 ms 37360 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 717 ms 39092 KB Output is correct
3 Correct 733 ms 37568 KB Output is correct
4 Correct 729 ms 37568 KB Output is correct
5 Correct 759 ms 39088 KB Output is correct
6 Correct 737 ms 37572 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 764 ms 49856 KB Output is correct
2 Correct 742 ms 49764 KB Output is correct
3 Correct 742 ms 49292 KB Output is correct
4 Correct 750 ms 49280 KB Output is correct
5 Correct 728 ms 45824 KB Output is correct
6 Correct 737 ms 45760 KB Output is correct
7 Correct 692 ms 44740 KB Output is correct
8 Correct 680 ms 44420 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14776 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 5 ms 14940 KB Output is correct
14 Correct 5 ms 14940 KB Output is correct
15 Correct 5 ms 14940 KB Output is correct
16 Correct 5 ms 14972 KB Output is correct
17 Correct 5 ms 14936 KB Output is correct
18 Correct 5 ms 15032 KB Output is correct
19 Correct 5 ms 14940 KB Output is correct
20 Correct 5 ms 14940 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 5 ms 14940 KB Output is correct
23 Correct 107 ms 25032 KB Output is correct
24 Correct 108 ms 25080 KB Output is correct
25 Correct 111 ms 25132 KB Output is correct
26 Correct 111 ms 24012 KB Output is correct
27 Correct 108 ms 24124 KB Output is correct
28 Correct 109 ms 23876 KB Output is correct
29 Correct 108 ms 23500 KB Output is correct
30 Correct 104 ms 23756 KB Output is correct
31 Correct 110 ms 24100 KB Output is correct
32 Correct 101 ms 26060 KB Output is correct
33 Correct 106 ms 25036 KB Output is correct
34 Correct 111 ms 24968 KB Output is correct
35 Correct 106 ms 24828 KB Output is correct
36 Correct 109 ms 24900 KB Output is correct
37 Correct 118 ms 24820 KB Output is correct
38 Correct 110 ms 25044 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14776 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 5 ms 14940 KB Output is correct
14 Correct 5 ms 14940 KB Output is correct
15 Correct 5 ms 14940 KB Output is correct
16 Correct 5 ms 14972 KB Output is correct
17 Correct 5 ms 14936 KB Output is correct
18 Correct 5 ms 15032 KB Output is correct
19 Correct 5 ms 14940 KB Output is correct
20 Correct 5 ms 14940 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 5 ms 14940 KB Output is correct
23 Correct 677 ms 44036 KB Output is correct
24 Correct 665 ms 43968 KB Output is correct
25 Correct 689 ms 36852 KB Output is correct
26 Correct 669 ms 43148 KB Output is correct
27 Correct 676 ms 43012 KB Output is correct
28 Correct 645 ms 36688 KB Output is correct
29 Correct 660 ms 36804 KB Output is correct
30 Correct 681 ms 37360 KB Output is correct
31 Correct 717 ms 39092 KB Output is correct
32 Correct 733 ms 37568 KB Output is correct
33 Correct 729 ms 37568 KB Output is correct
34 Correct 759 ms 39088 KB Output is correct
35 Correct 737 ms 37572 KB Output is correct
36 Correct 764 ms 49856 KB Output is correct
37 Correct 742 ms 49764 KB Output is correct
38 Correct 742 ms 49292 KB Output is correct
39 Correct 750 ms 49280 KB Output is correct
40 Correct 728 ms 45824 KB Output is correct
41 Correct 737 ms 45760 KB Output is correct
42 Correct 692 ms 44740 KB Output is correct
43 Correct 680 ms 44420 KB Output is correct
44 Correct 107 ms 25032 KB Output is correct
45 Correct 108 ms 25080 KB Output is correct
46 Correct 111 ms 25132 KB Output is correct
47 Correct 111 ms 24012 KB Output is correct
48 Correct 108 ms 24124 KB Output is correct
49 Correct 109 ms 23876 KB Output is correct
50 Correct 108 ms 23500 KB Output is correct
51 Correct 104 ms 23756 KB Output is correct
52 Correct 110 ms 24100 KB Output is correct
53 Correct 101 ms 26060 KB Output is correct
54 Correct 106 ms 25036 KB Output is correct
55 Correct 111 ms 24968 KB Output is correct
56 Correct 106 ms 24828 KB Output is correct
57 Correct 109 ms 24900 KB Output is correct
58 Correct 118 ms 24820 KB Output is correct
59 Correct 110 ms 25044 KB Output is correct
60 Correct 872 ms 47444 KB Output is correct
61 Correct 860 ms 47300 KB Output is correct
62 Correct 860 ms 47488 KB Output is correct
63 Correct 802 ms 39144 KB Output is correct
64 Correct 794 ms 39120 KB Output is correct
65 Correct 823 ms 39320 KB Output is correct
66 Correct 715 ms 37828 KB Output is correct
67 Correct 714 ms 38436 KB Output is correct
68 Correct 770 ms 39776 KB Output is correct
69 Correct 660 ms 53184 KB Output is correct
70 Correct 859 ms 46636 KB Output is correct
71 Correct 881 ms 46664 KB Output is correct
72 Correct 889 ms 46020 KB Output is correct
73 Correct 841 ms 46176 KB Output is correct
74 Correct 823 ms 45764 KB Output is correct
75 Correct 845 ms 46276 KB Output is correct