Submission #556153

#	Time	Username	Problem	Language	Result	Execution time	Memory
556153		n0sk1ll	동굴 (IOI13_cave)	C++14	100 / 100	1008 ms	560 KiB

cave

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

using namespace std;

int n;
bool vis[5005];
bool sta[5005];

int probaj(int l, int r, bool dobar)
{
    int c[n];
    for (int i=0;i<n;i++) c[i]=!dobar;
    for (int i=l;i<=r;i++) c[i]=dobar;
    for (int i=0;i<n;i++) if (vis[i]) c[i]=sta[i];
    int what=tryCombination(c);
    return what;
}

void exploreCave(int N)
{
    n=N;
    int s[n],d[n];

    for (int i=0;i<n;i++)
    {
        bool dobar=1;
        int l=0,r=n-1;
        if (probaj(l,r,dobar)==i) dobar=0;
        while (l!=r)
        {
            int mid=(l+r)/2;
            if (probaj(l,mid,dobar)==i) l=mid+1;
            else r=mid;
        }
        vis[l]=1;
        sta[l]=dobar;
        d[l]=i,s[l]=sta[l];
    }

    answer(s,d);
}

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