oj.uz

Submission #968729

# Submission time Handle Problem Language Result Execution time Memory
968729 2024-04-24T00:32:24 Z vjudge1 Sequence (APIO23_sequence) C++17
100 / 100
 1136 ms 165252 KB 
#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;

namespace Me{
	constexpr int N=5e5+5,INF{0x3f3f3f3f};
	struct Rg{
		int l,r;
		inline bool contain(int x)const{
			return x>=l&&x<=r;
		}
		Rg(int l,int r):l{l},r{r}{}
		Rg(int i):Rg(i,i){}
		Rg():Rg(0,0){}
	};
	inline Rg operator+(Rg a,Rg b){return Rg(a.l+b.l,a.r+b.r);}
	inline Rg operator-(Rg a,Rg b){return Rg(a.l-b.r,a.r-b.l);}
	inline Rg &operator+=(Rg &a,Rg b){return a=a+b;}
	inline Rg operator|(Rg a,Rg b){return Rg(min(a.l,b.l),max(a.r,b.r));}
	inline bool operator&(Rg a,Rg b){if(a.l>b.l)return b&a; return a.r>=b.l;}
	int n,a[N];
	vector<int> pos[N];
	struct Seg{
		int id;
		Seg(int _):id{_}{}
		struct{
			int l,r,lz;
			Rg rg;
			inline void init(int x){
				rg=Rg(x);
			}
		}tr[N<<2];
		inline void pup(int k){
			tr[k].rg=tr[k<<1].rg|tr[k<<1|1].rg;
		}
		inline void add(int k,int v){
			tr[k].rg+=Rg(v);
			tr[k].lz+=v;
		}
		inline void pdn(int k){
			if(tr[k].lz){
				add(k<<1,tr[k].lz),add(k<<1|1,tr[k].lz);
				tr[k].lz=0;
			}
		}
		void build(int k,int l,int r){
			tr[k].l=l,tr[k].r=r,tr[k].lz=0;
			if(tr[k].l==tr[k].r) tr[k].init(id==1?l:-l);
			else{
				int mi((l+r)>>1);
				build(k<<1,l,mi),build(k<<1|1,mi+1,r),pup(k);
			}
		}
		void modify(int k,int l,int r,int v){
			if(tr[k].l>=l&&tr[k].r<=r){
				return add(k,v);
			}
			pdn(k); int mi((tr[k].l+tr[k].r)>>1);
			if(l<=mi) modify(k<<1,l,r,v);
			if(r>mi) modify(k<<1|1,l,r,v);
			pup(k);
		}
		Rg query(int k,int l,int r){
			if(l>r) return Rg{INF,-INF};
			if(tr[k].l>=l&&tr[k].r<=r) return tr[k].rg;
			pdn(k); int mi((tr[k].l+tr[k].r)>>1);
			if(r<=mi) return query(k<<1,l,r);
			else if(l>mi) return query(k<<1|1,l,r);
			else return query(k<<1,l,r)|query(k<<1|1,l,r);
		}
	}segx(1),segy(2);
	struct Fwk{
		int n,s[N];
		inline void init(int _n){
			n=_n; memset(s+1,0x3f,n*sizeof(int));
		}
		inline void add(int x,int v){
			for(;x;x^=x&-x) s[x]=min(s[x],v);
		}
		inline void erase(int x){
			for(;x;x^=x&-x) s[x]=INF;
		}
		inline int query(int x){ int v{INF};
			for(;x<=n;x+=x&-x) v=min(v,s[x]);
			return v;
		}
	}fwk;

	struct Mdf{int y,v;};
	vector<Mdf> ads[N];
	vector<int> qs[N];
	int ans{0};
	void sweep(vector<tuple<int,int,int,int> > &ps){
		// 矩形 min
		sort(ps.begin(),ps.end(),
			[](const auto &a,const auto &b){
				if(get<1>(a)!=get<1>(b)) return get<1>(a) > get<1>(b); 
				return get<0>(a) < get<0>(b);
			}
		);
		auto disc=[&ps](){
			vector<int> vs;
			for(const auto &p:ps) vs.emplace_back(get<2>(p));
			sort(vs.begin(),vs.end()),vs.erase(unique(vs.begin(),vs.end()),vs.end());
			for(auto &p:ps) get<2>(p)=lower_bound(vs.begin(),vs.end(),get<2>(p))-vs.begin()+1;
			return (int)vs.size();
		};
		int mx{disc()};
		fwk.init(mx);
		for(const auto &p:ps){
			int t{get<0>(p)},y{get<2>(p)},v{get<3>(p)};
			if(t==1) fwk.add(y,v);
			else ans=max(ans,v-fwk.query(y));
		}
	}
	int solve(){
		fwk.init(n);
		for(int i{1};i<=n;++i){
			pos[a[i]].emplace_back(i);
		}
		segx.build(1,0,n),segy.build(1,0,n);
		for(int i{1};i<=n;++i){
			for(int j:pos[i-1]) segy.modify(1,j,n,+2);
			for(int j:pos[i]) segx.modify(1,j,n,-2);
			vector<tuple<int,int,int,int> > ps;
			pos[i].emplace_back(n+1);
			int k{0};
			for(int x{0};x<(int)pos[i].size();++x){
				int j{pos[i][x]};
				auto rgx=segx.query(1,k,j-1),rgy=segy.query(1,k,j-1);
				ps.emplace_back(1,rgx.r,rgy.r,x);
				ps.emplace_back(2,rgx.l,rgy.l,x);
				k=j;
			}
			pos[i].pop_back();
			sweep(ps);
		}
		return ans;
	}
}

int sequence(int N, std::vector<int> A){
    Me::n=N; for(int i{0};i<N;++i) Me::a[i+1]=A[i];
	return Me::solve();
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 116052 KB Output is correct
2 Correct 28 ms 116060 KB Output is correct
3 Correct 28 ms 116056 KB Output is correct
4 Correct 28 ms 116148 KB Output is correct
5 Correct 28 ms 116064 KB Output is correct
6 Correct 31 ms 116316 KB Output is correct
7 Correct 27 ms 116060 KB Output is correct
8 Correct 29 ms 116060 KB Output is correct
9 Correct 30 ms 116048 KB Output is correct
10 Correct 28 ms 116056 KB Output is correct
11 Correct 31 ms 116048 KB Output is correct
12 Correct 28 ms 116048 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 116052 KB Output is correct
2 Correct 28 ms 116060 KB Output is correct
3 Correct 28 ms 116056 KB Output is correct
4 Correct 28 ms 116148 KB Output is correct
5 Correct 28 ms 116064 KB Output is correct
6 Correct 31 ms 116316 KB Output is correct
7 Correct 27 ms 116060 KB Output is correct
8 Correct 29 ms 116060 KB Output is correct
9 Correct 30 ms 116048 KB Output is correct
10 Correct 28 ms 116056 KB Output is correct
11 Correct 31 ms 116048 KB Output is correct
12 Correct 28 ms 116048 KB Output is correct
13 Correct 32 ms 116324 KB Output is correct
14 Correct 29 ms 116316 KB Output is correct
15 Correct 30 ms 116300 KB Output is correct
16 Correct 29 ms 116304 KB Output is correct
17 Correct 29 ms 116316 KB Output is correct
18 Correct 29 ms 116236 KB Output is correct
19 Correct 36 ms 116316 KB Output is correct
20 Correct 31 ms 116304 KB Output is correct
21 Correct 30 ms 116316 KB Output is correct
22 Correct 30 ms 116316 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 116052 KB Output is correct
2 Correct 595 ms 141004 KB Output is correct
3 Correct 606 ms 140624 KB Output is correct
4 Correct 549 ms 140284 KB Output is correct
5 Correct 595 ms 140812 KB Output is correct
6 Correct 605 ms 141024 KB Output is correct
7 Correct 513 ms 141020 KB Output is correct
8 Correct 540 ms 141088 KB Output is correct
9 Correct 548 ms 140236 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 116060 KB Output is correct
2 Correct 551 ms 143076 KB Output is correct
3 Correct 567 ms 140232 KB Output is correct
4 Correct 551 ms 140120 KB Output is correct
5 Correct 541 ms 149696 KB Output is correct
6 Correct 507 ms 140680 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 879 ms 140732 KB Output is correct
2 Correct 935 ms 140940 KB Output is correct
3 Correct 904 ms 140836 KB Output is correct
4 Correct 883 ms 140644 KB Output is correct
5 Correct 731 ms 140600 KB Output is correct
6 Correct 730 ms 140552 KB Output is correct
7 Correct 601 ms 140656 KB Output is correct
8 Correct 603 ms 140640 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 116052 KB Output is correct
2 Correct 28 ms 116060 KB Output is correct
3 Correct 28 ms 116056 KB Output is correct
4 Correct 28 ms 116148 KB Output is correct
5 Correct 28 ms 116064 KB Output is correct
6 Correct 31 ms 116316 KB Output is correct
7 Correct 27 ms 116060 KB Output is correct
8 Correct 29 ms 116060 KB Output is correct
9 Correct 30 ms 116048 KB Output is correct
10 Correct 28 ms 116056 KB Output is correct
11 Correct 31 ms 116048 KB Output is correct
12 Correct 28 ms 116048 KB Output is correct
13 Correct 32 ms 116324 KB Output is correct
14 Correct 29 ms 116316 KB Output is correct
15 Correct 30 ms 116300 KB Output is correct
16 Correct 29 ms 116304 KB Output is correct
17 Correct 29 ms 116316 KB Output is correct
18 Correct 29 ms 116236 KB Output is correct
19 Correct 36 ms 116316 KB Output is correct
20 Correct 31 ms 116304 KB Output is correct
21 Correct 30 ms 116316 KB Output is correct
22 Correct 30 ms 116316 KB Output is correct
23 Correct 157 ms 119972 KB Output is correct
24 Correct 157 ms 120116 KB Output is correct
25 Correct 154 ms 120160 KB Output is correct
26 Correct 133 ms 120400 KB Output is correct
27 Correct 133 ms 120484 KB Output is correct
28 Correct 133 ms 120540 KB Output is correct
29 Correct 117 ms 120048 KB Output is correct
30 Correct 110 ms 120204 KB Output is correct
31 Correct 101 ms 123456 KB Output is correct
32 Correct 109 ms 120008 KB Output is correct
33 Correct 152 ms 120276 KB Output is correct
34 Correct 152 ms 120176 KB Output is correct
35 Correct 153 ms 120328 KB Output is correct
36 Correct 155 ms 120392 KB Output is correct
37 Correct 149 ms 120300 KB Output is correct
38 Correct 151 ms 120236 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 116052 KB Output is correct
2 Correct 28 ms 116060 KB Output is correct
3 Correct 28 ms 116056 KB Output is correct
4 Correct 28 ms 116148 KB Output is correct
5 Correct 28 ms 116064 KB Output is correct
6 Correct 31 ms 116316 KB Output is correct
7 Correct 27 ms 116060 KB Output is correct
8 Correct 29 ms 116060 KB Output is correct
9 Correct 30 ms 116048 KB Output is correct
10 Correct 28 ms 116056 KB Output is correct
11 Correct 31 ms 116048 KB Output is correct
12 Correct 28 ms 116048 KB Output is correct
13 Correct 32 ms 116324 KB Output is correct
14 Correct 29 ms 116316 KB Output is correct
15 Correct 30 ms 116300 KB Output is correct
16 Correct 29 ms 116304 KB Output is correct
17 Correct 29 ms 116316 KB Output is correct
18 Correct 29 ms 116236 KB Output is correct
19 Correct 36 ms 116316 KB Output is correct
20 Correct 31 ms 116304 KB Output is correct
21 Correct 30 ms 116316 KB Output is correct
22 Correct 30 ms 116316 KB Output is correct
23 Correct 595 ms 141004 KB Output is correct
24 Correct 606 ms 140624 KB Output is correct
25 Correct 549 ms 140284 KB Output is correct
26 Correct 595 ms 140812 KB Output is correct
27 Correct 605 ms 141024 KB Output is correct
28 Correct 513 ms 141020 KB Output is correct
29 Correct 540 ms 141088 KB Output is correct
30 Correct 548 ms 140236 KB Output is correct
31 Correct 551 ms 143076 KB Output is correct
32 Correct 567 ms 140232 KB Output is correct
33 Correct 551 ms 140120 KB Output is correct
34 Correct 541 ms 149696 KB Output is correct
35 Correct 507 ms 140680 KB Output is correct
36 Correct 879 ms 140732 KB Output is correct
37 Correct 935 ms 140940 KB Output is correct
38 Correct 904 ms 140836 KB Output is correct
39 Correct 883 ms 140644 KB Output is correct
40 Correct 731 ms 140600 KB Output is correct
41 Correct 730 ms 140552 KB Output is correct
42 Correct 601 ms 140656 KB Output is correct
43 Correct 603 ms 140640 KB Output is correct
44 Correct 157 ms 119972 KB Output is correct
45 Correct 157 ms 120116 KB Output is correct
46 Correct 154 ms 120160 KB Output is correct
47 Correct 133 ms 120400 KB Output is correct
48 Correct 133 ms 120484 KB Output is correct
49 Correct 133 ms 120540 KB Output is correct
50 Correct 117 ms 120048 KB Output is correct
51 Correct 110 ms 120204 KB Output is correct
52 Correct 101 ms 123456 KB Output is correct
53 Correct 109 ms 120008 KB Output is correct
54 Correct 152 ms 120276 KB Output is correct
55 Correct 152 ms 120176 KB Output is correct
56 Correct 153 ms 120328 KB Output is correct
57 Correct 155 ms 120392 KB Output is correct
58 Correct 149 ms 120300 KB Output is correct
59 Correct 151 ms 120236 KB Output is correct
60 Correct 1136 ms 140652 KB Output is correct
61 Correct 1072 ms 141112 KB Output is correct
62 Correct 1082 ms 140632 KB Output is correct
63 Correct 873 ms 142004 KB Output is correct
64 Correct 876 ms 141992 KB Output is correct
65 Correct 869 ms 141984 KB Output is correct
66 Correct 570 ms 140380 KB Output is correct
67 Correct 573 ms 140312 KB Output is correct
68 Correct 533 ms 165252 KB Output is correct
69 Correct 582 ms 140736 KB Output is correct
70 Correct 1070 ms 141276 KB Output is correct
71 Correct 1089 ms 142504 KB Output is correct
72 Correct 979 ms 141108 KB Output is correct
73 Correct 996 ms 142020 KB Output is correct
74 Correct 982 ms 142508 KB Output is correct
75 Correct 1042 ms 141408 KB Output is correct