Submission #421980

#	Time	Username	Problem	Language	Result	Execution time	Memory
421980		MrFrancho	Comparing Plants (IOI20_plants)	C++11	5 / 100	141 ms	7912 KiB

plants

#include "plants.h"

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

const int MAXN = 2e5;

int pSum[MAXN+1], n;

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

int compare_plants(int x, int y) {
	if(pSum[y] - pSum[x] == 0 || (pSum[n]-pSum[y] == n-y && pSum[x] == x))
		return 1;
	else if (pSum[y] - pSum[x] == y-x || (pSum[n]-pSum[y] == 0 && pSum[x] == 0))
		return -1;
	else
		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