oj.uz

Submission #750410

# Submission time Handle Problem Language Result Execution time Memory
750410 2023-05-29T13:28:17 Z jamezzz Sequence (APIO23_sequence) C++17
100 / 100
 1591 ms 68020 KB 
#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;

#define pf printf
#define pb push_back

#define maxn 500005

struct node{
	int N,mn[maxn<<2],mx[maxn<<2],lz[maxn<<2];
	void ppo(int i,int s,int e){
		mx[i]+=lz[i];
		mn[i]+=lz[i];
		if(s!=e){
			lz[2*i+1]+=lz[i];
			lz[2*i+2]+=lz[i];
		}
		lz[i]=0;
	}
	void up(int i,int s,int e,int x,int y,int nv){
		if(s==x&&e==y){lz[i]+=nv;return;}
		int m=(s+e)>>1;
		if(y<=m)up(2*i+1,s,m,x,y,nv);
		else if(x>m)up(2*i+2,m+1,e,x,y,nv);
		else up(2*i+1,s,m,x,m,nv),up(2*i+2,m+1,e,m+1,y,nv);
		ppo(2*i+1,s,m);
		ppo(2*i+2,m+1,e);
		mn[i]=min(mn[2*i+1],mn[2*i+2]);
		mx[i]=max(mx[2*i+1],mx[2*i+2]);
	}
	inline void up(int x,int y,int nv){
		up(0,0,N,x,y,nv);
	}
	int qmx(int i,int s,int e,int x,int y){
		if(s==x&&e==y)return mx[i]+lz[i];
		ppo(i,s,e);
		int m=(s+e)>>1;
		if(y<=m)return qmx(2*i+1,s,m,x,y);
		if(x>m)return qmx(2*i+2,m+1,e,x,y);
		return max(qmx(2*i+1,s,m,x,m),qmx(2*i+2,m+1,e,m+1,y));
	}
	inline int qmx(int x,int y){
		return qmx(0,0,N,x,y);
	}
	int qmn(int i,int s,int e,int x,int y){
		if(s==x&&e==y)return mn[i]+lz[i];
		ppo(i,s,e);
		int m=(s+e)>>1;
		if(y<=m)return qmn(2*i+1,s,m,x,y);
		if(x>m)return qmn(2*i+2,m+1,e,x,y);
		return min(qmn(2*i+1,s,m,x,m),qmn(2*i+2,m+1,e,m+1,y));
	}
	inline int qmn(int x,int y){
		return qmn(0,0,N,x,y);
	}
}prt,srt;

int pmn[maxn],pmx[maxn],smn[maxn],smx[maxn],tot[maxn][2];
vector<int> v[maxn];

//a range is valid if sum(>=x)-sum(<x)>=0 --> find min: == x value 1
//and sum(>x)-sum(<=x)<=0 --> find max: == x value -1

inline bool check(int i,int l,int r){
	return (tot[i][0]-pmn[l]-smn[r]>=0)&&(tot[i][1]-pmx[l]-smx[r]<=0);
}

