제출 #668441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668441		allin27x	동굴 (IOI13_cave)	C++14	51 / 100	2082 ms	684 KiB

cave

#include <iostream>
#include <vector>
#include <unordered_set>
#include "cave.h"
using namespace std;

int tryCombination(int S[]);
void answer(int S[], int D[]);

void exploreCave(int N){
    int doors[N]={};
    int perm[N] = {};

    unordered_set<int> f;
    int tr[N] = {};
    for (int s=0; s<N; s++){
        int a = 0, b = N-f.size()-1;
        int pos = 0;
        for (int i=0; i<N; i++){
            if (f.count(i)) tr[i] = perm[i]; else tr[i]=0;
        }
        int r = tryCombination(tr);
        if (r==s) pos = 1;
        while (a!=b){
            int m = (a+b)/2;
            int t=0;
            for (int i=0; i<N; i++){
                if (f.count(i)) tr[i] = perm[i]; else {tr[i]=(t<=m)?pos:!pos; t++;}
            }
            r = tryCombination(tr);
            if (r==s) a = m+1; else b =m;
        }
        int t=0;
        while (b+1){
            if (!f.count(t)) b--;
            t++;
        }
        t--;
        doors[t] = s;
        perm[t] = pos;
        f.insert(t);
    }
    answer(perm, doors);

}

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