oj.uz

답안 #823509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823509 2023-08-12T15:51:27 Z fatemetmhr 식물 비교 (IOI20_plants) C++17
32 / 100
 1154 ms 81596 KB 
// vaghan ide i nadaram chi benevisam dige :/


#include "plants.h"
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define fi     first
#define se     second
#define mp     make_pair
#define pb     push_back

typedef long long ll;

const int maxn5 = 2e5 + 10;
const int maxnt = 1e6 + 10;
const int lg    = 20;
const int maxn3 = 310;
const int mod   = 1e9 + 10;

int n, ind[maxn5], ed[2][lg][maxn5];
vector <int> av;

namespace seg3{

	pair <int, int> mn[maxnt];

	void build(int l, int r, int v){
		mn[v] = {maxn5, -1};
		if(r - l == 1)
			return;
		int mid = (l + r) >> 1;
		build(l, mid, v * 2);
		build(mid, r, v * 2 + 1);
	}

	void upd(int l, int r, int id, int val, int v){
		if(r - l == 1){
			mn[v] = {val, l};
			return;
		}
		int mid = (l + r) >> 1;
		if(id < mid)
			upd(l, mid, id, val, v * 2);
		else
			upd(mid, r, id, val, v * 2 + 1);
		mn[v] = min(mn[v * 2], mn[v * 2 + 1]);
	}

	pair <int, int> get_min(int l, int r, int lq, int rq, int v){
		if(rq <= l || r <= lq)
			return mp(maxn5, -1);
		if(lq <= l && r <= rq)
			return mn[v];
		int mid = (l + r) >> 1;
		return min(get_min(l, mid, lq, rq, v * 2), get_min(mid, r, lq, rq, v * 2 + 1));
	}
}



struct seg{

	ll lazy[maxnt];
	pair <ll, int> mn[maxnt];

	void upd(int l, int r, int id, int val, int v){
		if(r - l == 1){
			lazy[v] = 0;
			mn[v] = {val, l};
			return;
		}
		int mid = (l + r) >> 1;
		if(id < mid)
			upd(l, mid, id, val, v * 2);
		else
			upd(mid, r, id, val, v * 2 + 1);
		mn[v] = min(mn[v * 2], mn[v * 2 + 1]);
		mn[v].fi += lazy[v];
	}

	void add(int l, int r, int lq, int rq, int val, int v){
		if(rq <= l || r <= lq)
			return;
		if(lq <= l && r <= rq){
			lazy[v] += val;
			mn[v].fi += val;
			return;
		}
		int mid = (l + r) >> 1;
		add(l, mid, lq, rq, val, v * 2);
		add(mid, r, lq, rq, val, v * 2 + 1);
		mn[v] = min(mn[v * 2], mn[v * 2 + 1]);
		mn[v].fi += lazy[v];
	}
} seg1, seg2;

