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;
#ifndef ARTHUR_LOCAL
#include "plants.h"
#endif
using ll = long long;
#define len(x) int((x).size())
#define ff first
#define ss second
// #ifdef ARTHUR_LOCAL
vector<int> R;
int n;
void init(int k, vector<int> r)
{
R=r;
n=len(R);
return;
}
int compare_plants(int x, int y)
{
int i=x;
bool isinc=0;
bool isdec=0;
while(1)
{
if(i==y) break;
if(R[i]==1) isinc=1;
else isdec=1;
i++;
i%=n;
}
if(!isinc) return 1;
if(!isdec) return -1;
isinc=0;
isdec=0;
i=y;
while(1)
{
if(i==x) break;
if(R[i]==1) isinc=1;
else isdec=1;
i++;
i%=n;
}
if(!isinc) return -1;
if(!isdec) return 1;
return 0;
}
#ifdef ARTHUR_LOCAL
int main()
{
init(3,{0,0,1,1});
cout << compare_plants(0,2) << endl;
}
#endif
# | 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... |