Submission #670996

#	Time	Username	Problem	Language	Result	Execution time	Memory
670996		birthdaycake	Cave (IOI13_cave)	C++17	0 / 100	253 ms	388 KiB

cave

#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int n) {
    int vs[n],val[n],sw[n];
    memset(vs, 0, sizeof vs);
    memset(val, 0, sizeof val);
    memset(sw, 0, sizeof sw);
    
    
    for(int i = 0; i < n; i++){
        int comb = 0;
        for(int j = 0; j < n; j++){
            if(!vs[j]) val[j] = 0;
        }
        int x = tryCombination(val);
        
        if(x == i) comb = 1;
        
        int l = 0, r = n - 1;
        while(l < r){
            int mid = (l + r) / 2;
            for(int j = l; j <= mid; j++){
                if(!vs[j]) val[j] = comb;
            }
            for(int j = 0; j < mid; j++){
                if(!vs[j]) val[j] = !comb;
            }
            for(int j = mid + 1; j < n; j++){
                if(!vs[j]) val[j] = !comb;
            }
            x = tryCombination(val);
            if(x == i){
                l = mid + 1;
            }else{
                r = mid;
            }
        }
        val[r] = comb;
        sw[r] = i;
        vs[r] = 1;
    }
    answer(val, sw);
}

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