Submission #1240569

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240569		Jer	동굴 (IOI13_cave)	C++20	12 / 100	30 ms	532 KiB

cave

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

using namespace std;

void exploreCave(int n)
{
    int s[n], d[n], used[n];
    for (int i = 0; i < n; i++)
        s[i] = 0, d[i] = -1, used[i] = false;

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (used[j])
                continue;

            s[j] = 0;
            int one = tryCombination(s);
            s[j] = 1;
            int two = tryCombination(s);

            if (one == i and two != i)
            {
                s[j] = 1, d[i] = j, used[j] = true;
                break;
            }

            if (one != i and two == i)
            {
                s[j] = 0, d[i] = j, used[j] = true;
                break;
            }
        }
    }

    answer(s, d);
}

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