oj.uz

답안 #930244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930244 2024-02-19T07:40:56 Z Wansur 서열 (APIO23_sequence) C++17
100 / 100
 884 ms 49860 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){
	reverse(A.begin(),A.end());
	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=0;i<g[x].size();i++){
			int l=g[x][i];
			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;
			}
			upd(1,0,n,l,n,-2);
		}
		continue;*/
		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:106:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |    while(i+ans<g[x].size()){
      |          ~~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 4 ms 14980 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 5 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 4 ms 14980 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 5 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 5 ms 14936 KB Output is correct
14 Correct 5 ms 14936 KB Output is correct
15 Correct 6 ms 14940 KB Output is correct
16 Correct 5 ms 14940 KB Output is correct
17 Correct 6 ms 15056 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 6 ms 14940 KB Output is correct
20 Correct 6 ms 14936 KB Output is correct
21 Correct 6 ms 14940 KB Output is correct
22 Correct 6 ms 14940 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 669 ms 43968 KB Output is correct
3 Correct 676 ms 44036 KB Output is correct
4 Correct 683 ms 36776 KB Output is correct
5 Correct 675 ms 43144 KB Output is correct
6 Correct 671 ms 43152 KB Output is correct
7 Correct 660 ms 36676 KB Output is correct
8 Correct 658 ms 36812 KB Output is correct
9 Correct 697 ms 36548 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 716 ms 39376 KB Output is correct
3 Correct 729 ms 37572 KB Output is correct
4 Correct 717 ms 37568 KB Output is correct
5 Correct 763 ms 39108 KB Output is correct
6 Correct 743 ms 37568 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 761 ms 49804 KB Output is correct
2 Correct 747 ms 49808 KB Output is correct
3 Correct 758 ms 49348 KB Output is correct
4 Correct 761 ms 49088 KB Output is correct
5 Correct 743 ms 45944 KB Output is correct
6 Correct 735 ms 46008 KB Output is correct
7 Correct 689 ms 44736 KB Output is correct
8 Correct 675 ms 44480 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 4 ms 14980 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 5 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 5 ms 14936 KB Output is correct
14 Correct 5 ms 14936 KB Output is correct
15 Correct 6 ms 14940 KB Output is correct
16 Correct 5 ms 14940 KB Output is correct
17 Correct 6 ms 15056 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 6 ms 14940 KB Output is correct
20 Correct 6 ms 14936 KB Output is correct
21 Correct 6 ms 14940 KB Output is correct
22 Correct 6 ms 14940 KB Output is correct
23 Correct 112 ms 24784 KB Output is correct
24 Correct 108 ms 24528 KB Output is correct
25 Correct 121 ms 24716 KB Output is correct
26 Correct 110 ms 23760 KB Output is correct
27 Correct 108 ms 23764 KB Output is correct
28 Correct 109 ms 23764 KB Output is correct
29 Correct 104 ms 23508 KB Output is correct
30 Correct 111 ms 23332 KB Output is correct
31 Correct 110 ms 23528 KB Output is correct
32 Correct 97 ms 25548 KB Output is correct
33 Correct 109 ms 24520 KB Output is correct
34 Correct 120 ms 24436 KB Output is correct
35 Correct 110 ms 24268 KB Output is correct
36 Correct 109 ms 24532 KB Output is correct
37 Correct 109 ms 24524 KB Output is correct
38 Correct 113 ms 24520 KB Output is correct

Subtask #7
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 4 ms 14980 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 5 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 5 ms 14936 KB Output is correct
14 Correct 5 ms 14936 KB Output is correct
15 Correct 6 ms 14940 KB Output is correct
16 Correct 5 ms 14940 KB Output is correct
17 Correct 6 ms 15056 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 6 ms 14940 KB Output is correct
20 Correct 6 ms 14936 KB Output is correct
21 Correct 6 ms 14940 KB Output is correct
22 Correct 6 ms 14940 KB Output is correct
23 Correct 669 ms 43968 KB Output is correct
24 Correct 676 ms 44036 KB Output is correct
25 Correct 683 ms 36776 KB Output is correct
26 Correct 675 ms 43144 KB Output is correct
27 Correct 671 ms 43152 KB Output is correct
28 Correct 660 ms 36676 KB Output is correct
29 Correct 658 ms 36812 KB Output is correct
30 Correct 697 ms 36548 KB Output is correct
31 Correct 716 ms 39376 KB Output is correct
32 Correct 729 ms 37572 KB Output is correct
33 Correct 717 ms 37568 KB Output is correct
34 Correct 763 ms 39108 KB Output is correct
35 Correct 743 ms 37568 KB Output is correct
36 Correct 761 ms 49804 KB Output is correct
37 Correct 747 ms 49808 KB Output is correct
38 Correct 758 ms 49348 KB Output is correct
39 Correct 761 ms 49088 KB Output is correct
40 Correct 743 ms 45944 KB Output is correct
41 Correct 735 ms 46008 KB Output is correct
42 Correct 689 ms 44736 KB Output is correct
43 Correct 675 ms 44480 KB Output is correct
44 Correct 112 ms 24784 KB Output is correct
45 Correct 108 ms 24528 KB Output is correct
46 Correct 121 ms 24716 KB Output is correct
47 Correct 110 ms 23760 KB Output is correct
48 Correct 108 ms 23764 KB Output is correct
49 Correct 109 ms 23764 KB Output is correct
50 Correct 104 ms 23508 KB Output is correct
51 Correct 111 ms 23332 KB Output is correct
52 Correct 110 ms 23528 KB Output is correct
53 Correct 97 ms 25548 KB Output is correct
54 Correct 109 ms 24520 KB Output is correct
55 Correct 120 ms 24436 KB Output is correct
56 Correct 110 ms 24268 KB Output is correct
57 Correct 109 ms 24532 KB Output is correct
58 Correct 109 ms 24524 KB Output is correct
59 Correct 113 ms 24520 KB Output is correct
60 Correct 854 ms 43972 KB Output is correct
61 Correct 884 ms 44056 KB Output is correct
62 Correct 879 ms 43968 KB Output is correct
63 Correct 794 ms 37396 KB Output is correct
64 Correct 787 ms 37320 KB Output is correct
65 Correct 779 ms 37312 KB Output is correct
66 Correct 710 ms 37056 KB Output is correct
67 Correct 719 ms 36756 KB Output is correct
68 Correct 766 ms 36420 KB Output is correct
69 Correct 670 ms 49860 KB Output is correct
70 Correct 842 ms 43168 KB Output is correct
71 Correct 862 ms 42948 KB Output is correct
72 Correct 820 ms 42432 KB Output is correct
73 Correct 851 ms 42692 KB Output is correct
74 Correct 843 ms 42432 KB Output is correct
75 Correct 847 ms 42948 KB Output is correct