Submission #580339

#	Time	Username	Problem	Language	Result	Execution time	Memory
580339		joelau	Comparing Plants (IOI20_plants)	C++14	5 / 100	81 ms	7920 KiB

plants

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

int N,A[200005];

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

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