#include "plants.h"
using namespace std;
typedef vector<int> vi;
const int N = 200000, INF = 0x3f3f3f3f;
int pp[N], hh[N], n, k;
void init(int k_, vi rr) {
int h, i;
n = rr.size(), k = k_;
if (k == 2) {
for (i = 0; i < n; i++)
pp[i] = rr[i];
for (i = 1; i < n; i++)
pp[i] += pp[i - 1];
} else {
for (h = 0; h < n; h++) {
int i_ = -1;
for (i = 0; i < n; i++)
if (rr[i] == 0) {
if (i_ != -1 && i - i_ >= k_)
break;
i_ = i;
}
i = i_;
hh[i] = h;
rr[i] = INF;
for (i_ = 0; i_ < k; i_++)
rr[(i + i_) % n]--;
}
}
}
int compare_plants(int x, int y) {
int k = pp[y - 1] - (x == 0 ? 0 : pp[x - 1]);
if (k == y - x)
return -1;
else if (k == 0)
return 1;
k = pp[n - 1] - k;
if (k == n - (y - x))
return 1;
else if (k == 0)
return -1;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
56 ms |
3756 KB |
Output is correct |
7 |
Correct |
66 ms |
4040 KB |
Output is correct |
8 |
Correct |
90 ms |
5716 KB |
Output is correct |
9 |
Correct |
87 ms |
5628 KB |
Output is correct |
10 |
Correct |
86 ms |
5632 KB |
Output is correct |
11 |
Correct |
88 ms |
5700 KB |
Output is correct |
12 |
Correct |
88 ms |
5628 KB |
Output is correct |
13 |
Correct |
90 ms |
5660 KB |
Output is correct |
14 |
Correct |
91 ms |
5648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
288 KB |
Output is correct |
4 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
56 ms |
3756 KB |
Output is correct |
7 |
Correct |
66 ms |
4040 KB |
Output is correct |
8 |
Correct |
90 ms |
5716 KB |
Output is correct |
9 |
Correct |
87 ms |
5628 KB |
Output is correct |
10 |
Correct |
86 ms |
5632 KB |
Output is correct |
11 |
Correct |
88 ms |
5700 KB |
Output is correct |
12 |
Correct |
88 ms |
5628 KB |
Output is correct |
13 |
Correct |
90 ms |
5660 KB |
Output is correct |
14 |
Correct |
91 ms |
5648 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
0 ms |
204 KB |
Output is correct |
17 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |