Submission #655458

#	Time	Username	Problem	Language	Result	Execution time	Memory
655458		angelo_torres	Cave (IOI13_cave)	C++17	100 / 100	264 ms	560 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
 
using namespace std;
 
int vis[5005],S[5005],D[5005];
 
void exploreCave(int N) {
    for(int i = 0; i < N; ++i) S[i] = 0;
    for(int i = 0; i < N; ++i){
        bool fl = (i == tryCombination(S));
        int l = 0, r = N-1;
        while(r != l){
            int md = (l+r)>>1;
            int kl = l, kr = md;
            for(int j = l; j <= md; ++j) if(!vis[j]) S[j] = 1-S[j];
            bool gl = (i == tryCombination(S));
            if(fl == gl) l = md+1;
            else r = md;
            for(int j = kl; j <= kr; ++j) if(!vis[j]) S[j] = 1-S[j];
        }
        if(fl) S[l] = 1-S[l];
        D[l] = i, vis[l] = 1;
    }
    answer(S,D);
}

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