Submission #550051

#	Time	Username	Problem	Language	Result	Execution time	Memory
550051		palilo	Cave (IOI13_cave)	C++17	0 / 100	20 ms	468 KiB

cave

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

void exploreCave(int n) {
    using namespace std;
    vector s(n, 0), d(n, -1);
    auto solve = [&](int door_id) {
        const auto is_one {tryCombination(s.data()) == door_id};
        int lo = 0, hi = n;
        while (lo != hi) {
            const auto mid {(lo + hi) >> 1};
            transform(d.begin() + lo, d.begin() + mid, s.begin() + lo, [&](const auto& x) { return x == -1 ? -1 : 1; });
            tryCombination(d.data()) == door_id == is_one ? lo = mid + 1 : hi = mid;
        }
        s[lo] = is_one;
        d[lo] = door_id;
    };
    for (int i = 0; i < n; ++i) {
        solve(i);
    }
    answer(s.data(), d.data());
}

Compilation message (stderr)

cave.cpp: In lambda function:
cave.cpp:13:38: warning: suggest parentheses around comparison in operand of '==' [-Wparentheses]
   13 |             tryCombination(d.data()) == door_id == is_one ? lo = mid + 1 : hi = mid;
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~

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