oj.uz

답안 #603692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
603692 2022-07-24T09:48:51 Z gagik_2007 식물 비교 (IOI20_plants) C++17
32 / 100
 487 ms 14028 KB 
#include "plants.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <string>
using namespace std;

#define ff first
#define ss second

typedef long long ll;
typedef long double ld;

const int INF = 1e9 + 7;
ll n, k;
vector<int>a;
vector<int>cons0, cons1;
bool ent1 = false;
pair<int, int> t[800007];
int lazy[1600007];
vector<int>vals;

void push(int v) {
	lazy[2 * v] += lazy[v];
	lazy[2 * v + 1] += lazy[v];
	t[v].ff += lazy[v];
	lazy[v] = 0;
}

void build(int v, int tl, int tr) {
	if (tl == tr) {
		t[v] = { a[tl],tl };
	}
	else {
		int tm = (tl + tr) / 2;
		build(2 * v, tl, tm);
		build(2 * v + 1, tm + 1, tr);
		t[v] = min(t[2 * v], t[2 * v + 1]);
	}
}

pair<int, int> get_min(int v, int tl, int tr, int l, int r) {
	push(v);
	if (l > r)return { INF,INF };
	if (tl >= l && tr <= r)return t[v];
	else {
		int tm = (tl + tr) / 2;
		return min(get_min(2 * v, tl, tm, l, min(r, tm)),
			get_min(2 * v + 1, tm + 1, tr, max(l, tm + 1), r));
	}
}

void update(int v, int tl, int tr, int ind, int val) {
	push(v);
	if (tl == tr) {
		t[v].ff = val;
		//cout << "Updating: ";
		//cout << t[v].ff << " " << t[v].ss << endl;
	}
	else {
		int tm = (tl + tr) / 2;
		if (ind <= tm) {
			update(2 * v, tl, tm, ind, val);
		}
		else update(2 * v + 1, tm + 1, tr, ind, val);
		t[v] = min(t[2 * v], t[2 * v + 1]);
	}
}

void add_r(int v, int tl, int tr, int l, int r, int val) {
	push(v);
	if (l > r)return;
	if (tl >= l && tr <= r) {
		lazy[v] += val;
		push(v);
	}
	else {
		int tm = (tl + tr) / 2;
		add_r(2 * v, tl, tm, l, min(r, tm), val);
		add_r(2 * v + 1, tm + 1, tr, max(l, tm + 1), r, val);
		t[v] = min(t[2 * v], t[2 * v + 1]);
	}
}

int her(int x, int y) {
	if (y < x)y += n;
	return y - x;
}

void init(int K, vector<int> r) {
	n = r.size();
	k = K;
	a = r;
	if (k == 2) {
		ent1 = true;
		int cur0 = 0, cur1 = 0;
		int f1 = 0, f0 = 0;
		cons0.resize(n, 0);
		cons1.resize(n, 0);
		for (int i = 0; i < 2 * n; i++) {
			if (r[i % n] == 1) {
				if (cur0 != 0) {
					while (f0 != i % n) {
						cons0[f0] = cur0;
						f0++;
						cur0--;
						f0 %= n;
					}
					f1 = i % n;
				}
				cur1++;
			}
			else {
				if (cur1 != 0) {
					while (f1 != i % n) {
						cons1[f1] = cur1;
						f1++;
						cur1--;
						f1 %= n;
					}
					f0 = i % n;
				}
				cur0++;
			}
		}
		/*for (auto x : cons0) {
			cout << x << " ";
		}
		cout << endl;
		for (auto x : cons1) {
			cout << x << " ";
		}
		cout << endl;*/
	}
	else {
		build(1, 0, n - 1);
		vals.resize(n, 0);
		int curval = n;
		for (int i = 0; i < n; i++) {
			pair<int, int>mn, mn2;
			pair<int, int>mn1 = get_min(1, 0, n - 1, 0, n - 1);
			int vl = mn1.ss - k + 1;
			if (vl < 0) {
				mn2 = min(get_min(1, 0, n - 1, 0, mn1.ss - 1),
					get_min(1, 0, n - 1, vl + n, n - 1));
			}
			else {
				mn2 = get_min(1, 0, n - 1, vl, mn1.ss - 1);
			}
			if (mn1.ff == mn2.ff) {
				mn1 = mn2;
				vl = mn1.ss - k + 1;
				if (vl < 0) {
					mn2 = min(get_min(1, 0, n - 1, 0, mn1.ss - 1),
						get_min(1, 0, n - 1, vl + n, n - 1));
				}
				else {
					mn2 = get_min(1, 0, n - 1, vl, mn1.ss - 1);
				}
				if (mn1.ff == mn2.ff) {
					mn1 = mn2;
					vl = mn1.ss - k + 1;
					if (vl < 0) {
						mn2 = min(get_min(1, 0, n - 1, 0, mn1.ss - 1),
							get_min(1, 0, n - 1, vl + n, n - 1));
					}
					else {
						mn2 = get_min(1, 0, n - 1, vl, mn1.ss - 1);
					}
					if (mn1.ff == mn2.ff) {
						mn1 = mn2;
						vl = mn1.ss - k + 1;
						if (vl < 0) {
							mn2 = min(get_min(1, 0, n - 1, 0, mn1.ss - 1),
								get_min(1, 0, n - 1, vl + n, n - 1));
						}
						else {
							mn2 = get_min(1, 0, n - 1, vl, mn1.ss - 1);
						}
						if (mn1.ff == mn2.ff) {
							mn = mn2;
						}
						else {
							mn = mn1;
						}
					}
					else {
						mn = mn1;
					}
				}
				else {
					mn = mn1;
				}
			}
			else {
				mn = mn1;
			}
			update(1, 0, n - 1, mn.ss, INF);
			/*cout << "Min: ";
			cout << mn.ff << " " << mn.ss << endl;*/
			vl = mn.ss - k + 1;
			if (vl < 0) {
				add_r(1, 0, n - 1, 0, mn.ss, -1);
				add_r(1, 0, n - 1, vl + n, n - 1, -1);
			}
			else {
				add_r(1, 0, n - 1, vl, mn.ss, -1);
			}
			vals[mn.ss] = curval--;
			/*for (int i = 0; i < n; i++) {
				cout << get_min(1, 0, n - 1, i, i).ff << " " << 
					get_min(1, 0, n - 1, i, i).ss << "  ";
			}
			cout << endl;*/
		}
	}
}

