Submission #431382

#	Time	Username	Problem	Language	Result	Execution time	Memory
431382		Rouge_Hugo	Comparing Plants (IOI20_plants)	C++14	0 / 100	1 ms	352 KiB

plants

#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
*/

• Subtask 1: 0 / 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