oj.uz

답안 #391364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
391364 2021-04-18T16:19:34 Z rainboy 벽 (IOI14_wall) C
100 / 100
 709 ms 84408 KB 
#include "wall.h"
#include <stdio.h>

#define N	2000000
#define N_	(1 << 21)	/* N_ = pow2(ceil(log2(N))) */
#define INF	0x3f3f3f3f

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

int aa[N_ * 2], bb[N_ * 2], lza[N_], lzb[N_], h_, n_;

void apply(int *a, int *b, int a_, int b_) {
	*a = min(max(*a, a_), b_), *b = min(max(*b, a_), b_);
}

void put(int i, int a, int b) {
	apply(&aa[i], &bb[i], a, b);
	if (i < n_)
		apply(&lza[i], &lzb[i], a, b);
}

void pus(int i) {
	if (lza[i] != 0 || lzb[i] != INF) {
		put(i << 1 | 0, lza[i], lzb[i]), put(i << 1 | 1, lza[i], lzb[i]);
		lza[i] = 0, lzb[i] = INF;
	}
}

void push(int i) {
	int h;

	for (h = h_; h > 0; h--)
		pus(i >> h);
}

void update(int l, int r, int a, int b) {
	int l_ = l += n_, r_ = r += n_;

	push(l_), push(r_);
	for ( ; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			put(l++, a, b);
		if ((r & 1) == 0)
			put(r--, a, b);
	}
}

void buildWall(int n, int q, int *tt, int *ll, int *rr, int *height, int *ans) {
	int h, i;

	h_ = 0;
	while (1 << h_ < n)
		h_++;
	n_ = 1 << h_;
	for (i = 0; i < n_; i++)
		lza[i] = 0, lzb[i] = INF;
	for (h = 0; h < q; h++)
		if (tt[h] == 1)
			update(ll[h], rr[h], height[h], INF);
		else
			update(ll[h], rr[h], 0, height[h]);
	for (i = 0; i < n_; i++)
		pus(i);
	for (i = 0; i < n; i++)
		ans[i] = aa[n_ + i];
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 7 ms 824 KB Output is correct
5 Correct 5 ms 844 KB Output is correct
6 Correct 5 ms 872 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 165 ms 13832 KB Output is correct
3 Correct 209 ms 7984 KB Output is correct
4 Correct 628 ms 20884 KB Output is correct
5 Correct 268 ms 21972 KB Output is correct
6 Correct 283 ms 20528 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 380 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 5 ms 848 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 159 ms 13904 KB Output is correct
9 Correct 203 ms 7996 KB Output is correct
10 Correct 657 ms 20964 KB Output is correct
11 Correct 274 ms 22084 KB Output is correct
12 Correct 268 ms 20420 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 167 ms 13884 KB Output is correct
15 Correct 41 ms 1960 KB Output is correct
16 Correct 631 ms 21164 KB Output is correct
17 Correct 265 ms 20524 KB Output is correct
18 Correct 259 ms 20528 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 7 ms 828 KB Output is correct
5 Correct 6 ms 844 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 173 ms 13948 KB Output is correct
9 Correct 201 ms 8004 KB Output is correct
10 Correct 615 ms 20944 KB Output is correct
11 Correct 271 ms 21960 KB Output is correct
12 Correct 267 ms 20420 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 164 ms 13856 KB Output is correct
15 Correct 34 ms 1972 KB Output is correct
16 Correct 622 ms 21408 KB Output is correct
17 Correct 288 ms 20580 KB Output is correct
18 Correct 306 ms 20624 KB Output is correct
19 Correct 688 ms 84340 KB Output is correct
20 Correct 679 ms 81912 KB Output is correct
21 Correct 709 ms 84360 KB Output is correct
22 Correct 686 ms 81960 KB Output is correct
23 Correct 687 ms 82040 KB Output is correct
24 Correct 686 ms 81948 KB Output is correct
25 Correct 686 ms 81844 KB Output is correct
26 Correct 684 ms 84404 KB Output is correct
27 Correct 707 ms 84408 KB Output is correct
28 Correct 696 ms 81856 KB Output is correct
29 Correct 686 ms 81980 KB Output is correct
30 Correct 709 ms 81948 KB Output is correct