Submission #1291733

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291733		Sofiatpc	Comparing Plants (IOI20_plants)	C++20	0 / 100	4093 ms	8904 KiB

plants

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

using namespace std;

const int MAXN = 2*1e5+5;
int d[MAXN], e[MAXN], marcd[MAXN], dd[MAXN], marce[MAXN], de[MAXN];

void init(int k, vector<int> r) {
	int n = r.size();
	for(int i = 0; i < n; i++){
		marcd[i] = -1; marce[i] = -1;
		if(r[i] == 0)e[ (i+1)%n ] = 1;
		else d[i] = 1;
	}

	for(int i = 0; i < n; i++){
		if(marcd[i] == -1 && d[i]){
			int cur = i;
			while(d[cur]){
				marcd[cur] = i;
				dd[ (cur+1)%n ] = dd[cur]+1;
				cur = (cur+1)%n;
			}
			marcd[cur] = i;
		}
		if(marce[i] == -1 && e[i]){
			int cur = i;
			while(e[cur]){
				marce[cur] = i;
				de[ (cur-1+n)%n ] = de[cur]+1;
				cur = (cur-1+n)%n;
			}
			marce[cur] = i;
		}
	}
	return;
}

int compare_plants(int x, int y) {
	if(marce[x] != -1 && marce[x] == marce[y]){
		if(de[x] > de[y])return 1;
		return -1;
	}
	if(marcd[x] != -1 && marcd[x] == marcd[y]){
		if(dd[x] > dd[y])return 1;
		return -1;
	}
	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