Submission #418742

#	Time	Username	Problem	Language	Result	Execution time	Memory
418742		dxz05	Cave (IOI13_cave)	C++14	100 / 100	931 ms	580 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
    int comb[N], S[N], D[N];
    fill(S, S + N, -1);

    vector<int> free;
    for (int i = 0; i < N; i++) free.push_back(i);

    for (int i = 0; i < N; i++){
        int ind = 0;

        for (int j = 0; j < N; j++){
            comb[j] = (S[j] != -1 ? S[j] : 0);
        }

        int res = tryCombination(comb);
        int x;

        if (res == -1 || res > i) x = 0; else
            x = 1;

        int l = 0, r = free.size() - 1;
        while (l <= r){
            int mid = (l + r) >> 1;

            for (int j = 0; j < N; j++){
                if (S[j] != -1){
                    comb[j] = S[j];
                    continue;
                }
                if (j <= free[mid]) comb[j] = x ^ 1; else
                    comb[j] = x;
            }

            res = tryCombination(comb);
            if (res == i){
                ind = mid;
                r = mid - 1;
            } else l = mid + 1;

        }

        int pos = free[ind];

        S[pos] = x;
        D[pos] = i;

        //cout << "val=" << i << "\tS=" << x << ' ' << "\tD=" << pos << endl;

        free.erase(free.begin() + ind, free.begin() + ind + 1);

    }

    answer(S, D);
}

/*
4
1 1 1 0
3 1 0 2

5
0 1 0 1 0
2 4 0 1 3
*/

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