Submission #654847

#	Time	Username	Problem	Language	Result	Execution time	Memory
654847		benjaminkleyn	Cave (IOI13_cave)	C++17	100 / 100	280 ms	464 KiB

cave

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

void flip(int l, int r, int s[], bool vis[])
{
    for (int i = l; i <= r; i++)
        if (!vis[i])
            s[i] ^= 1;
}

void exploreCave(int N)
{
    int res, d[N], s[N], l, r, m;
    bool flag1, flag2, vis[N];
    memset(d, 0, sizeof(d));
    memset(s, 0, sizeof(s));
    memset(vis, false, sizeof(vis));
    for (int i = 0; i < N; i++)
    {
        res = tryCombination(s);
        flag1 = !(res > i || res == -1);

        l = 0, r = N - 1;
        while (l != r)
        {
            m = (l + r) / 2;
            flip(l, m, s, vis);
            res = tryCombination(s);
            flag2 = !(res > i || res == -1);
            flip(l, m, s, vis);
            if (flag1 != flag2)
                r = m;
            else
                l = m + 1;
        }
        d[l] = i;
        s[l] = flag1;
        vis[l] = true;
    }
    answer(s, d);
}

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