oj.uz

Submission #85101

# Submission time Handle Problem Language Result Execution time Memory
85101 2018-11-18T13:50:36 Z nikolapesic2802 popa (BOI18_popa) C++14
0 / 100
 3 ms 720 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
/*bool query(int a,int b,int c,int d)
{
    printf("%i-%i  %i-%i?\n",a,b,c,d);
    int res;
    scanf("%i",&res);
    return res;
}*/
int query(int a,int b,int c,int d);
bool levo(int poz)
{
    return query(poz,poz,poz,poz-1);
}
bool desno(int poz)
{
    return query(poz,poz,poz,poz+1);
}
int n;
bool inside(int poz)
{
    return poz>=0&&poz<n;
}
int solve(int _N,int* Left,int* Right)
{
    n=_N;
    fill(Left,Left+n,-1);
    fill(Right,Right+n,-1);
    vector<int> parent(n);
    fill(parent.begin(),parent.end(),-1);
    for(int i=0;i<n;i++)
    {
        if(inside(i-1)&&parent[i]==-1)
        {
            if(levo(i))
            {
                int tr=i-1;
                while(parent[tr]!=-1)
                    tr=parent[tr];
                int l=tr,r=i-1;
                while(l<r)
                {
                    int m=(l+r)>>1;
                    if(query(i,i,m,i))
                    {
                        r=m;
                    }
                    else
                    {
                        l=m+1;
                    }
                }
                parent[i]=parent[l];
                Right[parent[i]]=i;
                Left[i]=l;
                parent[l]=i;
            }
            else
                assert(0);
        }
        if(inside(i+1))
        {
            if(desno(i))
            {
                assert(parent[i+1]==-1);
                parent[i+1]=i;
                Right[i]=i+1;
            }
        }
       /* printf("Left:\n");
        for(int i=0;i<n;i++)
        {
            printf("%i ",Left[i]);
        }
        printf("\nRight:\n");
        for(int i=0;i<n;i++)
        {
            printf("%i ",Right[i]);
        }
        printf("\n");*/
    }
    for(int i=0;i<n;i++)
    {
        if(parent[i]==-1)
            return i;
    }
    assert(0);
    /*printf("Left:\n");
    for(int i=0;i<n;i++)
    {
        printf("%i ",Left[i]);
    }
    printf("\nRight:\n");
    for(int i=0;i<n;i++)
    {
        printf("%i ",Right[i]);
    }*/
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 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 Runtime error 3 ms 580 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

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