제출 #1291751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291751		gustavo_d	식물 비교 (IOI20_plants)	C++20	5 / 100	46 ms	7808 KiB

plants

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

#define sz(v) (int)(v).size()

const int MAXN = 2e5;

int n;
bool nxtBigger[2*MAXN];
int furthestBigger[2*MAXN], furthestSmaller[2*MAXN];

void init(int k, vector<int> r) {
	n = sz(r);
	for (int i=0; i<2*n-1; i++) {
		nxtBigger[i] = r[i%n];
		// cout << nxtBigger[i] << ' ';
	}
	// cout << '\n';
	for (int i=2*n-2; i>=0; i--) {
		if (!nxtBigger[i]) furthestBigger[i] = -1;
		else if (i == 2*n-2 or !nxtBigger[i+1]) furthestBigger[i] = i+1;
		else furthestBigger[i] = furthestBigger[i+1];
		if (nxtBigger[i]) furthestSmaller[i] = -1;
		else if (i == 2*n-2 or nxtBigger[i+1]) furthestSmaller[i] = i+1;
		else furthestSmaller[i] = furthestSmaller[i+1];
	}
	// for (int i=0; i<2*n-1; i++) cout << furthestSmaller[i] << ' ';
	// cout << '\n';
	// for (int i=0; i<2*n-1; i++) cout << furthestBigger[i] << ' ';
	// cout << '\n';
}

int cmp(int x, int y) {
	if (x > y) y += n;
	if (furthestBigger[x] >= y) return -1;
	if (furthestSmaller[x] >= y) return 1;
	return 0;
}

int compare_plants(int x, int y) {
	int cmpA = cmp(x, y), cmpB = cmp(y, x);
	if (cmpA != 0) return cmpA;
	return cmpB * -1;
}

• 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