이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(),v.end()
#define SZ(a) ((int)a.size())
#define pb push_back
vector<int> R,sum;
int n;
void init(int k, vector<int> r)
{
    R.swap(r),n=SZ(R);
    R.insert(R.begin(),0);
    sum=R;
    for(int i=1;i<=n;++i)
        sum[i]+=sum[i-1];
}
int compare_plants(int x, int y)
{
    ++x,++y;
    int rt=1;
    if(x>y)
        swap(x,y),rt*=-1;
    if(sum[y-1]-sum[x-1]==y-x||sum[n]-sum[y-1]+sum[x-1]==0)
        return -rt;
    if(sum[y-1]-sum[x-1]==0||sum[n]-sum[y-1]+sum[x-1]==n-y+x)
        return rt;
    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... |