oj.uz

Submission #749348

# Submission time Handle Problem Language Result Execution time Memory
749348 2023-05-27T19:28:05 Z amunduzbaev Sequence (APIO23_sequence) C++17
50 / 100
 2000 ms 58192 KB 
#include "sequence.h"
 
#include "bits/stdc++.h"
using namespace std;
 
#ifndef EVAL
#include "grader.cpp"
#endif
 
#define ar array
typedef long long ll;
//~ #define int ll
 
const int INF = 1e9;
 
struct ST{
	vector<int> min, max, p;
	int N;
	
	ST(){
		N = 5e5 + 5;
		min.resize(N << 2);
		max.resize(N << 2);
		p.resize(N << 2);
	}
	
	ST(int N): N(N) {
		min.resize(N << 2);
		max.resize(N << 2);
		p.resize(N << 2);
	}
	
	void push(int x, int lx, int rx){
		if(lx == rx) return;
		min[x << 1] += p[x], max[x << 1] += p[x], p[x << 1] += p[x];
		min[x << 1 | 1] += p[x], max[x << 1 | 1] += p[x], p[x << 1 | 1] += p[x];
		p[x] = 0;
	}
	
	void add(int l, int r, int v, int lx, int rx, int x){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			min[x] += v, max[x] += v, p[x] += v;
			return;
		}
		int m = (lx + rx) >> 1;
		push(x, lx, rx);
		add(l, r, v, lx, m, x << 1), add(l, r, v, m + 1, rx, x << 1 | 1);
		min[x] = ::min(min[x << 1], min[x << 1 | 1]);
		max[x] = ::max(max[x << 1], max[x << 1 | 1]);
	}
	
	void add(int l, int r, int v){
		assert(r < N);
		add(l, r, v, 0, N, 1);
	}
	
	int Max(int l, int r, int lx, int rx, int x){
		if(lx > r || rx < l) return -INF;
		if(lx >= l && rx <= r) return max[x];
		int m = (lx + rx) >> 1;
		push(x, lx, rx);
		return ::max(Max(l, r, lx, m, x << 1), Max(l, r, m + 1, rx, x << 1 | 1));
	}
	
	int Max(int l, int r){
		assert(r < N);
		return Max(l, r, 0, N, 1);
	}
	
	int first_less(int l, int r, int v, int lx, int rx, int x){
		if(lx > r || rx < l) return -1;
		if(lx >= l && rx <= r){
			if(min[x] > v) return -1;
			if(lx == rx) return lx;
			int m = (lx + rx) >> 1;
			push(x, lx, rx);
			if(min[x << 1] <= v) return first_less(l, r, v, lx, m, x << 1);
			else return first_less(l, r, v, m + 1, rx, x << 1 | 1);
		}
		int m = (lx + rx) >> 1;
		push(x, lx, rx);
		int res = first_less(l, r, v, lx, m, x << 1);
		if(res == -1) res = first_less(l, r, v, m + 1, rx, x << 1 | 1);
		return res;
	}
	int first_less(int l, int r, int v){
		return first_less(l, r, v, 0, N, 1);
	}

	int Min(int l, int r, int lx, int rx, int x){
		if(lx > r || rx < l) return INF;
		if(lx >= l && rx <= r) return min[x];
		int m = (lx + rx) >> 1;
		push(x, lx, rx);
		return ::min(Min(l, r, lx, m, x << 1), Min(l, r, m + 1, rx, x << 1 | 1));
	}
	
	int Min(int l, int r){
		assert(r < N);
		return Min(l, r, 0, N, 1);
	}
	
};
 
struct BIT{
	vector<int> tree;
	int N;
	
	BIT(){
		N = 5e5 + 5;
		tree.resize(N);
	}
	
	void add(int i, int v){
		for(;i<N;i+=(i&-i)) tree[i] += v;
	}
	int get(int i){
		int r = 0;
		for(;i>0;i-=(i&-i)) r += tree[i];
		return r;
	}
	int get(int l, int r){
		return get(r) - get(--l);
	}
};

int sequence(int n, vector<int> a){ 
	a.insert(a.begin(), 0);
 
	ST A, B;
	BIT cnt;
	
	vector<int> p(n);
	iota(p.begin(), p.end(), 1);
	sort(p.begin(), p.end(), [&](int i, int j){
		if(a[i] != a[j]) return a[i] < a[j];
		return i < j;
	});
	
	for(int i=1;i<=n;i++){
		B.add(i, i, i);
		A.add(i, i, -i);
	}
	
	int res = 0;
	for(int i=0,j=0;i<n;){
		vector<int> pos;
		while(j < n && a[p[i]] == a[p[j]]){
			pos.push_back(p[j]);
			A.add(p[j], n, 2);
			cnt.add(p[j], 1);
			j++;
		}
				
		for(int k=0;k<(int)pos.size();k++){
			//~ int L1 = B.first_less(0, pos[k] - 1, B.Max(pos[k], n));
			//~ int L2 = A.first_less(0, pos[k] - 1, A.Max(pos[k], n));
			//~ int L = max(L1, L2);
			//~ res = max(res, cnt.get(L + 1, pos[k]));
			
			int l = 0, r = pos[k] - 1;
			ar<int, 2> Mx = {A.Max(pos[k], n), B.Max(pos[k], n)};
			while(l < r){
				int m = (l + r) >> 1;
				if(A.Min(0, m) <= Mx[0] && B.Min(0, m) <= Mx[1]) r = m;
				else l = m + 1;
			}
			
			res = max(res, cnt.get(l + 1, pos[k]));
		}
		
		while(i < j){
			B.add(p[i], n, -2);
			cnt.add(p[i], -1);
			i++;
		}
	}
	
	return res;
}

