Submission #198291

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

popa

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

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