Submission #1041783

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

plants

#include <bits/stdc++.h>
#include "plants.h"
using namespace std;
#define fi first
const int nax=2e5+5;
set<pair<int,int>> st;
int tab[nax]; 
void init(int k, std::vector<int> r) {
	int n=r.size();
	for (int i = 0; i < n; ++i)
	{
		tab[i]=r[i];
		if(r[i]==0&&r[(i+1)%n]==1){
			st.insert({(i+1)%n,0});
		}else if(r[i]==1&&r[(i+1)%n]==0){
			st.insert({(i+1)%n,1});
		}
	}
	return;
}

int compare_plants(int x, int y) {
	if(st.size()==0){
		return (tab[x]==1 ? 1 : -1);
	}
	pair<int,int> a=*st.upper_bound({x,1});
	pair<int,int> b=(st.upper_bound({y,1}) != st.end() ? *st.upper_bound({y,1}): *st.begin());
	if(a.fi<y&&b.fi<x){
		return 0;
	}else if(a.fi<y) return (tab[y]==1 ? 1 : -1);
	else return (tab[x]==1 ? -1 : 1);
}

• 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