Submission #964138

#	Time	Username	Problem	Language	Result	Execution time	Memory
964138		maxFedorchuk	Cave (IOI13_cave)	C++17	100 / 100	691 ms	768 KiB

cave

#include <bits/stdc++.h>
#include <cave.h>

using namespace std;

const long long MX=5e3+10;
int zal[MX],pol[MX];
int n;

void cnt(int in)
{
    int zap[n];

    for(int i=0;i<n;i++)
    {
        zap[i]=(pol[i]==-1?0:pol[i]);
    }
    int rt=tryCombination(zap),ndc;
    if(rt==-1)
    {
        rt=n;
    }

    if(rt>in)
    {
        ndc=0;
    }
    else
    {
        ndc=1;
    }


    int l=0,r=n-1;
    while(l<r)
    {
        int mid=(l+r)/2;

        for(int i=0;i<n;i++)
        {
            zap[i]=pol[i];
            if(zap[i]==-1)
            {
                if(l<=i && i<=mid)
                {
                    zap[i]=ndc;
                }
                else
                {
                    zap[i]=(ndc^1);
                }
            }
        }

        rt=tryCombination(zap);
        if(rt==-1)
        {
            rt=n;
        }

        if(rt>in)
        {
            r=mid;
        }
        else
        {
            l=mid+1;
        }
    }

    zal[r]=in;
    pol[r]=ndc;
}

void exploreCave(int N)
{
    n=N;

    for(int i=0;i<n;i++)
    {
        pol[i]=-1;
        zal[i]=-1;
    }

    for(int i=0;i<n;i++)
    {
        cnt(i);
    }

    int anspol[n],anszal[n];
    for(int i=0;i<n;i++)
    {
        anspol[i]=pol[i];
        anszal[i]=zal[i];
    }

    answer(anspol,anszal);
}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24