Submission #223951

#	Time	Username	Problem	Language	Result	Execution time	Memory
223951		DS007	Cave (IOI13_cave)	C++14	0 / 100	129 ms	512 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
 
void exploreCave(int n) {
    int d_[n], s_[n];
    memset(d_, -1, sizeof(d_));
    memset(s_, -1, sizeof(s_));
 
    for (int i = 0; i < n; i++) {
        int s[n] = {};
        for (int j = 0; j < n; j++) {
            if (s_[j] != -1)
                s[j] = s_[j];
        }
 
        int x = tryCombination(s);
        int l = 0, h = n - 1, ans = -1;
 
        while (l <= h) {
            int temp[n];
            copy(temp, temp + n, s);
            int mid = (l + h) / 2;
 
            for (int j = l; j <= mid; j++)
                temp[j] = d_[j] == -1 ? 1 : s[j];
 
            int y = tryCombination(temp);
            if ((x == i && y != i) || (x != i && y == i))
                ans = mid, h = mid - 1;
            else
                l = mid + 1;
        }
 
        d_[ans] = i;
        s_[ans] = x == i;
    }
 
    answer(s_, d_);
}

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