Submission #1216982

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216982		lukasuliashvili	Cave (IOI13_cave)	C++20	0 / 100	204 ms	528 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int s[N+5],fix[N+5],ans[N+5];
    for (int i=0; i<N; i++) {
        s[i]=0;
    }
    for (int i=0; i<N; i++) {
        int l=0;
        int r=N-1;
        while (l<=r) {
            int mid = (l+r)/2;
            for (int j=0; j<l; j++) {
                s[j]=fix[i]^1;
            }
            for (int j=l; j<=mid; j++) {
                s[j]=fix[i];
            }
            for (int j=mid+1; j<N; j++) {
                s[j]=fix[i]^1;
            }
            int last=tryCombination(s);
            if (last<=i){
                fix[i]^=1;
                l=mid+1;
            }
            else {
                if (l==r) {
                    ans[i]=l;
                }
                r=mid-1;
            }
        }
    }
    answer(fix,ans);
}

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