Submission #456213

#	Time	Username	Problem	Language	Result	Execution time	Memory
456213		BT21tata	동굴 (IOI13_cave)	C++17	0 / 100	542 ms	380 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

int c[5005], d[5005];

int generate(int l, int r, int n, bool curval)
{
    int cur[n];
    for(int i=0; i<l; i++) cur[i]=!curval;
    for(int i=l; i<=r; i++) cur[i]=curval;
    for(int i=r+1; i<n; i++) cur[i]=!curval;
    
    for(int i=0; i<n; i++)
        if(d[i]!=-1) cur[i]=c[i];

    int x=tryCombination(cur);
    return x;
}

void exploreCave(int n)
{
    memset(d, -1, sizeof(d));
    bool curval;
    for(int i=0; i<n; i++)
    {
        if(generate(0, n-1, n, 0)==i-1) curval=1;
        else curval=0;

        int l=0, r=n-1, mid;
        while(l<=r)
        {
            mid=(l+r)>>1;
            if(generate(l, mid, n, curval)==i-1) l=mid+1;
            else r=mid-1;
        }
        c[l]=curval;
        d[l]=i;
    }
    answer(c, d);
}

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