#include <bits/stdc++.h>
#include "plants.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
vector<int>r;int k,n;
void init(int k1, std::vector<int> r1){
r=r1;k=k1;n=r.size();
}
int compare_plants(int x, int y){
if(x+1==y){
if(r[x]==0) return 1;
return -1;
}
if(x==0&&y==n-1){
if(r[y]==0) return -1;
return 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... |