Submission #1347606

#	Time	Username	Problem	Language	Result	Execution time	Memory
1347606		kim	Cave (IOI13_cave)	C++20	100 / 100	763 ms	516 KiB

cave

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

void exploreCave(int N){
    int S[N], S2[N], D[N];
    int K = 31 - __builtin_clz(N);
    fill(S2, S2+N, -1);
    for(int i=0;i<N;++i){
        int id = 0;
        bool b = 1;
        for(int j=0;j<N;++j) S[j] = (S2[j]==-1 ? !b : S2[j]);
        if(tryCombination(S) != i) b = !b;
        for(int j=1;j<=N;j<<=1){
            for(int k=0;k<N;++k) S[k] = (S2[k]==-1 ? ((k&j) ? b : !b) : S2[k]);
            if(tryCombination(S) != i) id |= j;
        }
        S2[id] = b;
        D[id] = i;
    }
    answer(S2,D);
}

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