Submission #1292233

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292233		hynmj	동굴 (IOI13_cave)	C++20	0 / 100	278 ms	528 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
int place[5005];
int correct[5005];
int done[5005];
int query[5005];
int n;
void exploreCave(int N)
{
    n = N;
    for (int door = 0; door < n; door++)
    {
        for (int i = 0; i < n; i++)
        {
            if (done[i])
                continue;
            else
                correct[i] = 1;
        }
        int k = tryCombination(correct);
        int my = (k > door or k == -1);
        int them = 1 - my;
        int l = -1, r = n + 1;
        while (r - l > 1)
        {
            int mid = (r + l) / 2;
            for (int i = 0; i < n; i++)
            {
                if (done[i])
                    continue;
                if (i < mid)
                    correct[i] = my;
                else
                    correct[i] = them;
            }
            k = tryCombination(correct);
            (k > door or k == -1) ? (r = mid) : (l = mid);
        }
        correct[r] = my;
        place[door] = r;
        done[r] = 1;
    }
    answer(correct, place);
}

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