Submission #1202866

#	Time	Username	Problem	Language	Result	Execution time	Memory
1202866		AMel0n	Cave (IOI13_cave)	C++20	0 / 100	93 ms	324 KiB

cave

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

typedef long long ll;
#define FOR(i,N) for(ll i = 0; i < N; i++)
#define all(x) (x).begin(), (x).end()
// #define F first 
// #define S second


#include "cave.h"

int N;
int S[5005], D[5005];   // D[i] door that switch i is linked to
void skibidi(int d) {
    int ret = tryCombination(S);
    int l = 0, r = N;
    while(l < r) {
        int m = (l + r) / 2;
        for(int i = l; i <= m; i++) {
            if (D[i] != -1) S[i] = 1 - S[i];
        }
        if (tryCombination(S) == ret) {
            r = m;
        } else {
            l = m + 1;
        }
    }
    D[l] = d;
}

void exploreCave(int N) {
    ::N = N;
    fill(D, D+5005, -1);
    FOR(door, N) skibidi(door);
    answer(S, D);
}



// signed main() {
//     cin.tie(0); ios::sync_with_stdio(false);

// }

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