제출 #61155

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
61155		SpaimaCarpatilor	popa (BOI18_popa)	C++17	61 / 100	336 ms	740 KiB

popa

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

using namespace std;

int solve (int l, int r, int *Left, int *Right)
{
    if (l > r) return -1;
    if (l == r)
        return l;
    if (r == l + 1)
    {
        if (query (l, l, l, r))
        {
            Right[l] = r;
            return l;
        }
        Left[r] = l;
        return r;
    }
    int ras = r, p = l, u = r - 1, mij;
    while (p <= u)
    {
        mij = (p + u) >> 1;
        if (query (l, mij, l, r)) ras = mij, u = mij - 1;
        else p = mij + 1;
    }
    Left[ras] = solve (l, ras - 1, Left, Right);
    Right[ras] = solve (ras + 1, r, Left, Right);
    return ras;
}

int solve (int nn, int* Left, int* Right)
{
    int N = nn;
    for (int i=0; i<N; i++)
        Left[i] = Right[i] = -1;
    int root = solve (0, N - 1, Left, Right);
    return root;
}

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