제출 #883913

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883913		Malix	동굴 (IOI13_cave)	C++14	12 / 100	287 ms	524 KiB

cave

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

using namespace std;

typedef vector<int> vi;

#define REP(i,a,b) for(int i=a;i<b;i++)

void exploreCave(int N) {
    /* ... */
    int s[N],d[N];
    int a[N];
    int pos=0;int p=0;
    while(pos<N){
        REP(i,0,N)a[i]=0;
        REP(i,0,pos)a[d[i]]=s[d[i]];
        p=tryCombination(a);
        if(p==pos)s[pos]=1;
        else s[pos]=0;
        int l=0;int r=N-1;
        while(N){
            int k=(l+r)/2;
            if(s[pos]==0){
                REP(i,0,N)a[i]=1;
                REP(i,l,k+1)a[i]=0;
            }
            else{
                REP(i,0,N)a[i]=0;
                REP(i,l,k+1)a[i]=1;
            }
            REP(i,0,pos)a[d[i]]=s[d[i]];
            p=tryCombination(a);
            if(p==pos)l=k+1;
            else r=k;
            if(l==r)break;
        }
        d[pos]=l;
        pos++;
    }
    int ans[N];
    REP(i,0,N)ans[d[i]]=i;
    answer(s,ans);
}

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