Submission #768712

#	Time	Username	Problem	Language	Result	Execution time	Memory
768712		Ludissey	동굴 (IOI13_cave)	C++14	12 / 100	10 ms	444 KiB

cave

#include "cave.h"
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream>

using namespace std;

int S[100000] = {0};
int D[100000] = { 0 };

void exploreCave(int N) {
    int crack = 0;
    for (int i = 0; i < N; i++)
    {
        S[i] = 0;
        D[i] = i;
    }
    while (crack < N) {
        S[crack] = 1 - S[crack];
        crack = tryCombination(S);
        if (crack == -1) break;
    }
    answer(S, D);
}

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