Submission #800430

#TimeUsernameProblemLanguageResultExecution timeMemory
800430APROHACKComparing Plants (IOI20_plants)C++17
5 / 100
60 ms7676 KiB
#include "plants.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
vector<int>R;
int K, n;
vector<int>pref;
int getSum(int l, int r){
	l++;
	r++;
	return pref[r] - pref[l-1];
}

void init(int k, std::vector<int> r) {
	R = r;
	K = k;
	n = r.size();
	pref.pb(0);
	for(int i = 0 ; i < n ; i ++){
		pref.pb(pref.back() + r[i]);
	}
	for(int i = 0 ; i < n ; i ++){
		pref.pb(pref.back() + r[i]);
	}
	return;
}

int compare_plants(int x, int y) {
	//cout << "ask " << x << " " <<  y << endl;
	int ret = 0;
	if(getSum(x, y-1) == 0 or getSum(y, x + n - 1) == (x+n - y)){
		ret = 1;
	}else if(getSum(x, y-1) == (y-x) or getSum(y, x + n-1) == 0){
		ret = -1;
	}
	return ret;
}
#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...