Submission #603783

#	Time	Username	Problem	Language	Result	Execution time	Memory
603783		HamletPetrosyan	Comparing Plants (IOI20_plants)	C++17	5 / 100	73 ms	5836 KiB

plants

#include "plants.h"
#include <iostream>
using namespace std;

#define len(a) ((int)(a).size())

vector<int> p, m;

void init(int k, vector<int> r) {
	p.resize(len(r));
	m.resize(len(r));
	for(int i = 0, pr, now; i < 2 * len(r); i++){
		now = i % len(r);
		pr = (now == 0) ? len(r) - 1 : now - 1;
		p[now] = m[now] = now;
		if(r[pr] == 0){
			p[now] = p[pr];
		}
		else {
			m[now] = m[pr];
		}
	}
//	for(int i = 0; i < len(p); i++){
//		cout << p[i] << " ";
//	}
//	cout << endl;
//	for(int i = 0; i < len(m); i++){
//		cout << m[i] << " ";
//	}
//	cout << endl;
}

int compare_plants(int x, int y) {
	if(x < y){
		if(p[x] > x && p[x] <= y) return -1;
		if(m[y] <= x || m[y] > y) return -1;
		if(m[x] > x && m[x] <= y) return 1;
		if(p[y] <= x || p[y] > y) return 1;
		return 0;
	}
	if(p[x] <= y || p[x] > x) return -1;
	if(m[y] > y && m[y] <= x) return -1;
	if(m[x] <= y || m[x] > x) return 1;
	if(p[y] > y && p[y] <= x) 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