Submission #817483

#	Time	Username	Problem	Language	Result	Execution time	Memory
817483		Trumling	Comparing Plants (IOI20_plants)	C++14	5 / 100	62 ms	8680 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()
vector<int>pre,suf;
ll nn;
void init(int k, vector<int> r) {
	pre.assign(r.size(),0);
	suf.assign(r.size(),0);
	nn=r.size();
	if(k==2)
	{
	for(int i=0;i<nn;i++)
		pre[i]=((i==0)?0:pre[i-1])+r[i];

	for(int i=nn-1;i>=0;i--)
		suf[i]=((i==nn-1)?0:suf[i+1])+r[i];
	}
	else
	{
	for(int i=0;i<nn;i++)
		pre[i]=((i==0)?0:pre[i-1])+ r[i]>=r[(i+1)%nn];

	for(int i=nn-1;i>=0;i--)
		suf[i]=((i==nn-1)?0:suf[i+1])+ r[i]>=r[(i+1)%nn];
	}

	

	return;
}
int compare_plants(int x, int y) 
{
	ll r=pre[y-1]-((x==0)?0:pre[x-1]);
	ll l= ((x==0)?0:pre[x-1])+ suf[y];
	ll ans=0;
	if(r==y-x)
		ans=-1;
	if(r==0)
		ans=1;
	if(l==nn-y+x)
		ans=1;
	if(l==0)
		ans=-1;

	return ans;
}

• 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