| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 835577 | rubdary | Comparing Plants (IOI20_plants) | C++14 | 0 ms | 212 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "plants.h"
#include <iostream>
using namespace std;
int N;
vector <int> sum;
void init(int k, vector<int> r){
	sum.push_back(0);
	for(int i = 0; i < r.size(); i++){
		sum.push_back(sum.back()+r[i]);
	}
	return;
}
int lower(int x, int y){
	int suma = sum[y] - sum[x];
	int cant = y - x + 1;
	if(suma == 0) return 1;
	if(suma == cant) return -1;
	suma = (sum.back() - sum[y]) + (sum[x]);
	cant = N - cant;
	if(suma == 0) return -1;
	if(suma == cant) return 1;
	return 0;
}
int higher(int x, int y){
	int suma = sum[x] - sum[y];
	int cant = x - y + 1;
	if(suma == 0) return -1;
	if(suma == cant) return 1;
	suma = (sum.back() - sum[x]) + (sum[y]);
	cant = N - cant;
	if(suma == 0) return 1;
	if(suma == cant) return -1;
	return 0;
}
int compare_plants(int x, int y){
	N = sum.size();
	if(x < y) return lower(x, y); 
	return higher(x, y);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