int compare_plants(int x, int y) {
	if (ent1) {
		if (cons0[x] >= her(x, y) || cons1[y] >= her(y, x)) {
			return 1;
		}
		if (cons1[x] >= her(x, y) || cons0[y] >= her(y, x)) {
			return -1;
		}
		return 0;
	}
	else {
		if (vals[x] > vals[y])return 1;
		else return -1;
	}
}

/*
4 2 3
1 1 0 0
0 1
0 2
0 3

4 3 6 0 1 1 2 0 1 0 2 0 3 1 2 1 3 2 3
1 1 1 -1 1 1

7 4 7 0 2 1 2 1 3 0 0 2 0 4 0 6 5 3 4 6 6 4 6 5
1 -1 -1 -1 -1 1 1
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 52 ms 3032 KB Output is correct
7 Correct 57 ms 3512 KB Output is correct
8 Correct 82 ms 6516 KB Output is correct
9 Correct 71 ms 6504 KB Output is correct
10 Correct 69 ms 6504 KB Output is correct
11 Correct 77 ms 6520 KB Output is correct
12 Correct 74 ms 6520 KB Output is correct
13 Correct 68 ms 6492 KB Output is correct
14 Correct 68 ms 6524 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 59 ms 3380 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 52 ms 3472 KB Output is correct
11 Correct 60 ms 3324 KB Output is correct
12 Correct 50 ms 3580 KB Output is correct
13 Correct 61 ms 3440 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 59 ms 3380 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 52 ms 3472 KB Output is correct
11 Correct 60 ms 3324 KB Output is correct
12 Correct 50 ms 3580 KB Output is correct
13 Correct 61 ms 3440 KB Output is correct
14 Correct 79 ms 4464 KB Output is correct
15 Correct 458 ms 14008 KB Output is correct
16 Correct 90 ms 4388 KB Output is correct
17 Correct 487 ms 14016 KB Output is correct
18 Correct 300 ms 13932 KB Output is correct
19 Correct 298 ms 13988 KB Output is correct
20 Correct 446 ms 14028 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 49 ms 3184 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 52 ms 3032 KB Output is correct
7 Correct 57 ms 3512 KB Output is correct
8 Correct 82 ms 6516 KB Output is correct
9 Correct 71 ms 6504 KB Output is correct
10 Correct 69 ms 6504 KB Output is correct
11 Correct 77 ms 6520 KB Output is correct
12 Correct 74 ms 6520 KB Output is correct
13 Correct 68 ms 6492 KB Output is correct
14 Correct 68 ms 6524 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 59 ms 3380 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 52 ms 3472 KB Output is correct
25 Correct 60 ms 3324 KB Output is correct
26 Correct 50 ms 3580 KB Output is correct
27 Correct 61 ms 3440 KB Output is correct
28 Correct 79 ms 4464 KB Output is correct
29 Correct 458 ms 14008 KB Output is correct
30 Correct 90 ms 4388 KB Output is correct
31 Correct 487 ms 14016 KB Output is correct
32 Correct 300 ms 13932 KB Output is correct
33 Correct 298 ms 13988 KB Output is correct
34 Correct 446 ms 14028 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Incorrect 49 ms 3184 KB Output isn't correct
38 Halted 0 ms 0 KB -