Submission #611679

#	Time	Username	Problem	Language	Result	Execution time	Memory
611679		jhnah917	Cave (IOI13_cave)	C++14	100 / 100	251 ms	672 KiB

cave

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

int A[5000], Pos[5000], Fin[5000];

void exploreCave(int n){
    for(int i=0; i<n; i++){
        int l = 0, r = n-1;
        int now = tryCombination(A); if(now == -1) now = 1e9;
        assert(now >= i);
        while(l < r){
            int m = (l + r) / 2;
            for(int j=l; j<=m; j++) if(!Fin[j]) A[j] ^= 1;
            int t = tryCombination(A); if(t == -1) t = 1e9;
            for(int j=l; j<=m; j++) if(!Fin[j]) A[j] ^= 1;
            if((now > i) != (t > i)) r = m;
            else l = m + 1;
        }
        Pos[r] = i; Fin[r] = 1;
        if(now <= i) A[r] ^= 1;
    }
    answer(A, Pos);
}

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