Submission #1204725

#	Time	Username	Problem	Language	Result	Execution time	Memory
1204725		bangan	Comparing Plants (IOI20_plants)	C++20	0 / 100	1 ms	328 KiB

plants

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

const int N = 2e5 + 4;

int n, pre[N];

void init(int k, std::vector<int> r) {
	assert(k == 2);

	n = r.size(); 
	for (int i=1; i<=n; i++) pre[i] = pre[i-1] + r[i-1];

	return;
}

int compare_plants(int x, int y) {
	if (x==y) return 0;
	if (x<y) {
		int p = pre[y]-pre[x]; int q = pre[n]-p;
		if (p == y-x || q == n-y+x) return 1;
		else if (!p || !q) return -1;
		else return 0;
	}
	else {
		int p = pre[x]-pre[y]; int q = pre[n]-p;
		if (!p || !q) return 1;
		else if (p == x-y || q == n-x+y) return 1;
		else 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