Submission #438572

#	Time	Username	Problem	Language	Result	Execution time	Memory
438572		AmineTrabelsi	Comparing Plants (IOI20_plants)	C++14	0 / 100	1 ms	204 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
const int M = 200005;
int pref[M];
int n;
int sum(int l,int r){
	if(r < l){
		return sum(0,r)+sum(l,n-1);
	}
	return pref[r+1]-pref[l];
}
void init(int k, vector<int> r) {
	n = r.size();
	for(int i=0;i<n;i++){
		pref[i+1] = pref[i]+r[i];
	}
	return;
}
bool istaller(int x,int y){
	if(x > y && sum(x,(y > 0 ? y-1 : n-1)) == 0)return true;
	int range = sum(0,n-1)-sum(x,y);
	if(x< y && range == n-abs(x-y)-1)return true;
	return false;
}
int compare_plants(int x, int y) {
	if(istaller(x,y))return 1;
	if(istaller(y,x))return -1;
	return 0;
}

• 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