Submission #862178

#	Time	Username	Problem	Language	Result	Execution time	Memory
862178		iskhakkutbilim	popa (BOI18_popa)	C++17	100 / 100	50 ms	920 KiB

popa

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


int solve(int N, int* Left, int* Right){
    for(int i = 0; i < N; i++) Left[i] = Right[i] = -1;
    stack<int> st;
    for(int i = 0; i < N; i++){
        int pref = -1;
        while(!st.empty()){
            int First = st.top();
            if(query(First, First, First, i)){
                Right[First] = i;
                break;
            }
            pref = First;
            st.pop();
        }
        Left[i] = pref;
        st.push(i);
    }
    if(st.empty()) assert(false);
    while(st.size() > 1) st.pop();
    return st.top();
}

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