int sequence(int N,vector<int> A){
	prt.N=srt.N=N+1;
	for(int i=0;i<N;++i){
		v[A[i]].pb(i+1);
		prt.up(i+1,N+1,1);
		srt.up(0,i+1,1);
	}
	for(int i=1;i<=N;++i){
		for(int x:v[i]){
			pmn[x]=prt.qmn(0,x-1);
			smn[x]=srt.qmn(x+1,N+1);
		}
		tot[i][0]=prt.qmx(N,N);
		for(int x:v[i]){
			prt.up(x,N+1,-2);
			srt.up(0,x,-2);
		}
		tot[i][1]=prt.qmx(N,N);
		for(int x:v[i]){
			pmx[x]=prt.qmx(0,x-1);
			smx[x]=srt.qmx(x+1,N+1);
		}
	}
	int ans=0;
	for(int i=1;i<=N;++i){
		if(v[i].empty())continue;
		int l=0,r=0;
		while(r<v[i].size()){
			assert(l<=r);
			if(check(i,v[i][l],v[i][r])){
				ans=max(ans,r-l+1);
				++r;
			}
			else ++l;
		}
	}
	return ans;
}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:96:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |   while(r<v[i].size()){
      |         ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12116 KB Output is correct
2 Correct 6 ms 12136 KB Output is correct
3 Correct 6 ms 12060 KB Output is correct
4 Correct 6 ms 12116 KB Output is correct
5 Correct 6 ms 12116 KB Output is correct
6 Correct 9 ms 12116 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 6 ms 12116 KB Output is correct
12 Correct 7 ms 12116 KB Output is correct
13 Correct 11 ms 12244 KB Output is correct
14 Correct 9 ms 12244 KB Output is correct
15 Correct 8 ms 12244 KB Output is correct
16 Correct 9 ms 12224 KB Output is correct
17 Correct 9 ms 12300 KB Output is correct
18 Correct 10 ms 12256 KB Output is correct
19 Correct 10 ms 12244 KB Output is correct
20 Correct 9 ms 12244 KB Output is correct
21 Correct 9 ms 12316 KB Output is correct
22 Correct 9 ms 12244 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12116 KB Output is correct
2 Correct 1004 ms 62280 KB Output is correct
3 Correct 1027 ms 62212 KB Output is correct
4 Correct 924 ms 54452 KB Output is correct
5 Correct 1002 ms 61252 KB Output is correct
6 Correct 1020 ms 61252 KB Output is correct
7 Correct 925 ms 54772 KB Output is correct
8 Correct 939 ms 54888 KB Output is correct
9 Correct 915 ms 54420 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12136 KB Output is correct
2 Correct 954 ms 54584 KB Output is correct
3 Correct 986 ms 54376 KB Output is correct
4 Correct 1006 ms 54440 KB Output is correct
5 Correct 1018 ms 54552 KB Output is correct
6 Correct 992 ms 54488 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1405 ms 67928 KB Output is correct
2 Correct 1363 ms 67988 KB Output is correct
3 Correct 1315 ms 67584 KB Output is correct
4 Correct 1330 ms 67652 KB Output is correct
5 Correct 1158 ms 64144 KB Output is correct
6 Correct 1175 ms 64108 KB Output is correct
7 Correct 986 ms 62856 KB Output is correct
8 Correct 992 ms 62496 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12116 KB Output is correct
2 Correct 6 ms 12136 KB Output is correct
3 Correct 6 ms 12060 KB Output is correct
4 Correct 6 ms 12116 KB Output is correct
5 Correct 6 ms 12116 KB Output is correct
6 Correct 9 ms 12116 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 6 ms 12116 KB Output is correct
12 Correct 7 ms 12116 KB Output is correct
13 Correct 11 ms 12244 KB Output is correct
14 Correct 9 ms 12244 KB Output is correct
15 Correct 8 ms 12244 KB Output is correct
16 Correct 9 ms 12224 KB Output is correct
17 Correct 9 ms 12300 KB Output is correct
18 Correct 10 ms 12256 KB Output is correct
19 Correct 10 ms 12244 KB Output is correct
20 Correct 9 ms 12244 KB Output is correct
21 Correct 9 ms 12316 KB Output is correct
22 Correct 9 ms 12244 KB Output is correct
23 Correct 208 ms 22388 KB Output is correct
24 Correct 189 ms 22356 KB Output is correct
25 Correct 181 ms 22348 KB Output is correct
26 Correct 155 ms 21340 KB Output is correct
27 Correct 158 ms 21336 KB Output is correct
28 Correct 153 ms 21324 KB Output is correct
29 Correct 134 ms 21076 KB Output is correct
30 Correct 133 ms 21160 KB Output is correct
31 Correct 133 ms 21152 KB Output is correct
32 Correct 135 ms 23268 KB Output is correct
33 Correct 173 ms 22308 KB Output is correct
34 Correct 174 ms 22092 KB Output is correct
35 Correct 173 ms 22092 KB Output is correct
36 Correct 174 ms 22104 KB Output is correct
37 Correct 185 ms 22048 KB Output is correct
38 Correct 185 ms 22104 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12116 KB Output is correct
2 Correct 6 ms 12136 KB Output is correct
3 Correct 6 ms 12060 KB Output is correct
4 Correct 6 ms 12116 KB Output is correct
5 Correct 6 ms 12116 KB Output is correct
6 Correct 9 ms 12116 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 6 ms 12116 KB Output is correct
12 Correct 7 ms 12116 KB Output is correct
13 Correct 11 ms 12244 KB Output is correct
14 Correct 9 ms 12244 KB Output is correct
15 Correct 8 ms 12244 KB Output is correct
16 Correct 9 ms 12224 KB Output is correct
17 Correct 9 ms 12300 KB Output is correct
18 Correct 10 ms 12256 KB Output is correct
19 Correct 10 ms 12244 KB Output is correct
20 Correct 9 ms 12244 KB Output is correct
21 Correct 9 ms 12316 KB Output is correct
22 Correct 9 ms 12244 KB Output is correct
23 Correct 1004 ms 62280 KB Output is correct
24 Correct 1027 ms 62212 KB Output is correct
25 Correct 924 ms 54452 KB Output is correct
26 Correct 1002 ms 61252 KB Output is correct
27 Correct 1020 ms 61252 KB Output is correct
28 Correct 925 ms 54772 KB Output is correct
29 Correct 939 ms 54888 KB Output is correct
30 Correct 915 ms 54420 KB Output is correct
31 Correct 954 ms 54584 KB Output is correct
32 Correct 986 ms 54376 KB Output is correct
33 Correct 1006 ms 54440 KB Output is correct
34 Correct 1018 ms 54552 KB Output is correct
35 Correct 992 ms 54488 KB Output is correct
36 Correct 1405 ms 67928 KB Output is correct
37 Correct 1363 ms 67988 KB Output is correct
38 Correct 1315 ms 67584 KB Output is correct
39 Correct 1330 ms 67652 KB Output is correct
40 Correct 1158 ms 64144 KB Output is correct
41 Correct 1175 ms 64108 KB Output is correct
42 Correct 986 ms 62856 KB Output is correct
43 Correct 992 ms 62496 KB Output is correct
44 Correct 208 ms 22388 KB Output is correct
45 Correct 189 ms 22356 KB Output is correct
46 Correct 181 ms 22348 KB Output is correct
47 Correct 155 ms 21340 KB Output is correct
48 Correct 158 ms 21336 KB Output is correct
49 Correct 153 ms 21324 KB Output is correct
50 Correct 134 ms 21076 KB Output is correct
51 Correct 133 ms 21160 KB Output is correct
52 Correct 133 ms 21152 KB Output is correct
53 Correct 135 ms 23268 KB Output is correct
54 Correct 173 ms 22308 KB Output is correct
55 Correct 174 ms 22092 KB Output is correct
56 Correct 173 ms 22092 KB Output is correct
57 Correct 174 ms 22104 KB Output is correct
58 Correct 185 ms 22048 KB Output is correct
59 Correct 185 ms 22104 KB Output is correct
60 Correct 1571 ms 62388 KB Output is correct
61 Correct 1552 ms 62376 KB Output is correct
62 Correct 1591 ms 62388 KB Output is correct
63 Correct 1380 ms 55612 KB Output is correct
64 Correct 1430 ms 55492 KB Output is correct
65 Correct 1349 ms 55480 KB Output is correct
66 Correct 958 ms 54688 KB Output is correct
67 Correct 1004 ms 54668 KB Output is correct
68 Correct 928 ms 54460 KB Output is correct
69 Correct 982 ms 68020 KB Output is correct
70 Correct 1500 ms 61312 KB Output is correct
71 Correct 1507 ms 61072 KB Output is correct
72 Correct 1456 ms 60656 KB Output is correct
73 Correct 1478 ms 61036 KB Output is correct
74 Correct 1427 ms 60668 KB Output is correct
75 Correct 1481 ms 60996 KB Output is correct