void init(int k, vector<int> r) {
	n = r.size();
	for(int i = 0; i < n; i++){
		seg1.upd(0, n, i, r[i], 1);
		seg2.upd(0, n, i, r[i], 1);
	}
	bool con = true;
	while(con){
		con = false;
		while(seg1.mn[1].fi == 0){
			con = true;
			int v = seg1.mn[1].se;
			//cout << "ok seg1 " << v << endl;
			seg1.upd(0, n, v, mod / 2, 1);
			if(v < n - 1)
				seg2.add(0, n, v + 1, min(n, v + k), 1, 1);
			if(v + k > n)
				seg2.add(0, n, 0, v + k - n, 1, 1);
		}
		if(seg2.mn[1].fi == 0){
			con = true;
			int v = seg2.mn[1].se;
			//cout << "ok seg2 " << v << ' ' << k << ' ' << (v - (k - 1)) << endl;
			av.pb(v);
			seg2.upd(0, n, v, mod / 2, 1);
			if(v < n - 1)
				seg2.add(0, n, v + 1, min(n, v + k), -1, 1);
			if(v + k > n)
				seg2.add(0, n, 0, v + k - n, -1, 1);
			if(v){
				seg1.add(0, n, max(0, v - (k - 1)), v, -1, 1);
				seg2.add(0, n, max(0, v - (k - 1)), v, -1, 1);
			}
			if(v - (k - 1) < 0){
				seg1.add(0, n, v - (k - 1) + n, n, -1, 1);
				seg2.add(0, n, v - (k - 1) + n, n, -1, 1);
			}
		}

	}
	//cout << av.size() << endl;
	reverse(all(av));
	for(int i = 0; i < n; i++){
		ind[av[i]] = i;
		//cout << av[i] << ' ';
	}
	//cout << endl;
	memset(ed, -1, sizeof ed);
	seg3::build(0, n, 1);
	for(int i = n - 1; i >= 0; i--){
		int v = av[i];
		pair <int, int> ans1 = {maxn5, -1}, ans2 = {maxn5, -1};
		if(v < n - 1)
			ans1 = seg3::get_min(0, n, v, min(n, v + k), 1);
		if(v + k > n)
			ans2 = seg3::get_min(0, n, 0, v + k - n, 1);
		ans1 = min(ans1, ans2);
		ed[0][0][v] = ans1.se;
		ans1 = ans2 = {maxn5, -1};
		if(v)
			ans1 = seg3::get_min(0, n, max(0, v - k + 1), v, 1);
		if(v - k + 1 < 0)
			ans2 = seg3::get_min(0, n, v - k + 1 + n, n, 1);
		ans1 = min(ans1, ans2);
		ed[1][0][v] = ans1.se;
		seg3::upd(0, n, v, i, 1);
	}
	for(int i = 1; i < lg; i++) for(int j = 0; j < n; j++){
		if(ed[0][i - 1][j] != -1)
			ed[0][i][j] = ed[0][i - 1][ed[0][i - 1][j]];
		if(ed[1][i - 1][j] != -1)
			ed[1][i][j] = ed[1][i - 1][ed[1][i - 1][j]];
	}
	return;
}

int find_first(int x, int lim, int ty){
	for(int i = lg - 1; i >= 0; i--)
		if(ed[ty][i][x] != -1 && ind[ed[ty][i][x]] <= lim)
			x = ed[ty][i][x];
	return x;
}

