#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
using ii = pair<int, int>;
int n;
vector<int> r, h[2];
struct node {
node *left, *right;
int S, E, pv;
ii val;
node(int _s, int _e) : S(_s), E(_e), pv(0) {
if (S == E) {
val = mp(r[S], S);
return;
}
int M = (S + E) / 2;
left = new node(S, M);
right = new node(M + 1, E);
val = min(left->val, right->val);
}
void prop() {
if (S == E || !pv) {
return;
}
left->val.first += pv;
left->pv += pv;
right->val.first += pv;
right->pv += pv;
pv = 0;
}
void upd(int l, int r, int v) {
if (l > E || r < S) {
return;
}
if (l <= S && E <= r) {
val.first += v;
pv += v;
return;
}
prop();
left->upd(l, r, v);
right->upd(l, r, v);
val = min(left->val, right->val);
}
} *root;
struct node2 {
node2 *left, *right;
int S, E;
set<int> val;
node2(int _s, int _e) : S(_s), E(_e) {
if (S == E) {
return;
}
int M = (S + E) / 2;
left = new node2(S, M);
right = new node2(M + 1, E);
}
void upd(int p, int v) {
val.insert(v);
if (S == E) {
return;
}
int M = (S + E) / 2;
if (p <= M) {
left->upd(p, v);
} else {
right->upd(p, v);
}
}
void del(int p, int v) {
val.erase(v);
if (S == E) {
return;
}
int M = (S + E) / 2;
if (p <= M) {
left->del(p, v);
} else {
right->del(p, v);
}
}
ii qry(int l, int r) {
if (l > E || r < S) {
return mp((int)1e9, -(int)1e9);
}
if (l <= S && E <= r) {
if (val.empty()) {
return mp((int)1e9, -(int)1e9);
} else {
return mp(*val.begin(), *val.rbegin());
}
}
auto lq = left->qry(l, r), rq = right->qry(l, r);
return mp(min(lq.first, rq.first), max(lq.second, rq.second));
}
} *root2;
void init(int k, vector<int> r) {
n = (int)r.size();
auto dist = [&](int i, int j) {
int ret = j - i;
if (ret < 0) {
return ret + n;
} else {
return ret;
}
};
for (int rep = 0; rep < 2; rep++) {
::r = r;
h[rep].resize(n);
root = new node(0, n - 1);
root2 = new node2(0, n - 1);
set<int> zeroes;
set<ii> candidates;
for (int i = n - 1; i >= 0; i--) {
while (root->val.first == 0) {
int cur_pos = root->val.second;
if (zeroes.empty()) {
candidates.emplace(n, cur_pos);
root2->upd(n, cur_pos);
} else if ((int)zeroes.size() == 1) {
int x = *zeroes.begin();
candidates.erase(mp(n, x));
root2->del(n, x);
candidates.emplace(dist(cur_pos, x), x);
root2->upd(dist(cur_pos, x), x);
candidates.emplace(dist(x, cur_pos), cur_pos);
root2->upd(dist(x, cur_pos), cur_pos);
} else {
auto it = zeroes.lower_bound(cur_pos);
if (it == zeroes.end()) {
it = zeroes.begin();
}
int nxt = *it;
if (it == zeroes.begin()) {
it = zeroes.end();
}
--it;
int prv = *it;
candidates.erase(mp(dist(prv, nxt), nxt));
root2->del(dist(prv, nxt), nxt);
candidates.emplace(mp(dist(prv, cur_pos), cur_pos));
root2->upd(dist(prv, cur_pos), cur_pos);
candidates.emplace(mp(dist(cur_pos, nxt), nxt));
root2->upd(dist(cur_pos, nxt), nxt);
}
zeroes.insert(cur_pos);
root->upd(cur_pos, cur_pos, (int)1e9);
}
assert(!zeroes.empty() && !candidates.empty());
int pos = (rep == 0 ? root2->qry(k, n - 1).first : root2->qry(k, n - 1).second);
zeroes.erase(pos);
{
root2->del(candidates.rbegin()->first, pos);
candidates.erase(--candidates.end());
if ((int)zeroes.size() == 1) {
candidates.erase(mp(dist(pos, *zeroes.begin()), *zeroes.begin()));
root2->del(dist(pos, *zeroes.begin()), *zeroes.begin());
candidates.emplace(n, *zeroes.begin());
root2->upd(n, *zeroes.begin());
} else if ((int)zeroes.size() >= 2) {
auto it = zeroes.lower_bound(pos);
if (it == zeroes.end()) {
it = zeroes.begin();
}
int nxt = *it;
if (it == zeroes.begin()) {
it = zeroes.end();
}
--it;
int prv = *it;
candidates.erase(mp(dist(pos, nxt), nxt));
root2->del(dist(pos, nxt), nxt);
candidates.emplace(dist(prv, nxt), nxt);
root2->upd(dist(prv, nxt), nxt);
}
}
assert(pos != -1);
h[rep][pos] = i;
if (pos - k + 1 < 0) {
root->upd(pos - k + 1 + n, n - 1, -1);
root->upd(0, pos - 1, -1);
} else {
root->upd(pos - k + 1, pos - 1, -1);
}
}
}
}
int compare_plants(int x, int y) {
if ((h[0][x] < h[0][y]) != (h[1][x] < h[1][y])) {
return 0;
} else {
return (h[0][x] < h[0][y] ? -1 : 1);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
50 ms |
4796 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
