# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310322 | APROHACK | Comparing Plants (IOI20_plants) | C++14 | 141 ms | 7280 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"
#include <bits/stdc++.h>
using namespace std;
vector<int>globalr;
long long gk, gn;
vector<int>acum;
void init(int k, vector<int> r) {
globalr=r;
gk=k;
gn=r.size();
acum.push_back(0);
long long cur=0;
for(int i = 0 ; i < r.size() ; i ++){
if(r[i])cur++;
acum.push_back(cur);
}
for(int i = 0 ; i < r.size() ; i ++){
if(r[i])cur++;
acum.push_back(cur);
}
return;
}
int compare_plants(int x, int y) {
long long rta1, rta2;
rta1=acum[y]-acum[x];
if(rta1==0){
return 1;
}else if(rta1==y-x)return -1;
else
{
rta2=acum[(x+gn)]-acum[(y)];
if(rta2==0){
return -1;
}else if(rta2==(x+gn)-y){
return 1;
}else return 0;
}
}
Compilation message (stderr)
# | 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... |