Submission #1038511

#	Time	Username	Problem	Language	Result	Execution time	Memory
1038511		attky	Cave (IOI13_cave)	C++17	0 / 100	26 ms	604 KiB

cave

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

void exploreCave(int n) {
    int state[n], pos[n];
    bool good[n];
    for(int loop = 0; loop < n; ++loop) {
        good[loop] = false;
        pos[loop] = -1;
    }
    for(int loop = 0; loop < n; ++loop) {
        for(int looping = 0; looping < n; ++looping) {
            if(!good[looping]) {
                state[looping] = 1;
            }
        }
        int ans = tryCombination(state)-1;
        if(ans < 0) {
            ans = 2e9;
        }
        bool closed = (ans == loop);
        int deb = 0, fin = n-1;
        while(fin-deb > 0) {
            int mid = (deb+fin)/2;
            for(int looping = mid+1; looping <= fin; ++looping) {
                if(!good[looping]) {
                    state[looping] = 1-state[looping];
                }
            }
            int newAns = tryCombination(state)-1;
            if(newAns < 0) {
                newAns = 2e9;
            }
            bool newClosed = (ans == loop);
            if((newClosed && closed) || (!newClosed && !closed)) {
                fin = mid;
            }
            else {
                deb = mid+1;
            }
        }
        good[deb] = true;
        pos[deb] = loop+1;
    }
    answer(state, pos);
}

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