oj.uz

답안 #936436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936436 2024-03-01T19:26:15 Z EJIC_B_KEDAX 식물 비교 (IOI20_plants) C++17
100 / 100
 2196 ms 192960 KB 
#include <bits/stdc++.h>
#include "plants.h"

#define x first
#define y second

using ll = long long;
 
using namespace std;
 
const int LG = 18, N = 1 << LG;
int st1[2 * N], st2[2 * N], lz1[2 * N], lz2[2 * N], timer = 1, fndl[2 * N], fndl2[2 * N], used3[N], level[N], kk, nn;
pair<int, int> fnd[2 * N], fnd2[2 * N];
pair<int, ll> binupr[LG][N], binupl[LG][N];

void push(int i, int st[], int lz[]) {
	if (lz[i] != -1) {
		st[2 * i + 1] = lz[i];
		st[2 * i + 2] = lz[i];
		lz[2 * i + 1] = lz[i];
		lz[2 * i + 2] = lz[i];
		lz[i] = -1;
	}
}

void set_seg(int l, int r, int x, int st[], int lz[], int l1 = 0, int r1 = N - 1, int i = 0) {
	if (l1 >= l && r1 <= r) {
		st[i] = x;
		lz[i] = x;
		return;
	}
	if (l1 > r || r1 < l) {
		return;
	}
	push(i, st, lz);
	set_seg(l, r, x, st, lz, l1, (l1 + r1) / 2, 2 * i + 1);
	set_seg(l, r, x, st, lz, (l1 + r1) / 2 + 1, r1, 2 * i + 2);
	st[i] = min(st[2 * i + 1], st[2 * i + 2]);
}

int get(int ind, int st[], int lz[], int l1 = 0, int r1 = N - 1, int i = 0) {
	if (l1 == ind && r1 == ind) {
		return st[i];
	}
	if (l1 > ind || r1 < ind) {
		return INT32_MAX;
	}
	push(i, st, lz);
	return min(get(ind, st, lz, l1, (l1 + r1) / 2, 2 * i + 1), get(ind, st, lz, (l1 + r1) / 2 + 1, r1, 2 * i + 2));
}

void push(int i) {
	fnd[2 * i + 1].x += fndl[i];
	fnd[2 * i + 2].x += fndl[i];
	fndl[2 * i + 1] += fndl[i];
	fndl[2 * i + 2] += fndl[i];
	fndl[i] = 0;
}

void push1(int i) {
	fnd2[2 * i + 1].x += fndl2[i];
	fnd2[2 * i + 2].x += fndl2[i];
	fndl2[2 * i + 1] += fndl2[i];
	fndl2[2 * i + 2] += fndl2[i];
	fndl2[i] = 0;
}

void add_seg(int l, int r, int x, int l1 = 0, int r1 = N - 1, int i = 0) {
	if (l1 >= l && r1 <= r) {
		fnd[i].x += x;
		fndl[i] += x;
		return;
	}
	if (l1 > r || r1 < l) {
		return;
	}
	push(i);
	add_seg(l, r, x, l1, (l1 + r1) / 2, 2 * i + 1);
	add_seg(l, r, x, (l1 + r1) / 2 + 1, r1, 2 * i + 2);
	fnd[i] = min(fnd[2 * i + 1], fnd[2 * i + 2]);
}

pair<int, int> get_min(int l, int r, int l1 = 0, int r1 = N - 1, int i = 0) {
	if (l1 >= l && r1 <= r) {
		return fnd[i];
	}
	if (l1 > r || r1 < l) {
		return {INT32_MAX, -1};
	}
	push(i);
	return min(get_min(l, r, l1, (l1 + r1) / 2, 2 * i + 1), get_min(l, r, (l1 + r1) / 2 + 1, r1, 2 * i + 2));
}

void add_seg1(int l, int r, int x, int l1 = 0, int r1 = N - 1, int i = 0) {
	if (l1 >= l && r1 <= r) {
		fnd2[i].x += x;
		fndl2[i] += x;
		return;
	}
	if (l1 > r || r1 < l) {
		return;
	}
	push1(i);
	add_seg1(l, r, x, l1, (l1 + r1) / 2, 2 * i + 1);
	add_seg1(l, r, x, (l1 + r1) / 2 + 1, r1, 2 * i + 2);
	fnd2[i] = min(fnd2[2 * i + 1], fnd2[2 * i + 2]);
}

