Submission #1347996

#	Time	Username	Problem	Language	Result	Execution time	Memory
1347996		duduh	동굴 (IOI13_cave)	C++17	0 / 100	157 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=0;j<K;j++){
            for(int k=0;k<N;k++) s[k] = (s[k] == -1) ? ((k&(1<<j)) ? b : !b) : s2[k];
            if(tryCombination(s) != i) id |= (1<<j);
        }
        s2[id] = b;
        d[id] = i;
    }
    answer(s2,d);
}

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