Submission #145027

#	Time	Username	Problem	Language	Result	Execution time	Memory
145027		MKopchev	popa (BOI18_popa)	C++14	0 / 100	41 ms	424 KiB

popa

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

stack<int> open,idle;
int solve(int N, int* Left, int* Right)
{
    for(int i=0;i<N;i++)
    {
        int prev=-1;
        while(open.size()&&query(open.top(),i,i,i))
        {
            prev=open.top();
            open.pop();
        }

        Left[i]=prev;
        open.push(i);
    }

    open=idle;
    for(int i=N-1;i>=0;i--)
    {
        int prev=-1;
        while(open.size()&&query(i,open.top(),i,i))
        {
            prev=open.top();
            open.pop();
        }

        Right[i]=prev;
        open.push(i);
    }

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

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

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