제출 #145323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145323		MKopchev	popa (BOI18_popa)	C++14	100 / 100	104 ms	508 KiB

popa

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

stack<int> open,idle;

int n_,in_;

int ask(int a,int b,int c,int d)
{
    while(a>b);
    while(c>d);
    in_++;
    return query(a,b,c,d);
}
int solve(int N, int* Left, int* Right)
{
    n_=N;
    in_=0;
    for(int i=0;i<N;i++)Left[i]=-1,Right[i]=-1;

    open=idle;

    Left[0]=-1;
    open.push(0);
    for(int i=1;i<N;i++)
    {
        int prev=-1;
        while(open.size()&&ask(open.top(),i,i,i))
        {
            prev=open.top();
            open.pop();
        }

        if(open.size())Right[open.top()]=i;
        Left[i]=prev;
        open.push(i);
    }

    set<int> seen={};
    for(int i=0;i<N;i++)
    {
        seen.insert(Left[i]);
        seen.insert(Right[i]);
    }

    assert(in_<=4*N);

    for(int i=0;i<N;i++)
        if(seen.count(i)==0)return i;
    assert(0==1);
}

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