oj.uz

Submission #631074

# Submission time Handle Problem Language Result Execution time Memory
631074 2022-08-17T16:36:54 Z rainboy Radio Towers (IOI22_towers) C++17
40 / 100
 1040 ms 22316 KB 
#include "towers.h"
#include <vector>

using namespace std;

const int N = 100000, L = 17, N_ = 1 << L, N1 = 1 + N * (L + 1), INF = 0x3f3f3f3f;	/* L = ceil(log2(N)) */

int abs_(int a) { return a > 0 ? a : -a; }
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

typedef vector<int> vi;

int dd[N], iq[N + 1], pq[N], cnt;

int lt(int i, int j) { return dd[i] < dd[j]; }

int p2(int p) {
	return (p *= 2) > cnt ? 0 : (p < cnt && lt(iq[p + 1], iq[p]) ? p + 1 : p);
}

void pq_up(int i) {
	int p, q, j;
	for (p = pq[i]; (q = p / 2) && lt(i, j = iq[q]); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}

void pq_dn(int i) {
	int p, q, j;
	for (p = pq[i]; (q = p2(p)) && lt(j = iq[q], i); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}

void pq_add(int i) {
	pq[i] = ++cnt, pq_up(i);
}

int pq_remove_first() {
	int i = iq[1], j = iq[cnt--];
	if (j != i)
		pq[j] = 1, pq_dn(j);
	pq[i] = 0;
	return i;
}

void pq_remove(int i) {
	int j = iq[cnt--];
	if (j != i)
		pq[j] = pq[i], pq_up(j), pq_dn(j);
	pq[i] = 0;
}

int st[N_ * 2], n_;

int query(int l, int r) {
	int x = INF;
	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			x = min(x, st[l++]);
		if ((r & 1) == 0)
			x = min(x, st[r--]);
	}
	return x;
}

int kk[N1], ll[N1], rr[N1], mn[N1], mx[N1], _ = 1;

int update_(int t, int l, int r, int i) {
	int t_ = _++;
	ll[t_] = ll[t], rr[t_] = rr[t], kk[t_] = kk[t] + 1, mn[t_] = min(mn[t], i), mx[t_] = max(mx[t], i);
	if (r - l > 1) {
		int m = (l + r) / 2;
		if (i < m)
			ll[t_] = update_(ll[t], l, m, i);
		else
			rr[t_] = update_(rr[t], m, r, i);
	}
	return t_;
}

int mn_, mx_, k_;

void query_(int t, int l, int r, int ql, int qr) {
	if (t == 0 || qr <= l || r <= ql)
		return;
	if (ql <= l && r <= qr) {
		mn_ = min(mn_, mn[t]), mx_ = max(mx_, mx[t]), k_ += kk[t];
		return;
	}
	int m = (l + r) / 2;
	query_(ll[t], l, m, ql, qr), query_(rr[t], m, r, ql, qr);
}

int aa[N], ii[N], tt[N + 1], pp[N], qq[N], n, k;

void init(int n1, vi aa_) {
	n = n1;
	for (int i = 0; i < n; i++)
		aa[i] = aa_[i];
	k = 0;
	ii[k++] = 0;
	for (int i = 1; i < n; i++)
		if (k % 2 != 0) {
			if (aa[ii[k - 1]] > aa[i])
				ii[k - 1] = i;
			else
				ii[k++] = i;
		} else {
			if (aa[ii[k - 1]] < aa[i])
				ii[k - 1] = i;
			else
				ii[k++] = i;
		}
	if (k % 2 == 0)
		k--;
	for (int h = 0; h < k; h++)
		pp[ii[h]] = h == 0 ? -1 : ii[h - 1], qq[ii[h]] = h + 1 == k ? n : ii[h + 1];
	for (int h = 0; h + 1 < k; h++)
		dd[ii[h]] = abs_(aa[ii[h + 1]] - aa[ii[h]]), pq_add(ii[h]);
	mn[0] = INF, mx[0] = -1;
	k = 0;
	while (cnt) {
		int i = pq_remove_first(), j = qq[i], tmp;
		if (pp[i] == -1) {
			pq_remove(j);
			pp[qq[j]] = -1;
		} else if (qq[j] == n) {
			pq_remove(pp[i]);
			qq[pp[i]] = n;
		} else {
			pq_remove(pp[i]), pq_remove(j);
			qq[pp[i]] = qq[j], pp[qq[j]] = pp[i];
			dd[pp[i]] = abs_(aa[qq[j]] - aa[pp[i]]), pq_add(pp[i]);
		}
		if (aa[i] < aa[j]) {
			tmp = i, i = j, j = tmp;
			dd[i] = dd[j];
		}
		ii[k++] = i;
	}
	for (int h = k - 1; h >= 0; h--)
		tt[h] = update_(h + 1 == k ? 0 : tt[h + 1], 0, n, ii[h]);
	n_ = 1;
	while (n_ < n)
		n_ <<= 1;
	for (int i = 0; i < n; i++)
		st[n_ + i] = aa[i];
	for (int i = n_ - 1; i > 0; i--)
		st[i] = min(st[i << 1 | 0], st[i << 1 | 1]);
}

int max_towers(int l, int r, int d) {
	int lower = -1, upper = k;
	while (upper - lower > 1) {
		int h = (lower + upper) / 2;
		if (dd[ii[h]] < d)
			lower = h;
		else
			upper = h;
	}
	mn_ = INF, mx_ = -1, k_ = 0;
	query_(tt[upper], 0, n, l, r);
	if (k_ == 0)
		return 1;
	else if (k_ == 1)
		return aa[mn_] - query(l, r) >= d ? 2 : 1;
	else
		return k_ - (aa[mn_] - query(l, mn_) >= d ? 0 : 1) - (aa[mx_] - query(mx_, r) >= d ? 0 : 1) + 1;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 312 ms 1488 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 2 ms 592 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 2 ms 592 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 33 ms 10252 KB Output is correct
37 Correct 44 ms 16152 KB Output is correct
38 Correct 42 ms 16084 KB Output is correct
39 Correct 60 ms 22180 KB Output is correct
40 Correct 62 ms 22256 KB Output is correct
41 Correct 59 ms 22204 KB Output is correct
42 Correct 70 ms 22256 KB Output is correct
43 Correct 15 ms 2340 KB Output is correct
44 Correct 10 ms 2336 KB Output is correct
45 Correct 11 ms 2468 KB Output is correct
46 Correct 10 ms 2456 KB Output is correct
47 Correct 52 ms 16072 KB Output is correct
48 Correct 61 ms 22156 KB Output is correct
49 Correct 66 ms 22180 KB Output is correct
50 Correct 17 ms 2340 KB Output is correct
51 Correct 12 ms 2512 KB Output is correct
52 Correct 41 ms 16048 KB Output is correct
53 Correct 57 ms 22176 KB Output is correct
54 Correct 57 ms 22200 KB Output is correct
55 Correct 10 ms 2336 KB Output is correct
56 Correct 12 ms 2492 KB Output is correct
57 Correct 42 ms 15640 KB Output is correct
58 Correct 55 ms 16156 KB Output is correct
59 Correct 54 ms 16156 KB Output is correct
60 Correct 59 ms 22196 KB Output is correct
61 Correct 58 ms 22192 KB Output is correct
62 Correct 61 ms 22256 KB Output is correct
63 Correct 61 ms 22252 KB Output is correct
64 Correct 12 ms 2356 KB Output is correct
65 Correct 19 ms 2336 KB Output is correct
66 Correct 11 ms 2460 KB Output is correct
67 Correct 11 ms 2480 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 975 ms 15944 KB 45626th lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 3792 KB Output is correct
2 Correct 1040 ms 16180 KB Output is correct
3 Correct 980 ms 16140 KB Output is correct
4 Correct 968 ms 22244 KB Output is correct
5 Correct 1024 ms 22168 KB Output is correct
6 Correct 978 ms 22228 KB Output is correct
7 Correct 950 ms 22216 KB Output is correct
8 Correct 698 ms 2384 KB Output is correct
9 Correct 882 ms 2352 KB Output is correct
10 Correct 823 ms 2464 KB Output is correct
11 Correct 767 ms 2464 KB Output is correct
12 Correct 49 ms 16108 KB Output is correct
13 Correct 59 ms 22252 KB Output is correct
14 Correct 57 ms 22176 KB Output is correct
15 Correct 12 ms 2384 KB Output is correct
16 Correct 12 ms 2468 KB Output is correct
17 Correct 44 ms 15664 KB Output is correct
18 Correct 43 ms 16156 KB Output is correct
19 Correct 43 ms 16200 KB Output is correct
20 Correct 66 ms 22216 KB Output is correct
21 Correct 59 ms 22172 KB Output is correct
22 Correct 61 ms 22156 KB Output is correct
23 Correct 62 ms 22316 KB Output is correct
24 Correct 11 ms 2376 KB Output is correct
25 Correct 16 ms 2336 KB Output is correct
26 Correct 14 ms 2456 KB Output is correct
27 Correct 11 ms 2468 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 1 ms 592 KB Output is correct
37 Correct 1 ms 592 KB Output is correct
38 Correct 1 ms 592 KB Output is correct
39 Correct 1 ms 592 KB Output is correct
40 Correct 0 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 0 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 2 ms 592 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 33 ms 10252 KB Output is correct
37 Correct 44 ms 16152 KB Output is correct
38 Correct 42 ms 16084 KB Output is correct
39 Correct 60 ms 22180 KB Output is correct
40 Correct 62 ms 22256 KB Output is correct
41 Correct 59 ms 22204 KB Output is correct
42 Correct 70 ms 22256 KB Output is correct
43 Correct 15 ms 2340 KB Output is correct
44 Correct 10 ms 2336 KB Output is correct
45 Correct 11 ms 2468 KB Output is correct
46 Correct 10 ms 2456 KB Output is correct
47 Correct 52 ms 16072 KB Output is correct
48 Correct 61 ms 22156 KB Output is correct
49 Correct 66 ms 22180 KB Output is correct
50 Correct 17 ms 2340 KB Output is correct
51 Correct 12 ms 2512 KB Output is correct
52 Correct 41 ms 16048 KB Output is correct
53 Correct 57 ms 22176 KB Output is correct
54 Correct 57 ms 22200 KB Output is correct
55 Correct 10 ms 2336 KB Output is correct
56 Correct 12 ms 2492 KB Output is correct
57 Correct 42 ms 15640 KB Output is correct
58 Correct 55 ms 16156 KB Output is correct
59 Correct 54 ms 16156 KB Output is correct
60 Correct 59 ms 22196 KB Output is correct
61 Correct 58 ms 22192 KB Output is correct
62 Correct 61 ms 22256 KB Output is correct
63 Correct 61 ms 22252 KB Output is correct
64 Correct 12 ms 2356 KB Output is correct
65 Correct 19 ms 2336 KB Output is correct
66 Correct 11 ms 2460 KB Output is correct
67 Correct 11 ms 2480 KB Output is correct
68 Incorrect 975 ms 15944 KB 45626th lines differ - on the 1st token, expected: '1', found: '2'
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 312 ms 1488 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -