Submission #578673

#	Time	Username	Problem	Language	Result	Execution time	Memory
578673		FatihSolak	popa (BOI18_popa)	C++17	100 / 100	122 ms	448 KiB

popa

#include <bits/stdc++.h>
#include "popa.h"
#define N 1005
using namespace std;
int L[N],R[N];
int prv[N];
int f(int l,int r){
    if(l > r)return -1;
    for(int i = r;i>=l;i--){
        if(prv[i] < l){
            L[i] = f(l,i-1);
            R[i] = f(i+1,r);
            return i;
        }
    }
}
int solve(int n, int* Left, int* Right){
    for(int i = 0;i<n;i++){
        L[i] = R[i] = -1;
        prv[i] = -1;
    }
    for(int i = 0;i<n;i++){
        int r = n-1;
        while(r + 1 != n && query(i,r+1,i,i))
            r++;
        stack<int> st;
        for(int j = i;j<=r;j++){
            while(st.size() && query(st.top(),j,j,j)){
                st.pop();
            }
            if(st.size())
                prv[j] = st.top();
            st.push(j);
        }
        i = r;
    }
    int ret = f(0,n-1);
    for(int i = 0;i<n;i++){
        Left[i] = L[i];
        Right[i] = R[i];
    }
    return ret;
}

Compilation message (stderr)

popa.cpp: In function 'int f(int, int)':
popa.cpp:16:1: warning: control reaches end of non-void function [-Wreturn-type]
   16 | }
      | ^

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