Submission #985191

#	Time	Username	Problem	Language	Result	Execution time	Memory
985191		user736482	Cave (IOI13_cave)	C++17	0 / 100	48 ms	348 KiB

cave

#include<bits/stdc++.h>
#include<cave.h>
using namespace std;
int result[5000],match[5000],sent[5000];
bool iflastopen,fixed_[5000];
int N;
void change(int a, int b, int c){
    for(int i=a;i<=b;i++){
        if(!fixed_[i])
            sent[i]= c;
    }
}

void exploreCave(int n){
    N = n;
    for(int j=0;j<n;j++){
        change(0,n-1,0);
        int p=tryCombination(sent);
        if(p>j || p==-1)
            iflastopen=1;
        else
            iflastopen=0;
        int pocz=0;
        int kon=n-1;
        while(pocz!=kon){
            int sr=(pocz+kon)/2;
            change(pocz,sr,iflastopen);
            change(sr+1,kon,!iflastopen);
            int ak=tryCombination(sent);
            if(ak > j || ak==-1)
            {
                kon=sr;
            }
            else{
                pocz=sr+1;
            }
        }
        sent[pocz] = iflastopen;
        match[j]=pocz;
        fixed_[pocz]=1;
    }
    answer(sent,match);
}

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