Submission #198296

#	Time	Username	Problem	Language	Result	Execution time	Memory
198296		forelax	popa (BOI18_popa)	C++14	100 / 100	94 ms	376 KiB

popa

#include<bits/stdc++.h>
#include "popa.h"
using namespace std;
int solve(int n,int* Left,int* Right){
	stack<int> Stack;
	for(int i = 0 ; i < n ; i ++){
		Left[i]=-1;
		Right[i]=-1;
		while(Stack.size()&&!query(Stack.top(),Stack.top(),Stack.top(),i)){
			Left[i]=Stack.top();
			Stack.pop();
		}
		if(Stack.size()){
			Right[Stack.top()]=i;
		}
		Stack.push(i);
	}
	while(Stack.size()>1)Stack.pop();
	int rez=Stack.top();
	Stack.pop();
	return rez;
}

• Subtask 1: 37 / 37
• Subtask 2: 24 / 24
• Subtask 3: 39 / 39