# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369746 | MilosMilutinovic | Comparing Plants (IOI20_plants) | C++14 | 0 ms | 0 KiB |
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>
using namespace std;
int n, k;
vector<int> a;
int compare_plants(int x, int y) {
if(x==n-1) {
if(y==x-1) {
if(a[y])
return -1;
return 1;
} else {
if(y!=0)
return 0;
if(a[x])
return 1;
return -1;
}
} else {
if(x==0) {
if(y==n-1) {
if(a[y])
return -1;
return 1;
} else {
if(y!=1)
return 0;
if(a[x])
return 1;
return -1;
}
} else {
if(abs(x-y)!=1)
return 0;
if(x<y) {
if(a[x])
return 1;
return -1;
} else {
if(a[y])
return -1;
return 1;
}
}
}
}
void init(int K, vector<int> r) {
n=(int)r.size(), k=K, a=r;
}
int main() {
return 0;
}