oj.uz

Submission #749199

# Submission time Handle Problem Language Result Execution time Memory
749199 2023-05-27T14:13:54 Z SanguineChameleon Sequence (APIO23_sequence) C++17
28 / 100
 213 ms 127336 KB 
#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;

struct node {
	int mi, mx, lazy;

	node(): mi(0), mx(0), lazy(0) {};
	
	node(int _mi, int _mx): mi(_mi), mx(_mx), lazy(0) {};
};

const int maxn = 5e5 + 20;
int a[maxn];
vector<int> pos[maxn];
vector<node> pref[maxn];
vector<node> suf[maxn];
node tree[maxn];
int n;

node merge(node L, node R) {
	return node(min(L.mi, R.mi), max(L.mx, R.mx));
}

void build(int id, int lt, int rt) {
	if (lt == rt) {
		tree[id] = node(lt, lt);
		return;
	}
	int mt = (lt + rt) / 2;
	build(id * 2, lt, mt);
	build(id * 2 + 1, mt + 1, rt);
	tree[id] = merge(tree[id * 2], tree[id * 2 + 1]);
}

void push(int id) {
	tree[id * 2].lazy += tree[id].lazy;
	tree[id * 2].mi += tree[id].lazy;
	tree[id * 2].mx += tree[id].lazy;
	tree[id * 2 + 1].lazy += tree[id].lazy;
	tree[id * 2 + 1].mi += tree[id].lazy;
	tree[id * 2 + 1].mx += tree[id].lazy;
	tree[id].lazy = 0;
}


void update(int id, int lt, int rt, int ql, int qr) {
	if (lt == ql && rt == qr) {
		tree[id].lazy -= 2;
		tree[id].mi -= 2;
		tree[id].mx -= 2;
		return;
	}
	push(id);
	int mt = (lt + rt) / 2;
	if (qr <= mt) {
		update(id * 2, lt, mt, ql, qr);
	}
	else if (ql >= mt + 1) {
		update(id * 2 + 1, mt + 1, rt, ql, qr);
	}
	else {
		update(id * 2, lt, mt, ql, mt);
		update(id * 2 + 1, mt + 1, rt, mt + 1, qr);
	}
	tree[id] = merge(tree[id * 2], tree[id * 2 + 1]);
}

node get(int id, int lt, int rt, int ql, int qr) {
	if (lt == ql && rt == qr) {
		return tree[id];
	}
	push(id);
	int mt = (lt + rt) / 2;
	if (qr <= mt) {
		return get(id * 2, lt, mt, ql, qr);
	}
	else if (ql >= mt + 1) {
		return get(id * 2 + 1, mt + 1, rt, ql, qr);
	}
	else {
		return merge(get(id * 2, lt, mt, ql, mt), get(id * 2 + 1, mt + 1, rt, mt + 1, qr));
	}
}

bool check(int k) {
	for (int i = 1; i <= n; i++) {
		for (int j = k - 1; j < (int)pos[i].size(); j++) {
			int lt = max(0, suf[i][j].mi - pref[i][j - (k - 1)].mx);
			int rt = min(k * 2, suf[i][j].mx - pref[i][j - (k - 1)].mi);
			if (lt <= rt) {
				return true;
			}
		}
	}
	return false;
}

