이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "plants.h"
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N=200090;
int r[N];
int n;
void init(int k, vector<int> R) {
n=R.size();
for(int i=0;i<n;i++)r[i]=R[i];
if(r[0]==0)r[0]=-1;
for(int i=1;i<n;i++)
{
r[i]+=r[i-1];
}
}
int compare_plants(int x, int y) {
int z=0;
if(x>0)z=r[x-1];
int one=r[y-1]-z;
int two=z+r[n-1]-r[y-1];
if(abs(one)==abs(y-x))
{
if(one==y-x)return 1;
return -1;
}
if(abs(two)==abs(n-1-y+x))
{
if(two==n-1-y+x)return -1;
return 1;
}
return 0;
}
/*
5 2 3
1 1 1 1 1
0 1 1 3 1 4
*/
# | 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... |