제출 #1038529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038529		attky	동굴 (IOI13_cave)	C++17	100 / 100	163 ms	604 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
 
using namespace std;
 
void exploreCave(int n) {
    int state[n], pos[n];
    bool good[n];
    for(int loop = 0; loop < n; ++loop) {
        good[loop] = false;
        pos[loop] = -1;
    }
    for(int loop = 0; loop < n; ++loop) {
        for(int looping = 0; looping < n; ++looping) {
            if(!good[looping]) {
                state[looping] = 1;
            }
        }
        int ans = tryCombination(state);
        if(ans < 0) {
            ans = 2e9;
        }
        bool closed = (ans == loop);
        int deb = 0, fin = n-1;
        while(fin-deb > 0) {
            int mid = (deb+fin)/2;
            for(int looping = mid+1; looping <= fin; ++looping) {
                if(!good[looping]) {
                    state[looping] = 1-state[looping];
                }
            }
            int newAns = tryCombination(state);
            if(newAns < 0) {
                newAns = 2e9;
            }
            bool newClosed = (newAns == loop);
            if((newClosed && closed) || (!newClosed && !closed)) {
                fin = mid;
            }
            else {
                deb = mid+1;
            }
            ans = newAns;
            closed = newClosed;
        }
        good[deb] = true;
        pos[deb] = loop;
        if(closed) {
            state[deb] = 1 - state[deb];
        }
    }
    answer(state, pos);
}

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