oj.uz

답안 #578671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578671 2022-06-17T14:12:04 Z FatihSolak popa (BOI18_popa) C++17
61 / 100
 121 ms 332 KB 
#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 = i;
        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

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.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 208 KB Output is correct
2 Correct 11 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 14 ms 208 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 328 KB Output is correct
2 Correct 96 ms 332 KB Output is correct
3 Correct 74 ms 324 KB Output is correct
4 Correct 121 ms 332 KB Output is correct

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 208 KB too many queries
2 Halted 0 ms 0 KB -