oj.uz

답안 #1039831

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039831 2024-07-31T10:03:41 Z AmirAli_H1 식물 비교 (IOI20_plants) C++17
100 / 100
 681 ms 195044 KB 
// In the name of Allah

#include <bits/stdc++.h>
#include "plants.h"
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct node {
	ll lazy; pll min;
};

const int maxn = 2e5 + 7;
const int maxlg = 20;
const ll oo = 1e9 + 7;

int n, k;
int A[maxn], val[maxn];
set<int> st, stx; node t[4 * maxn];
int val1[maxn][maxlg], val2[maxn][maxlg];
pll up1[maxn][maxlg], up2[maxn][maxlg];
set<pii> stw; int arr[maxn];

bool cmp(int i, int j) {
	return (val[i] > val[j]);
}

void build(int v, int tl, int tr) {
	t[v].lazy = 0;
	if (tr - tl == 1) {
		t[v].min = Mp(A[tl], tl);
		return ;
	}
	int mid = (tl + tr) / 2;
	build(2 * v + 1, tl, mid); build(2 * v + 2, mid, tr);
	t[v].min = min(t[2 * v + 1].min, t[2 * v + 2].min); t[v].min.F += t[v].lazy;
}

void add_val(int v, int tl, int tr, int l, int r, ll x) {
	l = max(l, tl); r = min(r, tr);
	if (l >= tr || r <= tl) return ;
	if (l == tl && r == tr) {
		t[v].min.F += x; t[v].lazy += x;
		return ;
	}
	int mid = (tl + tr) / 2;
	add_val(2 * v + 1, tl, mid, l, r, x); add_val(2 * v + 2, mid, tr, l, r, x);
	t[v].min = min(t[2 * v + 1].min, t[2 * v + 2].min); t[v].min.F += t[v].lazy;
}

void checkx(int j) {
	stx.erase(j); int d = 0;
	auto it = st.lower_bound(j);
	if (it != st.begin()) {
		it--; d = (j - *it);
	}
	else d = (j - *st.rbegin() + n);
	if (d >= k) stx.insert(j);
}

void addx(int j) {
	st.insert(j); checkx(j);
	if (len(st) == 1) return ;
	auto it = st.upper_bound(j);
	if (it != st.end()) checkx(*it);
	else checkx(*st.begin());
}

bool ok1(int v, int x, int d) {
	ll res = 0;
	for (int j = maxlg - 1; j >= 0; j--) {
		if (val1[v][j] <= x) {
			res += up1[v][j].F;
			v = up1[v][j].S;
			if (res >= d) return 1;
		}
	}
	return (res >= d);
}

int ok2(int v, int x, int d) {
	ll res = 0;
	for (int j = maxlg - 1; j >= 0; j--) {
		if (val2[v][j] <= x) {
			res += up2[v][j].F;
			v = up2[v][j].S;
			if (res >= d) return 1;
		}
	}
	return (res >= d);
}

void delx(int j) {
	st.erase(j); stx.erase(j);
	if (len(st) == 0) return ;
	auto it = st.upper_bound(j);
	if (it != st.end()) checkx(*it);
	else checkx(*st.begin());
}

void init(int Kx, vector<int> Ax) {
	n = len(Ax); k = Kx;
	
	for (int i = 0; i < n; i++) A[i] = Ax[i];
	build(0, 0, n);
	
	int sz = 0;
	while (sz < n) {
		while (t[0].min.F == 0) {
			int j = t[0].min.S;
			add_val(0, 0, n, j, j + 1, oo);
			addx(j);
		}
		int j = *stx.begin(); val[j] = sz++;
		int x1 = min(j, k - 1), x2 = (k - 1) - x1;
		add_val(0, 0, n, j - x1, j, -1);
		add_val(0, 0, n, n - x2, n, -1);
		delx(j);
	}
	
	stw.clear();
	for (int j = 0; j < k; j++) stw.insert(Mp(val[j], j));
	for (int i = 0; i < n; i++) {
		int j = (i + k - 1) % n, r = -1;
		
		auto it = stw.upper_bound(Mp(val[i], oo));
		if (it != stw.end()) r = (*it).S;
		else r = i;
		up1[i][0] = Mp((r - i + n) % n, r);
		val1[i][0] = val[r];
		
		it = stw.upper_bound(Mp(val[j], oo));
		if (it != stw.end()) r = (*it).S;
		else r = j;
		up2[j][0] = Mp((j - r + n) % n, r);
		val2[j][0] = val[r];
		
		stw.erase(Mp(val[i], i));
		r = (i + k) % n;
		stw.insert(Mp(val[r], r));
	}
	
	iota(arr, arr + n, 0); sort(arr, arr + n, cmp);
	for (int i = 0; i < n; i++) {
		int v = arr[i];
		for (int j = 1; j < maxlg; j++) {
			int u = up1[v][j - 1].S;
			up1[v][j] = Mp(up1[v][j - 1].F + up1[u][j - 1].F, up1[u][j - 1].S);
			val1[v][j] = val1[u][j - 1];
			u = up2[v][j - 1].S;
			up2[v][j] = Mp(up2[v][j - 1].F + up2[u][j - 1].F, up2[u][j - 1].S);
			val2[v][j] = val2[u][j - 1];
		}
	}
	
	return ;
}

