#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 303;
// mn = plant that point to this plant
struct A {
int mn, idx;
A operator + (const A& o) const {
A t;
if (mn < o.mn) t = *this;
else t = o;
return t;
}
} tree[4 * N], tree1[4 * N];
// tree -> candidate
// tree1 -> non candidate
int lazy[4 * N], lazy1[4 * N];
int n, k;
int ord[N], a[N];
bool ch[N];
bool vis[N][N];
vector<int> adj[N];
void dfs(int v, int r) {
vis[r][v] = 1;
for (auto& x : adj[v]) {
if (!vis[x][v]) dfs(x, r);
}
}
void build(int now = 1, int l = 0, int r = n - 1) {
if (l == r) {
tree[now].mn = 1e9;
tree1[now].mn = a[l];
tree[now].idx = tree1[now].idx = l;
return;
}
int mid = (l + r) / 2;
build(2 * now, l, mid), build(2 * now + 1, mid + 1, r);
tree[now] = tree[2 * now] + tree[2 * now + 1];
tree1[now] = tree1[2 * now] + tree1[2 * now + 1];
}
void lzy(int now, int l, int r) {
tree[now].mn += lazy[now];
tree1[now].mn += lazy1[now];
if (l != r) {
lazy[2 * now] += lazy[now], lazy[2 * now + 1] += lazy[now];
lazy1[2 * now] += lazy1[now], lazy1[2 * now + 1] += lazy1[now];
}
lazy[now] = lazy1[now] = 0;
}
// update arrow
void update(int ql, int qr, int w, int now = 1, int l = 0, int r = n - 1) {
lzy(now, l, r);
if (l > qr || r < ql) return;
if (ql <= l && r <= qr) {
lazy[now] += w;
lzy(now, l, r);
return;
}
int mid = (l + r) / 2;
update(ql, qr, w, 2 * now, l, mid), update(ql, qr, w, 2 * now + 1, mid + 1, r);
tree[now] = tree[2 * now] + tree[2 * now + 1];
tree1[now] = tree1[2 * now] + tree1[2 * now + 1];
}
// update r
void update1(int ql, int qr, int w, int now = 1, int l = 0, int r = n - 1) {
lzy(now, l, r);
if (l > qr || r < ql) return;
if (ql <= l && r <= qr) {
lazy1[now] += w;
lzy(now, l, r);
return;
}
int mid = (l + r) / 2;
update1(ql, qr, w, 2 * now, l, mid), update1(ql, qr, w, 2 * now + 1, mid + 1, r);
tree[now] = tree[2 * now] + tree[2 * now + 1];
tree1[now] = tree1[2 * now] + tree1[2 * now + 1];
}
void update_1(int i, int w) {
int j = i + k - 1;
if (j >= n) {
update(i + 1, n - 1, w);
update(0, j - n, w);
}
else update(i + 1, j, w);
}
void update_2(int i) {
update1(i, i, 1e9);
update(i, i, -1e9);
}
void update_3(int i, int w) {
int j = i - k + 1;
if (j < 0) {
update1(0, i - 1, w);
update1(j + n, n - 1, w);
}
else update1(j, i - 1, w);
}
void init(int K, vector<int> r) {
n = r.size();
k = K;
for (int i = 0;i < n;i++) a[i] = r[i];
build();
for (int i = 0;i < n;i++) {
if (a[i] == 0) {
update_1(i, 1); // add arrow
update_2(i); // transfer to candidate
}
}
stack<int> ord;
int tot = n;
while (tot--) {
A now = tree[1];
int i = now.idx;
ord.push(i);
update_1(i, -1); // remove arrow
update_3(i, -1); // remove previous r
update(i, i, 1e9);
A nxt = tree1[1];
while (nxt.mn == 0) {
update_1(nxt.idx, 1); // add arrow
update_2(nxt.idx); // add to candidate
nxt = tree1[1];
}
}
while (!ord.empty()) {
int i = ord.top();
ord.pop();
ch[i] = 1;
for (int j = 1;j < k;j++) {
if (ch[(i + j) % n]) adj[i].push_back((i + j) % n);
if (ch[(i - j + n) % n]) adj[i].push_back((i - j + n) % n);
}
}
for (int i = 0;i < n;i++) dfs(i, i);
}
int compare_plants(int x, int y) {
if (vis[x][y]) return 1;
if (vis[y][x]) return -1;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
25 ms |
4088 KB |
Output is correct |
| 7 |
Runtime error |
22 ms |
7764 KB |
Execution killed with signal 11 |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Execution timed out |
4094 ms |
348 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Execution timed out |
4094 ms |
348 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Runtime error |
19 ms |
6260 KB |
Execution killed with signal 11 |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
600 KB |
Output is correct |
| 7 |
Correct |
216 ms |
1364 KB |
Output is correct |
| 8 |
Execution timed out |
4038 ms |
1368 KB |
Time limit exceeded |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
25 ms |
4088 KB |
Output is correct |
| 7 |
Runtime error |
22 ms |
7764 KB |
Execution killed with signal 11 |
| 8 |
Halted |
0 ms |
0 KB |
- |