int compare_plants(int x, int y) {
	int sw = -1;
	if(ind[x] > ind[y]){
		swap(x, y);
		sw = 1;
	}
	int v = find_first(x, ind[y], 0);
	if((y - x + n) % n <= (v - x + n) % n)
		return sw;
	v = find_first(x, ind[y], 1);
	if((x - y + n) % n <= (x - v + n) % n)
		return sw;
	return 0;

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 62924 KB Output is correct
2 Correct 23 ms 62864 KB Output is correct
3 Correct 23 ms 62860 KB Output is correct
4 Correct 23 ms 62844 KB Output is correct
5 Correct 23 ms 62840 KB Output is correct
6 Correct 70 ms 66328 KB Output is correct
7 Correct 123 ms 67968 KB Output is correct
8 Correct 457 ms 79484 KB Output is correct
9 Correct 465 ms 79492 KB Output is correct
10 Correct 489 ms 79488 KB Output is correct
11 Correct 550 ms 79496 KB Output is correct
12 Correct 575 ms 79488 KB Output is correct
13 Correct 704 ms 79536 KB Output is correct
14 Correct 635 ms 79476 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 62928 KB Output is correct
2 Correct 28 ms 62844 KB Output is correct
3 Correct 23 ms 62924 KB Output is correct
4 Correct 23 ms 62968 KB Output is correct
5 Correct 24 ms 62872 KB Output is correct
6 Correct 27 ms 63100 KB Output is correct
7 Correct 97 ms 66872 KB Output is correct
8 Correct 25 ms 62996 KB Output is correct
9 Correct 31 ms 63044 KB Output is correct
10 Correct 98 ms 66852 KB Output is correct
11 Correct 104 ms 66844 KB Output is correct
12 Correct 91 ms 67000 KB Output is correct
13 Correct 97 ms 66948 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 62928 KB Output is correct
2 Correct 28 ms 62844 KB Output is correct
3 Correct 23 ms 62924 KB Output is correct
4 Correct 23 ms 62968 KB Output is correct
5 Correct 24 ms 62872 KB Output is correct
6 Correct 27 ms 63100 KB Output is correct
7 Correct 97 ms 66872 KB Output is correct
8 Correct 25 ms 62996 KB Output is correct
9 Correct 31 ms 63044 KB Output is correct
10 Correct 98 ms 66852 KB Output is correct
11 Correct 104 ms 66844 KB Output is correct
12 Correct 91 ms 67000 KB Output is correct
13 Correct 97 ms 66948 KB Output is correct
14 Correct 170 ms 68268 KB Output is correct
15 Correct 1055 ms 81460 KB Output is correct
16 Correct 199 ms 68300 KB Output is correct
17 Correct 1154 ms 81596 KB Output is correct
18 Correct 797 ms 81504 KB Output is correct
19 Correct 640 ms 81488 KB Output is correct
20 Correct 1090 ms 81496 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 62900 KB Output is correct
2 Correct 28 ms 62872 KB Output is correct
3 Incorrect 100 ms 66460 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 62920 KB Output is correct
2 Correct 22 ms 62932 KB Output is correct
3 Correct 26 ms 62824 KB Output is correct
4 Correct 28 ms 62900 KB Output is correct
5 Correct 29 ms 62932 KB Output is correct
6 Correct 30 ms 63016 KB Output is correct
7 Correct 36 ms 63892 KB Output is correct
8 Incorrect 49 ms 63828 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 62944 KB Output is correct
2 Correct 23 ms 62956 KB Output is correct
3 Correct 25 ms 62924 KB Output is correct
4 Correct 23 ms 62880 KB Output is correct
5 Incorrect 25 ms 62940 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 62924 KB Output is correct
2 Correct 23 ms 62864 KB Output is correct
3 Correct 23 ms 62860 KB Output is correct
4 Correct 23 ms 62844 KB Output is correct
5 Correct 23 ms 62840 KB Output is correct
6 Correct 70 ms 66328 KB Output is correct
7 Correct 123 ms 67968 KB Output is correct
8 Correct 457 ms 79484 KB Output is correct
9 Correct 465 ms 79492 KB Output is correct
10 Correct 489 ms 79488 KB Output is correct
11 Correct 550 ms 79496 KB Output is correct
12 Correct 575 ms 79488 KB Output is correct
13 Correct 704 ms 79536 KB Output is correct
14 Correct 635 ms 79476 KB Output is correct
15 Correct 24 ms 62928 KB Output is correct
16 Correct 28 ms 62844 KB Output is correct
17 Correct 23 ms 62924 KB Output is correct
18 Correct 23 ms 62968 KB Output is correct
19 Correct 24 ms 62872 KB Output is correct
20 Correct 27 ms 63100 KB Output is correct
21 Correct 97 ms 66872 KB Output is correct
22 Correct 25 ms 62996 KB Output is correct
23 Correct 31 ms 63044 KB Output is correct
24 Correct 98 ms 66852 KB Output is correct
25 Correct 104 ms 66844 KB Output is correct
26 Correct 91 ms 67000 KB Output is correct
27 Correct 97 ms 66948 KB Output is correct
28 Correct 170 ms 68268 KB Output is correct
29 Correct 1055 ms 81460 KB Output is correct
30 Correct 199 ms 68300 KB Output is correct
31 Correct 1154 ms 81596 KB Output is correct
32 Correct 797 ms 81504 KB Output is correct
33 Correct 640 ms 81488 KB Output is correct
34 Correct 1090 ms 81496 KB Output is correct
35 Correct 22 ms 62900 KB Output is correct
36 Correct 28 ms 62872 KB Output is correct
37 Incorrect 100 ms 66460 KB Output isn't correct
38 Halted 0 ms 0 KB -