Submission #1241479

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241479		MateiKing80	popa (BOI18_popa)	C++20	100 / 100	26 ms	424 KiB

popa

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

using namespace std;

int solve(int n, int* left, int* right) {
	stack<int> s;
	int rad = -1;
	for (int i = 0; i < n; i ++) {
		left[i] = right[i] = -1;
		while (s.size() && query(i, i, s.top(), i)) {
			right[s.top()] = left[i];
			left[i] = s.top();
			s.pop();
		}
		if (s.size()) 
			right[s.top()] = i;
		else 
			rad = i;
		s.push(i);
	}
	return rad;
}

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