/*
 
7
1 2 3 1 2 1 3
 
9
1 1 2 3 4 3 2 1 1
 
14
2 6 2 5 3 4 2 1 4 3 5 6 3 2
 
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 49228 KB Output is correct
2 Correct 21 ms 49220 KB Output is correct
3 Correct 21 ms 49184 KB Output is correct
4 Correct 20 ms 49252 KB Output is correct
5 Correct 21 ms 49200 KB Output is correct
6 Correct 25 ms 49132 KB Output is correct
7 Correct 20 ms 49216 KB Output is correct
8 Correct 20 ms 49236 KB Output is correct
9 Correct 21 ms 49236 KB Output is correct
10 Correct 21 ms 49228 KB Output is correct
11 Correct 20 ms 49252 KB Output is correct
12 Correct 20 ms 49236 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 49228 KB Output is correct
2 Correct 21 ms 49220 KB Output is correct
3 Correct 21 ms 49184 KB Output is correct
4 Correct 20 ms 49252 KB Output is correct
5 Correct 21 ms 49200 KB Output is correct
6 Correct 25 ms 49132 KB Output is correct
7 Correct 20 ms 49216 KB Output is correct
8 Correct 20 ms 49236 KB Output is correct
9 Correct 21 ms 49236 KB Output is correct
10 Correct 21 ms 49228 KB Output is correct
11 Correct 20 ms 49252 KB Output is correct
12 Correct 20 ms 49236 KB Output is correct
13 Correct 30 ms 49192 KB Output is correct
14 Correct 29 ms 49236 KB Output is correct
15 Correct 31 ms 49212 KB Output is correct
16 Correct 31 ms 49200 KB Output is correct
17 Correct 31 ms 49272 KB Output is correct
18 Correct 37 ms 49240 KB Output is correct
19 Correct 31 ms 49236 KB Output is correct
20 Correct 31 ms 49272 KB Output is correct
21 Correct 31 ms 49168 KB Output is correct
22 Correct 32 ms 49276 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 49228 KB Output is correct
2 Execution timed out 2075 ms 55076 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 49220 KB Output is correct
2 Execution timed out 2072 ms 58192 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2066 ms 55040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 49228 KB Output is correct
2 Correct 21 ms 49220 KB Output is correct
3 Correct 21 ms 49184 KB Output is correct
4 Correct 20 ms 49252 KB Output is correct
5 Correct 21 ms 49200 KB Output is correct
6 Correct 25 ms 49132 KB Output is correct
7 Correct 20 ms 49216 KB Output is correct
8 Correct 20 ms 49236 KB Output is correct
9 Correct 21 ms 49236 KB Output is correct
10 Correct 21 ms 49228 KB Output is correct
11 Correct 20 ms 49252 KB Output is correct
12 Correct 20 ms 49236 KB Output is correct
13 Correct 30 ms 49192 KB Output is correct
14 Correct 29 ms 49236 KB Output is correct
15 Correct 31 ms 49212 KB Output is correct
16 Correct 31 ms 49200 KB Output is correct
17 Correct 31 ms 49272 KB Output is correct
18 Correct 37 ms 49240 KB Output is correct
19 Correct 31 ms 49236 KB Output is correct
20 Correct 31 ms 49272 KB Output is correct
21 Correct 31 ms 49168 KB Output is correct
22 Correct 32 ms 49276 KB Output is correct
23 Correct 691 ms 50188 KB Output is correct
24 Correct 676 ms 50184 KB Output is correct
25 Correct 652 ms 50304 KB Output is correct
26 Correct 647 ms 50188 KB Output is correct
27 Correct 642 ms 50200 KB Output is correct
28 Correct 685 ms 50188 KB Output is correct
29 Correct 659 ms 50312 KB Output is correct
30 Correct 640 ms 50292 KB Output is correct
31 Correct 850 ms 50956 KB Output is correct
32 Correct 740 ms 50184 KB Output is correct
33 Correct 677 ms 50184 KB Output is correct
34 Correct 657 ms 50312 KB Output is correct
35 Correct 711 ms 50184 KB Output is correct
36 Correct 725 ms 50300 KB Output is correct
37 Correct 692 ms 50288 KB Output is correct
38 Correct 651 ms 50292 KB Output is correct

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 49228 KB Output is correct
2 Correct 21 ms 49220 KB Output is correct
3 Correct 21 ms 49184 KB Output is correct
4 Correct 20 ms 49252 KB Output is correct
5 Correct 21 ms 49200 KB Output is correct
6 Correct 25 ms 49132 KB Output is correct
7 Correct 20 ms 49216 KB Output is correct
8 Correct 20 ms 49236 KB Output is correct
9 Correct 21 ms 49236 KB Output is correct
10 Correct 21 ms 49228 KB Output is correct
11 Correct 20 ms 49252 KB Output is correct
12 Correct 20 ms 49236 KB Output is correct
13 Correct 30 ms 49192 KB Output is correct
14 Correct 29 ms 49236 KB Output is correct
15 Correct 31 ms 49212 KB Output is correct
16 Correct 31 ms 49200 KB Output is correct
17 Correct 31 ms 49272 KB Output is correct
18 Correct 37 ms 49240 KB Output is correct
19 Correct 31 ms 49236 KB Output is correct
20 Correct 31 ms 49272 KB Output is correct
21 Correct 31 ms 49168 KB Output is correct
22 Correct 32 ms 49276 KB Output is correct
23 Execution timed out 2075 ms 55076 KB Time limit exceeded
24 Halted 0 ms 0 KB -