oj.uz

Submission #145043

# Submission time Handle Problem Language Result Execution time Memory
145043 2019-08-18T13:32:55 Z MKopchev popa (BOI18_popa) C++14
0 / 100
 22 ms 504 KB 
#include<bits/stdc++.h>
#include<popa.h>
using namespace std;

stack<int> open,idle;

int ask(int a,int b,int c,int d)
{
    assert(a<=b);
    assert(c<=d);
    return query(a,b,c,d);
}
int solve(int N, int* Left, int* Right)
{
    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();
        }

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

    open=idle;
    Right[N-1]=-1;
    open.push(N-1);
    for(int i=N-2;i>=0;i--)
    {
        int prev=-1;
        while(open.size()&&ask(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.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 376 KB not a valid binary tre
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 248 KB too many querie
2 Halted 0 ms 0 KB -