이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define F first
#define S second
#define ll long long
#define nd '\n'
using namespace std;
vector <int> plants;
ll n=0;
void init (int k, vector <int> r){
plants = r;
n = r.size();
}
int compare_plants(int x, int y){
bool menor=1, mayor=1;
for (ll i=x; i<y; i++){
if (plants[i] != 1) mayor=0;
else menor=0;
}
if (mayor) return -1;
else if (menor) return 1;
mayor=1;
menor=1;
for (ll i=y; (i%n)!=x; i++){
if (i == n) i=0;
if (plants[i] != 1) mayor=0;
else menor=0;
}
if (mayor) return 1;
else if (menor) return -1;
else 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... |