int sequence(int _N, vector<int> _A) {
	n = _N;
	for (int i = 1; i <= n; i++) {
		a[i] = _A[i - 1];
	}
	for (int i = 1; i <= n; i++) {
		pos[a[i]].push_back(i);
	}
	build(1, 0, n);
	for (int i = 1; i <= n; i++) {
		for (auto p: pos[i]) {
			pref[i].push_back(get(1, 0, n, 0, p - 1));
			suf[i].push_back(get(1, 0, n, p, n));
		}
		for (auto p: pos[i]) {
			update(1, 0, n, p, n);
		}
	}
	int res = 1;
	int lt = 1;
	int rt = n;
	while (lt <= rt) {
		int mt = (lt + rt) / 2;
		if (check(mt)) {
			res = mt;
			lt = mt + 1;
		}
		else {
			rt = mt - 1;
		}
	}
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 41300 KB Output is correct
2 Correct 22 ms 41328 KB Output is correct
3 Correct 21 ms 41336 KB Output is correct
4 Correct 24 ms 41368 KB Output is correct
5 Correct 21 ms 41300 KB Output is correct
6 Correct 21 ms 41408 KB Output is correct
7 Correct 27 ms 41364 KB Output is correct
8 Correct 26 ms 41400 KB Output is correct
9 Correct 22 ms 41300 KB Output is correct
10 Correct 25 ms 41316 KB Output is correct
11 Correct 21 ms 41356 KB Output is correct
12 Correct 22 ms 41380 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 41300 KB Output is correct
2 Correct 22 ms 41328 KB Output is correct
3 Correct 21 ms 41336 KB Output is correct
4 Correct 24 ms 41368 KB Output is correct
5 Correct 21 ms 41300 KB Output is correct
6 Correct 21 ms 41408 KB Output is correct
7 Correct 27 ms 41364 KB Output is correct
8 Correct 26 ms 41400 KB Output is correct
9 Correct 22 ms 41300 KB Output is correct
10 Correct 25 ms 41316 KB Output is correct
11 Correct 21 ms 41356 KB Output is correct
12 Correct 22 ms 41380 KB Output is correct
13 Correct 22 ms 41556 KB Output is correct
14 Correct 21 ms 41476 KB Output is correct
15 Correct 21 ms 41388 KB Output is correct
16 Correct 25 ms 41476 KB Output is correct
17 Correct 23 ms 41428 KB Output is correct
18 Correct 23 ms 41604 KB Output is correct
19 Correct 28 ms 41552 KB Output is correct
20 Correct 25 ms 41556 KB Output is correct
21 Correct 23 ms 41552 KB Output is correct
22 Correct 24 ms 41504 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 41300 KB Output is correct
2 Runtime error 134 ms 115804 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 41328 KB Output is correct
2 Runtime error 132 ms 100196 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 213 ms 127336 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 41300 KB Output is correct
2 Correct 22 ms 41328 KB Output is correct
3 Correct 21 ms 41336 KB Output is correct
4 Correct 24 ms 41368 KB Output is correct
5 Correct 21 ms 41300 KB Output is correct
6 Correct 21 ms 41408 KB Output is correct
7 Correct 27 ms 41364 KB Output is correct
8 Correct 26 ms 41400 KB Output is correct
9 Correct 22 ms 41300 KB Output is correct
10 Correct 25 ms 41316 KB Output is correct
11 Correct 21 ms 41356 KB Output is correct
12 Correct 22 ms 41380 KB Output is correct
13 Correct 22 ms 41556 KB Output is correct
14 Correct 21 ms 41476 KB Output is correct
15 Correct 21 ms 41388 KB Output is correct
16 Correct 25 ms 41476 KB Output is correct
17 Correct 23 ms 41428 KB Output is correct
18 Correct 23 ms 41604 KB Output is correct
19 Correct 28 ms 41552 KB Output is correct
20 Correct 25 ms 41556 KB Output is correct
21 Correct 23 ms 41552 KB Output is correct
22 Correct 24 ms 41504 KB Output is correct
23 Correct 121 ms 47452 KB Output is correct
24 Correct 127 ms 47428 KB Output is correct
25 Correct 111 ms 47516 KB Output is correct
26 Correct 83 ms 46212 KB Output is correct
27 Correct 83 ms 46292 KB Output is correct
28 Correct 88 ms 46156 KB Output is correct
29 Correct 94 ms 44660 KB Output is correct
30 Correct 107 ms 44820 KB Output is correct
31 Correct 77 ms 45596 KB Output is correct
32 Correct 90 ms 49820 KB Output is correct
33 Correct 107 ms 47064 KB Output is correct
34 Correct 110 ms 47108 KB Output is correct
35 Correct 101 ms 46976 KB Output is correct
36 Incorrect 98 ms 46948 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 41300 KB Output is correct
2 Correct 22 ms 41328 KB Output is correct
3 Correct 21 ms 41336 KB Output is correct
4 Correct 24 ms 41368 KB Output is correct
5 Correct 21 ms 41300 KB Output is correct
6 Correct 21 ms 41408 KB Output is correct
7 Correct 27 ms 41364 KB Output is correct
8 Correct 26 ms 41400 KB Output is correct
9 Correct 22 ms 41300 KB Output is correct
10 Correct 25 ms 41316 KB Output is correct
11 Correct 21 ms 41356 KB Output is correct
12 Correct 22 ms 41380 KB Output is correct
13 Correct 22 ms 41556 KB Output is correct
14 Correct 21 ms 41476 KB Output is correct
15 Correct 21 ms 41388 KB Output is correct
16 Correct 25 ms 41476 KB Output is correct
17 Correct 23 ms 41428 KB Output is correct
18 Correct 23 ms 41604 KB Output is correct
19 Correct 28 ms 41552 KB Output is correct
20 Correct 25 ms 41556 KB Output is correct
21 Correct 23 ms 41552 KB Output is correct
22 Correct 24 ms 41504 KB Output is correct
23 Runtime error 134 ms 115804 KB Execution killed with signal 11
24 Halted 0 ms 0 KB -