oj.uz

답안 #631064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631064 2022-08-17T16:09:52 Z rainboy 송신탑 (IOI22_towers) C++17
18 / 100
 1158 ms 4184 KB 
#include "towers.h"
#include <vector>

using namespace std;

const int N = 100000;

int abs_(int a) { return a > 0 ? a : -a; }
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 aa[N], ii[N], ii_[N], ll[N], rr[N], pp[N], qq[N], n, p, k, k_, first;

void init(int n_, vi aa_) {
	n = n_;
	for (int i = 0; i < n; i++)
		aa[i] = aa_[i];
	p = 0;
	while (p < n - 1 && aa[p] < aa[p + 1])
		p++;
	for (int i = p + 1; i < n; i++)
		if (aa[i - 1] < aa[i]) {
			p = -1;
			break;
		}
	first = 1;
	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]);
	k = 0;
	while (cnt) {
		int i = pq_remove_first(), j = qq[i];
		if (pp[i] == -1)
			pq_remove(j);
		else if (qq[j] == n)
			pq_remove(pp[i]);
		else {
			pq_remove(pp[i]), pq_remove(j);
			dd[pp[i]] = abs_(aa[qq[j]] - aa[pp[i]]), pq_add(pp[i]);
		}
		if (aa[i] > aa[j])
			ii[k++] = i;
		else
			dd[j] = dd[i], ii[k++] = j;
	}
}

int max_towers(int l, int r, int d) {
	if (p != -1)
		return l < p && p < r && aa[p] - aa[l] >= d && aa[p] - aa[r] >= d ? 2 : 1;
	else if (l == 0 && r == n - 1) {
		int lower = -1, upper = k;
		while (upper - lower > 1) {
			int h = (lower + upper) / 2;
			if (dd[ii[h]] < d)
				lower = h;
			else
				upper = h;
		}
		return k - upper + 1;
	} else {
		if (first) {
			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 if (aa[i] - aa[ii_[k_ - 1]] >= d)
						ii_[k_++] = i;
				} else {
					if (aa[ii_[k_ - 1]] < aa[i])
						ii_[k_ - 1] = i;
					else if (aa[ii_[k_ - 1]] - aa[i] >= d)
						ii_[k_++] = i;
				}
			for (int h = 1; h < k_ - 1; h += 2) {
				for (int i = ii_[h] - 1; i >= 0; i--)
					if (aa[ii_[h]] - aa[i] >= d) {
						ll[h / 2] = i;
						break;
					}
				for (int i = ii_[h] + 1; i < n; i++)
					if (aa[ii_[h]] - aa[i] >= d) {
						rr[h / 2] = i;
						break;
					}
			}
			k_ = (k_ - 1) / 2;
			first = 0;
		}
		int lower, upper;
		lower = -1, upper = k_;
		while (upper - lower > 1) {
			int h = (lower + upper) / 2;
			if (l <= ll[h])
				upper = h;
			else
				lower = h;
		}
		l = upper;
		lower = -1, upper = k_;
		while (upper - lower > 1) {
			int h = (lower + upper) / 2;
			if (rr[h] <= r)
				lower = h;
			else
				upper = h;
		}
		r = lower;
		return max(r - l + 1, 0) + 1;
	}
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 459 ms 976 KB Output is correct
2 Correct 664 ms 1440 KB Output is correct
3 Correct 618 ms 1472 KB Output is correct
4 Correct 786 ms 1360 KB Output is correct
5 Correct 734 ms 1352 KB Output is correct
6 Correct 569 ms 1568 KB Output is correct
7 Correct 830 ms 1440 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 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 0 ms 336 KB Output is correct
12 Correct 0 ms 208 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 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Incorrect 0 ms 336 KB 1st lines differ - on the 1st token, expected: '34', found: '1'
26 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 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 0 ms 336 KB Output is correct
12 Correct 0 ms 208 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 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Incorrect 0 ms 336 KB 1st lines differ - on the 1st token, expected: '34', found: '1'
26 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 3648 KB Output is correct
2 Correct 946 ms 3680 KB Output is correct
3 Correct 902 ms 3612 KB Output is correct
4 Correct 1029 ms 4184 KB Output is correct
5 Correct 1077 ms 4160 KB Output is correct
6 Correct 1158 ms 4116 KB Output is correct
7 Correct 883 ms 4176 KB Output is correct
8 Correct 533 ms 1352 KB Output is correct
9 Correct 717 ms 1488 KB Output is correct
10 Correct 805 ms 1428 KB Output is correct
11 Correct 810 ms 1432 KB Output is correct
12 Correct 778 ms 1432 KB Output is correct
13 Correct 929 ms 1488 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 36 ms 3620 KB Output is correct
18 Correct 54 ms 4184 KB Output is correct
19 Correct 62 ms 4180 KB Output is correct
20 Correct 12 ms 1444 KB Output is correct
21 Correct 11 ms 1432 KB Output is correct
22 Correct 32 ms 3488 KB Output is correct
23 Correct 45 ms 3744 KB Output is correct
24 Correct 49 ms 3784 KB Output is correct
25 Correct 16 ms 1444 KB Output is correct
26 Correct 10 ms 1480 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 336 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 1 ms 336 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 311 ms 1104 KB 1st lines differ - on the 1st token, expected: '7197', found: '7428'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 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 0 ms 336 KB Output is correct
12 Correct 0 ms 208 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 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Incorrect 0 ms 336 KB 1st lines differ - on the 1st token, expected: '34', found: '1'
26 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 459 ms 976 KB Output is correct
2 Correct 664 ms 1440 KB Output is correct
3 Correct 618 ms 1472 KB Output is correct
4 Correct 786 ms 1360 KB Output is correct
5 Correct 734 ms 1352 KB Output is correct
6 Correct 569 ms 1568 KB Output is correct
7 Correct 830 ms 1440 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 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 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 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 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Incorrect 0 ms 336 KB 1st lines differ - on the 1st token, expected: '34', found: '1'
36 Halted 0 ms 0 KB -