This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "plants.h"
using namespace std;
const int nax = 2e5 + 2;
int n, k;
int head[nax], pos[nax];
void init(int K, vector<int> r) {
k = K;
n = r.size();
memset(head, -1, sizeof head);
int p = -1;
for(int i=0; i<n; ++i) {
int pr = (i - 1 + n) % n;
if(!r[pr] && r[i]) { //down
p = i;
break;
}
}
assert(p!=-1);
int st = p;
while(1) {
int j = p;
pos[p] = 1;
head[p] = p;
int at = 1;
while(r[j]) {
j = (j+1)%n;
head[j] = p;
pos[j] = ++at;
}
while(!r[j]) j = (j+1)%n;
if(j==st) break;
p = j;
}
}
int compare_plants(int x, int y) {
if(head[x] == head[y] && head[x]!=-1) {
return (pos[x] < pos[y]) ? -1 : 1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |