제출 #883898

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883898		Malix	동굴 (IOI13_cave)	C++14	0 / 100	100 ms	604 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 p1=0,p2=0;
    int l=0,r=N-1;
    while(pos<N){
        REP(i,0,N)a[i]=0;
        while(N){
            int k=(l+r)/2;
            REP(i,l,k)a[i]=1;
            REP(i,0,pos)a[d[i]]=s[d[i]];
            p1=tryCombination(a);
            REP(i,l,k)a[i]=0;
            REP(i,0,pos+1)a[d[i]]=s[d[i]];
            p2=tryCombination(a);
            if((p1==pos)^(p2==pos))r=k+1;
            else l=k;
            if(l==r){
                d[pos]=l;
                a[l]=0;
                p1=tryCombination(a);
                if(p1==pos)s[l]=1;
                else s[l]=0;
                break;
            }
            cout<<l<<" "<<r;
        }
        pos++;
    }
    answer(s,d);
}

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