제출 #347235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
347235		blue	동굴 (IOI13_cave)	C++11	100 / 100	1022 ms	620 KiB

cave

#ifndef __CAVE_H__
#define __CAVE_H__

#ifdef __cplusplus
extern "C" {
#endif

int tryCombination(int S[]);
void answer(int S[], int D[]);
void exploreCave(int N);

#ifdef __cplusplus
}
#endif

#endif /* __CAVE_H__ */

#include <iostream>
#include <vector>
using namespace std;

int* S;
int* D;
int* Q;
int n;
//switch_state, switch_door, query

void b_search(int door, int pos, int a, int b)
{
    if(a == b)
    {
        D[a] = door;
        S[a] = pos;
    }
    else
    {
        int m = (a+b)/2;
        for(int i = 0; i < n; i++)
        {
            if(S[i] != -1) Q[i] = S[i];
            else
            {
                if(a <= i && i <= m) Q[i] = pos;
                else Q[i] = !pos;
            }
        }
        int q = tryCombination(Q);
        if(q == door) b_search(door, pos, m+1, b);
        else b_search(door, pos, a, m);
    }
}

void exploreCave(int N)
{
    n = N;
    int s[N], d[N], q[N];
    S = s;
    D = d;
    Q = q;
    for(int i = 0; i < N; i++) S[i] = D[i] = -1;

    for(int door = 0; door < N; door++)
    {
        for(int i = 0; i < N; i++)
        {
            if(S[i] == -1) Q[i] = 0;
            else Q[i] = S[i];
        }
        int q = tryCombination(Q);
        if(q == door)
        {
            //switch_pos of switch connected to door 1 = 1
            b_search(door, 1, 0, N-1);
        }
        else
        {
            b_search(door, 0, 0, N-1);
        }
    }
    answer(s, d);
}

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