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=4e5+5;
int mx[nax];
int mn[nax];
int n;
void init(int k, std::vector<int> r) {
n=r.size();
for (int i = 0; i < n*2; ++i)
{
mx[i]=i;
mn[i]=i;
}
for (int i = 0; i < n*2; ++i)
{
if(r[i%n]==0){
mn[i+1]=mn[i];
}else{
mx[i+1]=mx[i];
}
}
return;
}
int compare_plants(int x, int y) {
if(mx[y]<=x){
return -1;
}else if(mn[y]<=x){
return 1;
}else if(mx[x+n]<=y){
return 1;
}else if(mn[x+n]<=y){
return -1;
}else 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... |