oj.uz

Submission #981667

# Submission time Handle Problem Language Result Execution time Memory
981667 2024-05-13T12:35:47 Z shadow_sami Sequence (APIO23_sequence) C++17
100 / 100
 1166 ms 134488 KB 
#include<bits/stdc++.h>
#include "sequence.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll a[mx];
vi lis[mx];
ll pref[mx];

typedef struct SEGMENT_TREE{
	vi men,mex,laz;
	ll range;	
	void init(ll k){
		range = 4 * k;
		men.resize(range);	
		mex.resize(range);	
		laz.resize(range);	
		fip(0,n)
			men[i] = mex[i] = laz[i] = 0;		
		return;
	}
	void prop(ll ptr,ll l,ll r){
		mex[ptr] += laz[ptr];
		men[ptr] += laz[ptr];
		if(l!=r){
			laz[2*ptr] += laz[ptr];
			laz[2*ptr+1] += laz[ptr];
		}
		laz[ptr] = 0;
		return;
	}
	void update(ll ptr,ll l,ll r,ll st,ll en,ll val){
		prop(ptr,l,r);
		if(l>en || r<st)
			return;
		if(l>=st && r<=en){
			laz[ptr] += val;
			prop(ptr,l,r);
			return;
		}
		ll mid = l + (r-l) / 2;
		update(2*ptr,l,mid,st,en,val);
		update(2*ptr+1,mid+1,r,st,en,val);
		men[ptr] = min(men[2*ptr],men[2*ptr+1]);
		mex[ptr] = max(mex[2*ptr],mex[2*ptr+1]);
		return;
	}
	ll query_mn(ll ptr,ll l,ll r,ll st,ll en){
		prop(ptr,l,r);
		if(r<l)
			return 1e18;		
		if(l>en || r<st)
			return 1e18;
		if(l>=st && r<=en){			
			return men[ptr];
		}
		ll mid = l + (r-l) / 2;
		return min(query_mn(2*ptr,l,mid,st,en),query_mn(2*ptr+1,mid+1,r,st,en));
	}
	ll query_mx(ll ptr,ll l,ll r,ll st,ll en){
		prop(ptr,l,r);
		if(r<l)
			return -1e18;		
		if(l>en || r<st)
			return -1e18;
		if(l>=st && r<=en){			
			return mex[ptr];
		}
		ll mid = l + (r-l) / 2;
		return max(query_mx(2*ptr,l,mid,st,en),query_mx(2*ptr+1,mid+1,r,st,en));
	}
}SGT;

SGT st1,st2;

int sequence(int N, vector<int> A) {
	n = N;
	fip(0,n){
		a[i] = A[i];
		lis[a[i]].push_back(i);
	}
	ans = 0;
	st1.init(n);
	st2.init(n);
	fip(0,n){
		st1.update(1,0,n-1,i,n-1,1);
		st2.update(1,0,n-1,i,n-1,1);
	}
	fip(1,n+1){
		fx(lis[i]){
			st1.update(1,0,n-1,x,n-1,-2);
		}
		fjp(0,(ll)lis[i].size()){
			while(j+ans<(ll)lis[i].size()){
				tp = lis[i][j];
				tp2 = lis[i][j+ans];
				sum = st2.query_mx(1,0,n-1,tp2,n-1) - min(0ll,st2.query_mn(1,0,n-1,0,tp-1));
				res = st1.query_mn(1,0,n-1,tp2,n-1) - max(0ll,st1.query_mx(1,0,n-1,0,tp-1));
				if(sum>=0 && res<=0)ans++;
				else break;
			}			
		}
		fx(lis[i])
			st2.update(1,0,n-1,x,n-1,-2);		
	}
  	return ans;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         int N;
//         cin>>N;
//         vector<int> A(N);
//         for( auto &x : A)
//         	cin>>x;
//         cout<<sequence(N,A);
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 4 ms 14684 KB Output is correct
6 Correct 3 ms 14780 KB Output is correct
7 Correct 4 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14680 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 5 ms 15196 KB Output is correct
14 Correct 5 ms 15032 KB Output is correct
15 Correct 5 ms 15196 KB Output is correct
16 Correct 5 ms 15196 KB Output is correct
17 Correct 5 ms 15196 KB Output is correct
18 Correct 4 ms 15196 KB Output is correct
19 Correct 4 ms 15196 KB Output is correct
20 Correct 5 ms 15068 KB Output is correct
21 Correct 5 ms 15192 KB Output is correct
22 Correct 5 ms 15192 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Correct 727 ms 126036 KB Output is correct
3 Correct 688 ms 126068 KB Output is correct
4 Correct 768 ms 119704 KB Output is correct
5 Correct 705 ms 125568 KB Output is correct
6 Correct 732 ms 125660 KB Output is correct
7 Correct 688 ms 120148 KB Output is correct
8 Correct 709 ms 120736 KB Output is correct
9 Correct 783 ms 119708 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 948 ms 120560 KB Output is correct
3 Correct 852 ms 119708 KB Output is correct
4 Correct 990 ms 120824 KB Output is correct
5 Correct 959 ms 121960 KB Output is correct
6 Correct 963 ms 120760 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 859 ms 131308 KB Output is correct
2 Correct 898 ms 131440 KB Output is correct
3 Correct 840 ms 130724 KB Output is correct
4 Correct 874 ms 130888 KB Output is correct
5 Correct 856 ms 127608 KB Output is correct
6 Correct 878 ms 127572 KB Output is correct
7 Correct 803 ms 126292 KB Output is correct
8 Correct 795 ms 125872 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 4 ms 14684 KB Output is correct
6 Correct 3 ms 14780 KB Output is correct
7 Correct 4 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14680 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 5 ms 15196 KB Output is correct
14 Correct 5 ms 15032 KB Output is correct
15 Correct 5 ms 15196 KB Output is correct
16 Correct 5 ms 15196 KB Output is correct
17 Correct 5 ms 15196 KB Output is correct
18 Correct 4 ms 15196 KB Output is correct
19 Correct 4 ms 15196 KB Output is correct
20 Correct 5 ms 15068 KB Output is correct
21 Correct 5 ms 15192 KB Output is correct
22 Correct 5 ms 15192 KB Output is correct
23 Correct 152 ms 32156 KB Output is correct
24 Correct 171 ms 32596 KB Output is correct
25 Correct 121 ms 32600 KB Output is correct
26 Correct 135 ms 32012 KB Output is correct
27 Correct 163 ms 32036 KB Output is correct
28 Correct 138 ms 31832 KB Output is correct
29 Correct 133 ms 31132 KB Output is correct
30 Correct 131 ms 31432 KB Output is correct
31 Correct 128 ms 31696 KB Output is correct
32 Correct 98 ms 33372 KB Output is correct
33 Correct 122 ms 32452 KB Output is correct
34 Correct 135 ms 32472 KB Output is correct
35 Correct 127 ms 32344 KB Output is correct
36 Correct 139 ms 32424 KB Output is correct
37 Correct 129 ms 32344 KB Output is correct
38 Correct 143 ms 32460 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 4 ms 14684 KB Output is correct
6 Correct 3 ms 14780 KB Output is correct
7 Correct 4 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14680 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 5 ms 15196 KB Output is correct
14 Correct 5 ms 15032 KB Output is correct
15 Correct 5 ms 15196 KB Output is correct
16 Correct 5 ms 15196 KB Output is correct
17 Correct 5 ms 15196 KB Output is correct
18 Correct 4 ms 15196 KB Output is correct
19 Correct 4 ms 15196 KB Output is correct
20 Correct 5 ms 15068 KB Output is correct
21 Correct 5 ms 15192 KB Output is correct
22 Correct 5 ms 15192 KB Output is correct
23 Correct 727 ms 126036 KB Output is correct
24 Correct 688 ms 126068 KB Output is correct
25 Correct 768 ms 119704 KB Output is correct
26 Correct 705 ms 125568 KB Output is correct
27 Correct 732 ms 125660 KB Output is correct
28 Correct 688 ms 120148 KB Output is correct
29 Correct 709 ms 120736 KB Output is correct
30 Correct 783 ms 119708 KB Output is correct
31 Correct 948 ms 120560 KB Output is correct
32 Correct 852 ms 119708 KB Output is correct
33 Correct 990 ms 120824 KB Output is correct
34 Correct 959 ms 121960 KB Output is correct
35 Correct 963 ms 120760 KB Output is correct
36 Correct 859 ms 131308 KB Output is correct
37 Correct 898 ms 131440 KB Output is correct
38 Correct 840 ms 130724 KB Output is correct
39 Correct 874 ms 130888 KB Output is correct
40 Correct 856 ms 127608 KB Output is correct
41 Correct 878 ms 127572 KB Output is correct
42 Correct 803 ms 126292 KB Output is correct
43 Correct 795 ms 125872 KB Output is correct
44 Correct 152 ms 32156 KB Output is correct
45 Correct 171 ms 32596 KB Output is correct
46 Correct 121 ms 32600 KB Output is correct
47 Correct 135 ms 32012 KB Output is correct
48 Correct 163 ms 32036 KB Output is correct
49 Correct 138 ms 31832 KB Output is correct
50 Correct 133 ms 31132 KB Output is correct
51 Correct 131 ms 31432 KB Output is correct
52 Correct 128 ms 31696 KB Output is correct
53 Correct 98 ms 33372 KB Output is correct
54 Correct 122 ms 32452 KB Output is correct
55 Correct 135 ms 32472 KB Output is correct
56 Correct 127 ms 32344 KB Output is correct
57 Correct 139 ms 32424 KB Output is correct
58 Correct 129 ms 32344 KB Output is correct
59 Correct 143 ms 32460 KB Output is correct
60 Correct 1108 ms 129552 KB Output is correct
61 Correct 1166 ms 129544 KB Output is correct
62 Correct 1126 ms 129556 KB Output is correct
63 Correct 1127 ms 123872 KB Output is correct
64 Correct 1142 ms 123988 KB Output is correct
65 Correct 1145 ms 123828 KB Output is correct
66 Correct 924 ms 121080 KB Output is correct
67 Correct 947 ms 120704 KB Output is correct
68 Correct 829 ms 123132 KB Output is correct
69 Correct 685 ms 134488 KB Output is correct
70 Correct 1093 ms 128716 KB Output is correct
71 Correct 1103 ms 128712 KB Output is correct
72 Correct 1076 ms 128252 KB Output is correct
73 Correct 1079 ms 128524 KB Output is correct
74 Correct 1073 ms 128236 KB Output is correct
75 Correct 1125 ms 128520 KB Output is correct