제출 #890064

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

cave

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <array>
#include <stack>
#include <cmath>
#include <iomanip>
#include <cassert>
#include "cave.h"

using namespace std;

typedef long long ll;

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

void exploreCave(int n){
    int s[6000], d[6000];

    vector<int> active(n);
    iota(active.begin(), active.end(), 0);

    for(int i = 0; i < n; ++i){
        int l = 0, r = active.size() - 1;

        int prv = tryCombination(s);

        while(l != r){
            int mid = (l + r + 1) >> 1;

            for(int i = 0; i <= mid; ++i)
                s[active[i]] = 1;
            for(int i = mid; i < n; ++i)
                s[active[i]] = 0;

            if((tryCombination(s) == i) != (prv == i)){
                l = mid;
            }
            else{
                r = mid - 1;
            }
        }

        int key = active[l];
        active.erase(find(active.begin(), active.end(), key));

        if(prv == i){
            s[key] = 1;
            d[key] = i;
        }
    }
    answer(s, d);
}

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