제출 #716664

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
716664		TheSahib	Cave (IOI13_cave)	C++17	100 / 100	265 ms	468 KiB

cave

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

using namespace std;

void exploreCave(int N) {
    int S[N];
    memset(S, 0, sizeof(S));

    vector<int> switches(N);
    for (int i = 0; i < N; i++)
    {
        switches[i] = i;
    }
    
    int ans[N];
    for (int i = 0; i < N; i++)
    {
        for(int a:switches){
            S[a] = 0;
        }
        if(tryCombination(S) != i){
            for(int a:switches){
                S[a] = 1;
            }
        }
        int l = 0, r = switches.size() - 1;
        while(l < r){
            int mid = (l + r) / 2;
            for(int j = l; j <= mid; j++){
                S[switches[j]] ^= 1;
            }
            int t = tryCombination(S);

            for(int j = l; j <= mid; j++){
                S[switches[j]] ^= 1;
            }

            if(t != i)
                r = mid;
            else
                l = mid + 1;
        }
        S[switches[l]] ^= 1;
        ans[switches[l]] = i;
        switches.erase(switches.begin() + l);
    }
    answer(S, ans);
}

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