Submission #823222

#	Time	Username	Problem	Language	Result	Execution time	Memory
823222		fatemetmhr	Comparing Plants (IOI20_plants)	C++17	5 / 100	64 ms	7904 KiB

plants

// vaghan ide i nadaram chi benevisam dige :/


#include "plants.h"
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define fi     first
#define se     second
#define mp     make_pair
#define pb     push_back

typedef long long ll;

const int maxn5 = 2e5 + 10;

int n, ps[maxn5];

int get_sum(int l, int r){
	if(l < r)
		return ps[r - 1] - (l ? ps[l - 1] : 0);
	return (r ? ps[r - 1] : 0) + ps[n - 1] - ps[l - 1];
}

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

int compare_plants(int x, int y) {
	int sum = get_sum(x, y);
	if(sum == 0)
		return 1;
	if(sum == (y - x + n) % n)
		return -1;
	sum = get_sum(y, x);
	if(sum == 0)
		return -1;
	if(sum == (x - y + n) % n)
		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