Submission #300504

#	Time	Username	Problem	Language	Result	Execution time	Memory
300504		Dovran	Comparing Plants (IOI20_plants)	C++11	5 / 100	107 ms	5052 KiB

plants

#include <bits/stdc++.h>
#define N 200009
#define pii pair <int, int>
#define ff first
#define sz() size()
#define ss second
#define sz() size()
#define pb push_back
#define ll long long

using namespace std;

int v[N], n;

void init(int k, vector<int>r){
	n=r.sz();
	for(int i=0; i<n; i++)
		v[i]=r[i]+v[i-1];
}

int compare_plants(int x, int y){
	if(x>y)
		swap(x, y);
	
	if(v[y-1]-v[x-1]==0 or (v[x-1]+v[n-1]-v[y-1]==x+n-y))
		return 1;
	else if(v[y-1]-v[x-1]==y-x or (v[x-1]==0 and v[n-1]-v[y-1]==0))
		return -1;
		
	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