Submission #432148

#	Time	Username	Problem	Language	Result	Execution time	Memory
432148		peuch	Comparing Plants (IOI20_plants)	C++17	0 / 100	1 ms	204 KiB

plants

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

int n;
bool sub1;
vector<int> esq, dir;

void init(int k, vector<int> r) {
	sub1 = k == 2;
	n = r.size();
	if(sub1){
		esq = vector<int> (n);
		dir = vector<int> (n);
		int ini;
		for(ini = 0; ini < n; ini++)
			if(r[ini] == 1) break;
		ini++;
		ini %= n;
		esq[ini] = 0;
		for(int i = ini + 1; i != ini; i++, i %= n){
			int ant = i - 1;
			if(ant < 0) ant += n;
			esq[i] = esq[ant] + 1;
			if(r[ant] == 1) esq[i] = 0;
		}
		
		for(ini = 0; ini < n; ini++)
			if(r[ini] == 0) break;
		dir[ini] = 0;
		for(int i = (ini + n - 1) % n; i != ini; i += n - 1, i %= n){
			int nex = i + 1;
			if(nex >= n) nex -= n;
			dir[i] = dir[nex] + 1;
			if(r[i] == 0) dir[i] = 0;
		}
	}
		
	return;
}

int compare_plants(int x, int y) {
	if(sub1){
		if(x + dir[x] >= y) return 1;
		if(y - esq[y] <= x) return -1;
		return 0;
	}
	return 0;
}

• Subtask 1: 0 / 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