# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1040830 | nightfal | 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 "plants.h"
static std:: vector<int> inc,dec;
void init(int k, std::vector<int> r) {
int n = r.size();
if(k==2) {
inc.resize(n); dec.resize(n);
for(int i=0; i<n; i++) {inc[i] = dec[i] = i;}
int s,incVal,decVal;
for(s=2*n-1; s>=0; s--) {
if (r[s%n]==0) incVal = s;
else decVal = s;
inc[s%n] = incVal; dec[s%n] = decVal;
}
}
return;
}
int subtask1(int x, int y) {
int n = r.size();
if (y <= dec[x] or x+n <= inc[y]) return 1;
else if (y <= inc[x] or x+n <= dec[y]) return -1;
return 0;
}
int compare_plants(int x, int y) {
if (k==2) return subtask1(x,y);
return 0;
}