Submission #1144573

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144573		orzdraiduwu	Cave (IOI13_cave)	C++20	0 / 100	162 ms	548 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

int tog(int c) { return c == 0; }
void exploreCave(int n) {
    // int s[n]; memset(s, 0, sizeof s);
    int v[n]; memset(v, 0, sizeof v);
    int vs[n]; memset(vs, 0, sizeof vs);
    int d[n]; memset(d, 0, sizeof d);
    for(int i = 0 ; i < n ; i++) {
        int w[n]; memcpy(v, w, sizeof w);
        int l = 0, r = n;
        int k = tryCombination(w);
        while(r > l) {
            int m = (l+r)/2;
            for(int j = 0 ; j < m ; j++) {
                if(!vs[j]) {
                    w[j] = tog(w[j]);
                }
            }
            
            int kv = tryCombination(w);
            if(kv != k) r = m-1;
            else l = m+1;
            k = kv;
        }

        // s[l] = i;
        if(k > i+1) v[l] = 1;
        else v[l] = 0;
        vs[l] = 1;
        d[i] = l+1;
    }

    answer(v, d);
}

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