oj.uz

답안 #145311

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145311 2019-08-19T14:57:45 Z MKopchev popa (BOI18_popa) C++14
61 / 100
 160 ms 500 KB 
#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]=0,Right[i]=0;

    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();
        }

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

    int prev=-1;
    while(open.size())
    {
        Right[open.top()]=prev;
        prev=open.top();
        open.pop();
    }

    open=idle;
    Right[N-1]=-1;
    open.push(N-1);
    for(int i=N-2;i>=0;i--)
    {
        int prev=-1;

        if(Right[i])
        {
            while(open.top()!=Right[i])
                open.pop();
            prev=Right[i];
        }
        else
        while(open.size()&&Left[open.top()]!=i&&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]);
    }

    assert(in_<=4*N);

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

Subtask #1
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 248 KB Output is correct
2 Correct 21 ms 376 KB Output is correct
3 Correct 23 ms 412 KB Output is correct
4 Correct 18 ms 376 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 424 KB Output is correct
2 Correct 114 ms 384 KB Output is correct
3 Correct 104 ms 328 KB Output is correct
4 Correct 131 ms 500 KB Output is correct

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 248 KB too many querie
2 Halted 0 ms 0 KB -