Submission #303405

#	Time	Username	Problem	Language	Result	Execution time	Memory
303405		baluteshih	Comparing Plants (IOI20_plants)	C++14	5 / 100	107 ms	5608 KiB

plants

#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;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25