Submission #419076

#TimeUsernameProblemLanguageResultExecution timeMemory
41907679brueComparing Plants (IOI20_plants)C++14
0 / 100
1 ms304 KiB
#include <bits/stdc++.h>
#include "plants.h"

using namespace std;

typedef long long ll;

int n, k;
int arr[200002];
int sum[200002];

void init(int _k, vector<int> r) {
	n = (int)r.size();
	k = _k;
	for(int i=1; i<=n; i++) arr[i] = r[i-1];

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

int compare_plants(int x, int y) {
	x++, y++;
	if(sum[y-1] - sum[x-1] == (y-1) - (x-1)) return -1;
	if(sum[y-1] - sum[x-1] == 0) return 1;
	if(sum[x-1] == x-1 && sum[n] - sum[y] == n-y) return 1;
	if(!sum[x-1] && sum[n] == sum[y]) return -1;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...