제출 #535394

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
535394		AngusWong	동굴 (IOI13_cave)	C++17	100 / 100	210 ms	620 KiB

cave

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

void exploreCave(int n) {
    int s[n], d[n], comb[n];
    vector<int> switches;
    for (int i=0; i<n; i++) switches.push_back(i);
    for (int door=0; door<n; door++){
        for (int i: switches) comb[i]=0;
        if (tryCombination(comb)==door){
            for (int i: switches) comb[i]=1;
        }
        int l=0, r=switches.size()-1, mid;
        while (l<r){
            mid=(l+r)/2;
            for (int i=mid+1; i<=r; i++) comb[switches[i]]=1-comb[switches[i]];
            if (tryCombination(comb)==door){
                for (int i=mid+1; i<=r; i++) comb[switches[i]]=1-comb[switches[i]];
                l=mid+1;
            }else{
                r=mid;
            }
        }
        s[switches[l]]=comb[switches[l]];
        d[switches[l]]=door;
        switches.erase(switches.begin()+l);
    }
    answer(s, d);
}

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