제출 #647793

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
647793		allin27x	Cave (IOI13_cave)	C++14	34 / 100	37 ms	428 KiB

cave

#include <iostream>
#include <cave.h>
using namespace std;

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

void solveSubtask1(int N){
    int ans[N] = {};
    int q[N] = {};

    q[0] = 1;
    ans[0] = tryCombination(q);

    for (int i=1; i<N; i++){
        q[i-1] = 0;
        q[i] = 1;
        ans[i] = tryCombination(q);
    }
    q[N-1] = 0;
    answer(q, ans);
}

void solveSubtask2(int N){
    int q[N] = {};
    int ans = tryCombination(q);
    while (ans!=-1){
        q[ans] = 1;
        ans = tryCombination(q);
    }

    int t[N];
    for (int i=0; i<N; i++){
        t[i] = i;
    }
    answer(q, t);
}

void solveSubtask3(int N){
    int q[N] = {};
    int ans[N] = {};
    int s = tryCombination(q);
    int t=-1;
    while (s!=-1){
        for (int i=0; i<N; i++){
            if (q[i] != 1){
                q[i] = 1;
                t = tryCombination(q);
                if (t==-1 or t>s){
                    ans[i] = s;
                    break;
                }
                q[i] = 0;
            }
        }
        s = tryCombination(q);
    }
    q[0] = !q[0];
    ans[0] = tryCombination(q);

    for (int i=1; i<N; i++){
        q[i-1] = !q[i-1];
        q[i] = !q[i];
        ans[i] = tryCombination(q);
    }
    q[N-1] = !q[N-1];

    answer(q ,ans);
}
void exploreCave(int N){
    /*int q[N] = {};
    if (tryCombination(q) == -1) solveSubtask1(N);
    else solveSubtask2(N);*/
    solveSubtask3(N);
}

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