Submission #466082

#	Time	Username	Problem	Language	Result	Execution time	Memory
466082		nickmet2004	popa (BOI18_popa)	C++11	100 / 100	113 ms	400 KiB

popa

#include<bits/stdc++.h>
#include "popa.h"
using namespace std;

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

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