제출 #501718

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
501718		dnaux	동굴 (IOI13_cave)	C++17	0 / 100	407 ms	384 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
#define endline "\n"
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define lsb(i) i&(-i)
#define sz(i) (int)i.size()
 
typedef long long ll;
using namespace std;
const ll INF = 1e18L;
constexpr int mod = int(1e9) + 7;
 
ll t=1, n, k, cases = 0; 

void exploreCave(int n){
    int check[n],door[n];
    for(int i = 0; i < n; i++)check[i] = -1;
    for(int i = 0; i < n; i++){

        int S[n] = {};
        for(int i = 0; i < n; i++){
            if(check[i] != -1)S[i] = check[i];
        }

        int cur;
        int bruh = tryCombination(S);
        if(bruh > i or bruh == -1)cur = 0;
        else cur = 1;

        int l = 1, r = n + 1;
        while(r - l > 1){
            int m = (r + l) / 2;

            for(int i = 0; i < n; i++){
                if(check[i] != -1)S[i] = check[i];
                else if(i >= l and i <= m)S[i] = cur;
                else S[i] = cur ^ 1;
            }

            bruh = tryCombination(S);
            if(bruh > i or bruh == -1)r = m;
            else l = m;
        }
        check[l] = cur;
        door[l] = i;
    }
    answer(check, door);
}

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