제출 #434939

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434939		alextodoran	동굴 (IOI13_cave)	C++17	100 / 100	1374 ms	480 KiB

cave

/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

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

using namespace std;

typedef long long ll;

int tryCombination (int state[]);

void answer (int correct[], int door[]);

void exploreCave (int n)
{
    int correct[n];
    int door[n];
    int lever[n];
    for(int i = 0; i < n; i++)
    {
        door[i] = -1;
        lever[i] = -1;
        correct[i] = -1;
    }

    for(int target = 0; target < n; target++)
    {
        int result;
        {
            int query[n];
            for(int i = 0; i < n; i++)
            {
                if(door[i] != -1)
                    query[i] = correct[i];
                else
                    query[i] = 0;
            }

            int response = tryCombination(query);
            if(response == target)
                result = 1;
            else
                result = 0;
        }

        int l = 0, r = n - 1;
        while(l < r)
        {
            int mid = (l + r) / 2;

            int query[n];
            for(int i = 0; i < n; i++)
            {
                if(door[i] != -1)
                    query[i] = correct[i];
                else if(l <= i && i <= mid)
                    query[i] = result;
                else
                    query[i] = !result;
            }

            int response = tryCombination(query);
            if(response == target)
                l = mid + 1;
            else
                r = mid;
        }
        assert(l == r);

        lever[target] = l;
        door[lever[target]] = target;
        correct[lever[target]] = result;
    }

    answer(correct, door);
}

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