Submission #1041770

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041770		MarwenElarbi	Comparing Plants (IOI20_plants)	C++17	0 / 100	1 ms	348 KiB

plants

#include <bits/stdc++.h>
#include "plants.h"
using namespace std;
const int nax=2e5+5;
int mx[nax];
int mn[nax];
void init(int k, std::vector<int> r) {
	int n=r.size();
	for (int i = 0; i < n; ++i)
	{
		mx[i]=i;
		mn[i]=i;
	}
	for (int i = 0; i < n; ++i)
	{
		if(r[i]==0){
			mn[(i+1)%n]=mn[i];
		}else{
			mx[(i+1)%n]=mx[i];
		}
	}
	for (int i = 1; i < n; ++i)
	{
		if(r[i-1]==0){
			mn[i]=mn[i-1];
		}else{
			mx[i]=mx[i-1];
		}
	}
	return;
}

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