pair<int, int> get_min1(int l, int r, int l1 = 0, int r1 = N - 1, int i = 0) {
	if (l1 >= l && r1 <= r) {
		return fnd2[i];
	}
	if (l1 > r || r1 < l) {
		return {INT32_MAX, -1};
	}
	push1(i);
	return min(get_min1(l, r, l1, (l1 + r1) / 2, 2 * i + 1), get_min1(l, r, (l1 + r1) / 2 + 1, r1, 2 * i + 2));
}

void init(int k, vector<int> r) {
	kk = k;
    int n = r.size();
    nn = n;
    int ok = 0;
    for (int i = 0; i < 2 * N; i++) {
    	st1[i] = -1;
    	st2[i] = -1;
    	lz1[i] = -1;
    	lz2[i] = -1;
    }
    for (int i = 0; i < N; i++) {
    	fnd[i + N - 1].y = i;
    	fnd2[i + N - 1].y = i;
    	level[i] = n;
    }
    for (int i = 0; i < n; i++) {
    	add_seg(i, i, r[i]);
    	add_seg1(i, i, r[i]);
		if (r[i] == 0) {
			used3[i] = 1;
			if (i + k > n) {
				add_seg(i + 1, n - 1, 1);
				add_seg(0, i + k - n - 1, 1);
			} else {
				add_seg(i + 1, i + k - 1, 1);
			}
		}
    }
    while (ok < n) {
    	auto [value, i] = get_min(0, n - 1);
    	if (value) {
    		exit(1);
    	}
    	int tmp1 = get(i, st1, lz1), tmp2 = get(i, st2, lz2);
    	if (tmp1 != -1) {
    		level[i] = min(level[i], level[tmp1] - 1);
    	}
    	if (tmp2 != -1) {
    		level[i] = min(level[i], level[tmp2] - 1);
    	}
    	vector<int> z;
        if (i + k - 1 < n) {
    		set_seg(i + 1, i + k - 1, i, st2, lz2);
    		add_seg(i + 1, i + k - 1, -1);
    	} else {
    		set_seg(i + 1, n - 1, i, st2, lz2);
    		set_seg(0, i + k - 1 - n, i, st2, lz2);
    		add_seg(i + 1, n - 1, -1);
    		add_seg(0, i + k - 1 - n, -1);
    	}
    	if (i >= k - 1) {
    		add_seg(i - k + 1, i - 1, -1);
    		add_seg1(i - k + 1, i - 1, -1);
    		int left = i - k + 1;
    		while (left <= i - 1 && !get_min1(left, i - 1).x) {
    			z.push_back(get_min1(left, i - 1).y);
    			assert(left <= z.back());
    			left = z.back() + 1;
    		}
    		set_seg(i - k + 1, i - 1, i, st1, lz1);
    	} else {
    		add_seg(0, i - 1, -1);
    		add_seg1(0, i - 1, -1);
    		set_seg(0, i - 1, i, st1, lz1);
    		add_seg(n + 1 - k + i, n - 1, -1);
    		add_seg1(n + 1 - k + i, n - 1, -1);
    		set_seg(n + 1 - k + i, n - 1, i, st1, lz1);
    		int left = 0;
    		while (left <= i - 1 && !get_min1(left, i - 1).x) {
    			z.push_back(get_min1(left, i - 1).y);
    			assert(left <= z.back());
    			left = z.back() + 1;
    		}
    		left = n + 1 - k + i;
    		while (left <= n - 1 && !get_min1(left, n - 1).x) {
    			z.push_back(get_min1(left, n - 1).y);
    			assert(left <= z.back());
    			left = z.back() + 1;
    		}
    	}
    	for (int j : z) {
    		if (!used3[j]) {
				if (j + k > n) {
					add_seg(j + 1, n - 1, 1);
					add_seg(0, j + k - n - 1, 1);
				} else {
					add_seg(j + 1, j + k - 1, 1);
				}
				used3[j] = 1;
			}
		}
        add_seg(i, i, INT32_MAX / 2);
        add_seg1(i, i, INT32_MAX / 2);
    	ok++;
    }
    set<pair<int, int>> st1;
    set<pair<int, int>> st2;
    for (int i = n - k + 1; i < n; i++) {
    	st1.emplace(-level[i], i);
    }
    for (int i = 1; i < k; i++) {
    	st2.emplace(-level[i], i);
    }
    for (int i = 0; i < n; i++) {
    	auto lb1 = st1.lower_bound({-level[i], N});
    	if (lb1 == st1.end()) {
    		binupl[0][i].x = i;
    	} else {
    		binupl[0][i].x = (*lb1).y;
    	}
    	st1.erase({-level[(i - k + 1 + n) % n], (i - k + 1 + n) % n});
    	st1.emplace(-level[i], i);
    	binupl[0][i].y = i - binupl[0][i].x;
    	if (binupl[0][i].y < 0) {
    		binupl[0][i].y += n;
    	}
    	auto lb2 = st2.lower_bound({-level[i], N});
    	if (lb2 == st2.end()) {
    		binupr[0][i].x = i;
    	} else {
    		binupr[0][i].x = (*lb2).y;
    	}
    	st2.erase({-level[i + 1], i + 1});
    	st2.emplace(-level[(i + k) % n], (i + k) % n);
    	binupr[0][i].y = binupr[0][i].x - i;
    	if (binupr[0][i].y < 0) {
    		binupr[0][i].y += n;
    	}
    }
    for (int l = 1; l < LG; l++) {
    	for (int i = 0; i < n; i++) {
    		binupl[l][i].x = binupl[l - 1][binupl[l - 1][i].x].x;
    		binupr[l][i].x = binupr[l - 1][binupr[l - 1][i].x].x;
    		binupl[l][i].y = binupl[l - 1][binupl[l - 1][i].x].y + binupl[l - 1][i].y;
    		binupr[l][i].y = binupr[l - 1][binupr[l - 1][i].x].y + binupr[l - 1][i].y;
    	}
    }
    for (int i = 0; i < n; i++) {
    	for (int l = 0; l < 1; l++) {
    		assert(binupl[l][i].y < n);
    		assert(binupr[l][i].y < n);
    	}
    }
}

