Submission #1291740

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291740		julia_08	Comparing Plants (IOI20_plants)	C++20	5 / 100	44 ms	5828 KiB

plants

#include <bits/stdc++.h>
#include "plants.h"

using namespace std;

const int MAXN = 2e5 + 10;

int sum[MAXN], r[MAXN];

int n;

void init(int k, vector<int> r_){

	n = (int) r_.size();

	for(int i=0; i<n; i++) r[i + 1] = r_[i];

	for(int i=1; i<=n; i++) sum[i] = sum[i - 1] + r[i];

}

int compare_plants(int x, int y){

	x ++; y ++;

	int sign = 1;

	if(x > y){
		swap(x, y);
		sign = -1;
	}

	if(sum[y - 1] - sum[x - 1] == 0) return 1 * sign;

	if(sum[n] - (sum[y - 1] - sum[x - 1]) == 0) return -1 * sign;

	if(sum[y - 1] - sum[x - 1] == (y - x)) return -1 * sign;

	if(sum[n] - (sum[y - 1] - sum[x - 1]) == n - (y - x)) return 1 * sign;

	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