Submission #1280834

#	Time	Username	Problem	Language	Result	Execution time	Memory
1280834		Lobo	Cave (IOI13_cave)	C++17	0 / 100	1 ms	340 KiB

cave

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

void exploreCave(int N) {

    int s[N];
    int d[N];
    
    for(int i = 0; i < N; i++) {
        s[N] = 0;
        d[N] = -1;
    }

    for(int i = 0; i < N; i++) {
        int l = 0; 
        int r = N-1;
        int mid = (l+r)/2;
        while(l != r) {

            int q1 = tryCombination(s);
            
            for(int j = l; j <= mid; j++) {
                if(d[j] == -1) s[j] = 1 - s[j];
            }

            int q2 = tryCombination(s);

            if(min(q1,q2) == i && max(q1,q2) != i) {
                r = mid;
            }
            else {
                l = mid + 1;
            }
        }
        d[l] = i;
    }
}

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