제출 #970614

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970614		Acanikolic	동굴 (IOI13_cave)	C++14	0 / 100	1 ms	348 KiB

cave

#include <bits/stdc++.h>

#include "cave.h"

using namespace std;

void exploreCave(int N) {
    int S[N],D[N];
    for(int i = 0; i < N; i++) {
        S[i] = 0;
        D[i] = -1;
    }
    for(int k = 0; k < N; k++) {
        int index = tryCombination(S);
        if(index == -1) break;
        int l = 0,r = N - 1,ans = 0;
        while(l <= r) {
            int mid = (l + r) / 2;
            S[mid] ^= 1;
            if(tryCombination(S) > index || tryCombination(S) == -1) {
                ans = mid;
                S[mid] ^= 1;
                break;
            }
            S[mid] ^= 1;
            if(tryCombination(S) == index) {
                l = mid + 1;
            }else {
                r = mid - 1;
            }
        }
        S[ans] ^= 1;
        D[ans] = index;
    }
    int SS[N];
    for(int i = 0; i < N; i++) {
        SS[i] = 1;
    }
    for(int i = 0; i < N; i++) if(D[i] != -1) SS[i] = S[i];
    for(int k = 0; k < N; k++) {
        int index = tryCombination(SS);
        if(index == -1) break;
        int l = 0,r = N - 1,ans = 0;
        while(l <= r) {
            int mid = (l + r) / 2;
            SS[mid] ^= 1;
            if(tryCombination(SS) > index || tryCombination(SS) == -1) {
                ans = mid;
                SS[mid] ^= 1;
                break;
            }
            SS[mid] ^= 1;
            if(tryCombination(SS) == index) {
                l = mid + 1;
            }else {
                r = mid - 1;
            }
        }
        SS[ans] ^= 1;
        D[ans] = index;
    }
    answer(S,D);
}

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