Submission #648862

#	Time	Username	Problem	Language	Result	Execution time	Memory
648862		JANCARAPAN	Cave (IOI13_cave)	C++17	0 / 100	4 ms	340 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

// int tryCombination(vector<int> &a);
// void answer(vector<int> &a, vector<int> &b);


void exploreCave(int n) {
    int pos[n], con[n];

    for (int i=0; i<n; i++) {
        // per a cada porta faig bs dels interruptors
        int l = i, r = n + 1;
        bool on = 1;
        while (r - l > 1) {
            int m = (l + r) / 2;
            bool can = 0;
            if (tryCombination(pos) == i) {
                on = 0;
                can = 1;
            }
            for (int j=i; j<m; j++) {
                pos[j] = 1;
            }
            if (tryCombination(pos) == i) {
                on = 1;
                can = 1;
            }

            if (can) {
                r = m;
            } else {
                l = r;
            }
        }
        pos[i] = on;
        con[i] = r;
    }

    answer(pos, con);
}

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