제출 #992834

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
992834		mohammedMonem	동굴 (IOI13_cave)	C++14	0 / 100	1 ms	360 KiB

cave

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

using namespace std;

void exploreCave(int N) {
    int comp[N];
    memset(comp, 0, N);
    bool try1 = tryCombination(comp);
    if (try1 > 0) {
        memset(comp, 1, N);
        try1 = tryCombination(comp);
    }
    int v[N];
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            comp[i] = !comp[i];
            bool try2 = tryCombination(comp);
            if (try1 != try2) {
                v[i] = j;
                try1 = try2;
                break;
            }
            comp[i] = !comp[i];
        }
    }
    answer(v, comp);
}

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