bool try_compare(int x, int y) {
	ll dist = x - y;
	int nw = x;
	if (dist < 0) {
		dist += nn;
	}
	dist -= kk - 1;
	if (dist <= 0) {
		return true;
	} 
	for (int i = LG - 1; i >= 0; i--) {
		if (binupl[i][nw].y < dist) {
			dist -= binupl[i][nw].y;
			nw = binupl[i][nw].x;
		}
	}
	assert(dist > 0);
	dist -= binupl[0][nw].y;
	nw = binupl[0][nw].x;
	if (level[nw] >= level[y] && dist <= 0) {
		return true;
	}
	dist = y - x, nw = x;
	if (dist < 0) {
		dist += nn;
	}
	dist -= kk - 1;
	if (dist <= 0) {
		return true;
	}
	for (int i = LG - 1; i >= 0; i--) {
		if (binupr[i][nw].y < dist) {
			dist -= binupr[i][nw].y;
			nw = binupr[i][nw].x;
		}
	}
	assert(dist > 0);
	dist -= binupr[0][nw].y;
	nw = binupr[0][nw].x;
	if (level[nw] >= level[y] && dist <= 0) {
		return true;
	}
	return false;
}
 
int compare_plants(int x, int y) {
	if (try_compare(x, y) && level[x] > level[y]) {
		return 1;
	}
	if (try_compare(y, x) && level[y] > level[x]) {
		return -1;
	}
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 94548 KB Output is correct
2 Correct 13 ms 94556 KB Output is correct
3 Correct 12 ms 94552 KB Output is correct
4 Correct 11 ms 94556 KB Output is correct
5 Correct 12 ms 94556 KB Output is correct
6 Correct 135 ms 97312 KB Output is correct
7 Correct 513 ms 171856 KB Output is correct
8 Correct 1601 ms 174084 KB Output is correct
9 Correct 1566 ms 174160 KB Output is correct
10 Correct 1556 ms 174180 KB Output is correct
11 Correct 1484 ms 174020 KB Output is correct
12 Correct 1499 ms 174020 KB Output is correct
13 Correct 1297 ms 174068 KB Output is correct
14 Correct 1475 ms 174020 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 94556 KB Output is correct
2 Correct 11 ms 94600 KB Output is correct
3 Correct 12 ms 94640 KB Output is correct
4 Correct 13 ms 94640 KB Output is correct
5 Correct 13 ms 94608 KB Output is correct
6 Correct 19 ms 94812 KB Output is correct
7 Correct 98 ms 97820 KB Output is correct
8 Correct 14 ms 94552 KB Output is correct
9 Correct 20 ms 94636 KB Output is correct
10 Correct 97 ms 97876 KB Output is correct
11 Correct 100 ms 97796 KB Output is correct
12 Correct 111 ms 97872 KB Output is correct
13 Correct 102 ms 98048 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 94556 KB Output is correct
2 Correct 11 ms 94600 KB Output is correct
3 Correct 12 ms 94640 KB Output is correct
4 Correct 13 ms 94640 KB Output is correct
5 Correct 13 ms 94608 KB Output is correct
6 Correct 19 ms 94812 KB Output is correct
7 Correct 98 ms 97820 KB Output is correct
8 Correct 14 ms 94552 KB Output is correct
9 Correct 20 ms 94636 KB Output is correct
10 Correct 97 ms 97876 KB Output is correct
11 Correct 100 ms 97796 KB Output is correct
12 Correct 111 ms 97872 KB Output is correct
13 Correct 102 ms 98048 KB Output is correct
14 Correct 269 ms 172716 KB Output is correct
15 Correct 2189 ms 185792 KB Output is correct
16 Correct 232 ms 172728 KB Output is correct
17 Correct 2161 ms 185568 KB Output is correct
18 Correct 1289 ms 183564 KB Output is correct
19 Correct 1369 ms 183732 KB Output is correct
20 Correct 2009 ms 192960 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 94552 KB Output is correct
2 Correct 12 ms 94556 KB Output is correct
3 Correct 146 ms 97364 KB Output is correct
4 Correct 1494 ms 174124 KB Output is correct
5 Correct 1607 ms 174016 KB Output is correct
6 Correct 1824 ms 174276 KB Output is correct
7 Correct 1904 ms 175040 KB Output is correct
8 Correct 2122 ms 182720 KB Output is correct
9 Correct 1532 ms 174016 KB Output is correct
10 Correct 1547 ms 174072 KB Output is correct
11 Correct 1270 ms 174164 KB Output is correct
12 Correct 1659 ms 174088 KB Output is correct
13 Correct 1480 ms 179696 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 94552 KB Output is correct
2 Correct 12 ms 94556 KB Output is correct
3 Correct 12 ms 94552 KB Output is correct
4 Correct 12 ms 94556 KB Output is correct
5 Correct 12 ms 94556 KB Output is correct
6 Correct 16 ms 94556 KB Output is correct
7 Correct 43 ms 95228 KB Output is correct
8 Correct 28 ms 95164 KB Output is correct
9 Correct 36 ms 95316 KB Output is correct
10 Correct 30 ms 95312 KB Output is correct
11 Correct 41 ms 95316 KB Output is correct
12 Correct 37 ms 95316 KB Output is correct
13 Correct 23 ms 95312 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 94556 KB Output is correct
2 Correct 11 ms 94576 KB Output is correct
3 Correct 12 ms 94556 KB Output is correct
4 Correct 11 ms 94556 KB Output is correct
5 Correct 17 ms 94656 KB Output is correct
6 Correct 1253 ms 174016 KB Output is correct
7 Correct 1487 ms 174700 KB Output is correct
8 Correct 1662 ms 175116 KB Output is correct
9 Correct 2196 ms 182640 KB Output is correct
10 Correct 1484 ms 174012 KB Output is correct
11 Correct 1534 ms 175804 KB Output is correct
12 Correct 1234 ms 168384 KB Output is correct
13 Correct 1394 ms 174012 KB Output is correct
14 Correct 1554 ms 168384 KB Output is correct
15 Correct 1843 ms 169152 KB Output is correct
16 Correct 1119 ms 169332 KB Output is correct
17 Correct 1283 ms 174148 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 94548 KB Output is correct
2 Correct 13 ms 94556 KB Output is correct
3 Correct 12 ms 94552 KB Output is correct
4 Correct 11 ms 94556 KB Output is correct
5 Correct 12 ms 94556 KB Output is correct
6 Correct 135 ms 97312 KB Output is correct
7 Correct 513 ms 171856 KB Output is correct
8 Correct 1601 ms 174084 KB Output is correct
9 Correct 1566 ms 174160 KB Output is correct
10 Correct 1556 ms 174180 KB Output is correct
11 Correct 1484 ms 174020 KB Output is correct
12 Correct 1499 ms 174020 KB Output is correct
13 Correct 1297 ms 174068 KB Output is correct
14 Correct 1475 ms 174020 KB Output is correct
15 Correct 13 ms 94556 KB Output is correct
16 Correct 11 ms 94600 KB Output is correct
17 Correct 12 ms 94640 KB Output is correct
18 Correct 13 ms 94640 KB Output is correct
19 Correct 13 ms 94608 KB Output is correct
20 Correct 19 ms 94812 KB Output is correct
21 Correct 98 ms 97820 KB Output is correct
22 Correct 14 ms 94552 KB Output is correct
23 Correct 20 ms 94636 KB Output is correct
24 Correct 97 ms 97876 KB Output is correct
25 Correct 100 ms 97796 KB Output is correct
26 Correct 111 ms 97872 KB Output is correct
27 Correct 102 ms 98048 KB Output is correct
28 Correct 269 ms 172716 KB Output is correct
29 Correct 2189 ms 185792 KB Output is correct
30 Correct 232 ms 172728 KB Output is correct
31 Correct 2161 ms 185568 KB Output is correct
32 Correct 1289 ms 183564 KB Output is correct
33 Correct 1369 ms 183732 KB Output is correct
34 Correct 2009 ms 192960 KB Output is correct
35 Correct 11 ms 94552 KB Output is correct
36 Correct 12 ms 94556 KB Output is correct
37 Correct 146 ms 97364 KB Output is correct
38 Correct 1494 ms 174124 KB Output is correct
39 Correct 1607 ms 174016 KB Output is correct
40 Correct 1824 ms 174276 KB Output is correct
41 Correct 1904 ms 175040 KB Output is correct
42 Correct 2122 ms 182720 KB Output is correct
43 Correct 1532 ms 174016 KB Output is correct
44 Correct 1547 ms 174072 KB Output is correct
45 Correct 1270 ms 174164 KB Output is correct
46 Correct 1659 ms 174088 KB Output is correct
47 Correct 1480 ms 179696 KB Output is correct
48 Correct 12 ms 94552 KB Output is correct
49 Correct 12 ms 94556 KB Output is correct
50 Correct 12 ms 94552 KB Output is correct
51 Correct 12 ms 94556 KB Output is correct
52 Correct 12 ms 94556 KB Output is correct
53 Correct 16 ms 94556 KB Output is correct
54 Correct 43 ms 95228 KB Output is correct
55 Correct 28 ms 95164 KB Output is correct
56 Correct 36 ms 95316 KB Output is correct
57 Correct 30 ms 95312 KB Output is correct
58 Correct 41 ms 95316 KB Output is correct
59 Correct 37 ms 95316 KB Output is correct
60 Correct 23 ms 95312 KB Output is correct
61 Correct 247 ms 97360 KB Output is correct
62 Correct 559 ms 171640 KB Output is correct
63 Correct 2084 ms 174212 KB Output is correct
64 Correct 1468 ms 166256 KB Output is correct
65 Correct 1840 ms 174272 KB Output is correct
66 Correct 2037 ms 175040 KB Output is correct
67 Correct 2077 ms 182460 KB Output is correct
68 Correct 1733 ms 174012 KB Output is correct
69 Correct 1611 ms 181804 KB Output is correct
70 Correct 1613 ms 174020 KB Output is correct
71 Correct 1901 ms 168312 KB Output is correct
72 Correct 1918 ms 174272 KB Output is correct
73 Correct 2047 ms 175552 KB Output is correct
74 Correct 1941 ms 174012 KB Output is correct
75 Correct 1716 ms 174096 KB Output is correct