int compare_plants(int x, int y) {
	if (val[x] < val[y]) {
		int d1 = (y - x + n) % n, d2 = (x - y + n) % n;
		if (!ok1(x, val[y], d1) && !ok2(x, val[y], d2)) return 0;
	}
	else {
		int d1 = (x - y + n) % n, d2 = (y - x + n) % n;
		if (!ok1(y, val[x], d1) && !ok2(y, val[x], d2)) return 0;
	}
	
	if (val[x] < val[y]) return 1;
	else return -1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 20828 KB Output is correct
2 Correct 6 ms 20856 KB Output is correct
3 Correct 6 ms 20828 KB Output is correct
4 Correct 6 ms 20792 KB Output is correct
5 Correct 5 ms 20824 KB Output is correct
6 Correct 47 ms 24600 KB Output is correct
7 Correct 102 ms 41848 KB Output is correct
8 Correct 375 ms 189988 KB Output is correct
9 Correct 370 ms 189272 KB Output is correct
10 Correct 368 ms 189468 KB Output is correct
11 Correct 442 ms 190064 KB Output is correct
12 Correct 461 ms 189776 KB Output is correct
13 Correct 553 ms 194128 KB Output is correct
14 Correct 510 ms 184912 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 20824 KB Output is correct
2 Correct 5 ms 20828 KB Output is correct
3 Correct 5 ms 20828 KB Output is correct
4 Correct 5 ms 20828 KB Output is correct
5 Correct 5 ms 21084 KB Output is correct
6 Correct 8 ms 21760 KB Output is correct
7 Correct 51 ms 29720 KB Output is correct
8 Correct 6 ms 21088 KB Output is correct
9 Correct 8 ms 21956 KB Output is correct
10 Correct 50 ms 29688 KB Output is correct
11 Correct 70 ms 29524 KB Output is correct
12 Correct 69 ms 29776 KB Output is correct
13 Correct 49 ms 29784 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 20824 KB Output is correct
2 Correct 5 ms 20828 KB Output is correct
3 Correct 5 ms 20828 KB Output is correct
4 Correct 5 ms 20828 KB Output is correct
5 Correct 5 ms 21084 KB Output is correct
6 Correct 8 ms 21760 KB Output is correct
7 Correct 51 ms 29720 KB Output is correct
8 Correct 6 ms 21088 KB Output is correct
9 Correct 8 ms 21956 KB Output is correct
10 Correct 50 ms 29688 KB Output is correct
11 Correct 70 ms 29524 KB Output is correct
12 Correct 69 ms 29776 KB Output is correct
13 Correct 49 ms 29784 KB Output is correct
14 Correct 87 ms 42468 KB Output is correct
15 Correct 681 ms 191312 KB Output is correct
16 Correct 86 ms 42320 KB Output is correct
17 Correct 645 ms 191408 KB Output is correct
18 Correct 634 ms 189900 KB Output is correct
19 Correct 515 ms 190508 KB Output is correct
20 Correct 679 ms 195044 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 20824 KB Output is correct
2 Correct 4 ms 20828 KB Output is correct
3 Correct 59 ms 26964 KB Output is correct
4 Correct 496 ms 188048 KB Output is correct
5 Correct 472 ms 185680 KB Output is correct
6 Correct 482 ms 185392 KB Output is correct
7 Correct 550 ms 185908 KB Output is correct
8 Correct 621 ms 189780 KB Output is correct
9 Correct 401 ms 187216 KB Output is correct
10 Correct 442 ms 185680 KB Output is correct
11 Correct 562 ms 194132 KB Output is correct
12 Correct 505 ms 184916 KB Output is correct
13 Correct 669 ms 191568 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 20824 KB Output is correct
2 Correct 4 ms 20828 KB Output is correct
3 Correct 4 ms 20828 KB Output is correct
4 Correct 4 ms 20828 KB Output is correct
5 Correct 6 ms 20936 KB Output is correct
6 Correct 5 ms 21084 KB Output is correct
7 Correct 15 ms 22100 KB Output is correct
8 Correct 12 ms 22108 KB Output is correct
9 Correct 15 ms 22108 KB Output is correct
10 Correct 12 ms 22108 KB Output is correct
11 Correct 15 ms 22104 KB Output is correct
12 Correct 14 ms 22100 KB Output is correct
13 Correct 13 ms 22108 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 20824 KB Output is correct
2 Correct 4 ms 20824 KB Output is correct
3 Correct 4 ms 20828 KB Output is correct
4 Correct 4 ms 20828 KB Output is correct
5 Correct 6 ms 21712 KB Output is correct
6 Correct 502 ms 184152 KB Output is correct
7 Correct 515 ms 184404 KB Output is correct
8 Correct 520 ms 184968 KB Output is correct
9 Correct 637 ms 189004 KB Output is correct
10 Correct 441 ms 186452 KB Output is correct
11 Correct 507 ms 188428 KB Output is correct
12 Correct 427 ms 186960 KB Output is correct
13 Correct 487 ms 184912 KB Output is correct
14 Correct 459 ms 184400 KB Output is correct
15 Correct 545 ms 184916 KB Output is correct
16 Correct 427 ms 185684 KB Output is correct
17 Correct 457 ms 184400 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 20828 KB Output is correct
2 Correct 6 ms 20856 KB Output is correct
3 Correct 6 ms 20828 KB Output is correct
4 Correct 6 ms 20792 KB Output is correct
5 Correct 5 ms 20824 KB Output is correct
6 Correct 47 ms 24600 KB Output is correct
7 Correct 102 ms 41848 KB Output is correct
8 Correct 375 ms 189988 KB Output is correct
9 Correct 370 ms 189272 KB Output is correct
10 Correct 368 ms 189468 KB Output is correct
11 Correct 442 ms 190064 KB Output is correct
12 Correct 461 ms 189776 KB Output is correct
13 Correct 553 ms 194128 KB Output is correct
14 Correct 510 ms 184912 KB Output is correct
15 Correct 5 ms 20824 KB Output is correct
16 Correct 5 ms 20828 KB Output is correct
17 Correct 5 ms 20828 KB Output is correct
18 Correct 5 ms 20828 KB Output is correct
19 Correct 5 ms 21084 KB Output is correct
20 Correct 8 ms 21760 KB Output is correct
21 Correct 51 ms 29720 KB Output is correct
22 Correct 6 ms 21088 KB Output is correct
23 Correct 8 ms 21956 KB Output is correct
24 Correct 50 ms 29688 KB Output is correct
25 Correct 70 ms 29524 KB Output is correct
26 Correct 69 ms 29776 KB Output is correct
27 Correct 49 ms 29784 KB Output is correct
28 Correct 87 ms 42468 KB Output is correct
29 Correct 681 ms 191312 KB Output is correct
30 Correct 86 ms 42320 KB Output is correct
31 Correct 645 ms 191408 KB Output is correct
32 Correct 634 ms 189900 KB Output is correct
33 Correct 515 ms 190508 KB Output is correct
34 Correct 679 ms 195044 KB Output is correct
35 Correct 4 ms 20824 KB Output is correct
36 Correct 4 ms 20828 KB Output is correct
37 Correct 59 ms 26964 KB Output is correct
38 Correct 496 ms 188048 KB Output is correct
39 Correct 472 ms 185680 KB Output is correct
40 Correct 482 ms 185392 KB Output is correct
41 Correct 550 ms 185908 KB Output is correct
42 Correct 621 ms 189780 KB Output is correct
43 Correct 401 ms 187216 KB Output is correct
44 Correct 442 ms 185680 KB Output is correct
45 Correct 562 ms 194132 KB Output is correct
46 Correct 505 ms 184916 KB Output is correct
47 Correct 669 ms 191568 KB Output is correct
48 Correct 4 ms 20824 KB Output is correct
49 Correct 4 ms 20828 KB Output is correct
50 Correct 4 ms 20828 KB Output is correct
51 Correct 4 ms 20828 KB Output is correct
52 Correct 6 ms 20936 KB Output is correct
53 Correct 5 ms 21084 KB Output is correct
54 Correct 15 ms 22100 KB Output is correct
55 Correct 12 ms 22108 KB Output is correct
56 Correct 15 ms 22108 KB Output is correct
57 Correct 12 ms 22108 KB Output is correct
58 Correct 15 ms 22104 KB Output is correct
59 Correct 14 ms 22100 KB Output is correct
60 Correct 13 ms 22108 KB Output is correct
61 Correct 63 ms 26964 KB Output is correct
62 Correct 126 ms 41812 KB Output is correct
63 Correct 440 ms 186340 KB Output is correct
64 Correct 473 ms 185244 KB Output is correct
65 Correct 531 ms 185244 KB Output is correct
66 Correct 561 ms 185860 KB Output is correct
67 Correct 636 ms 189828 KB Output is correct
68 Correct 464 ms 187328 KB Output is correct
69 Correct 565 ms 189192 KB Output is correct
70 Correct 517 ms 187984 KB Output is correct
71 Correct 501 ms 185624 KB Output is correct
72 Correct 488 ms 185196 KB Output is correct
73 Correct 561 ms 185832 KB Output is correct
74 Correct 453 ms 185856 KB Output is correct
75 Correct 445 ms 185172 KB Output is correct