제출 #1091513

#제출 시각아이디문제언어결과실행 시간메모리
1091513AndreasK동굴 (IOI13_cave)C++14
13 / 100
9 ms528 KiB
#include <bits/stdc++.h>
#include <cave.h>
using namespace std;

#define designed ios_base::sync_with_stdio(0);
#define by cin.tie(0);
#define AndreasK cout.tie(0);
//#define int long long
#define ii pair <int, int>
#define vi vector <int>
#define iii pair <int, ii>
#define vii vector <ii>
#define vc vector <char>
#define vb vector <bool>

void exploreCave(int n) {
    int s[n] = {}, d[n];
    int x = tryCombination(s);
    int curr = 0;
    while (x != -1) {
        int xprev = x;
        s[curr] ^= 1;
        x = tryCombination(s);
        if (x == -1)
            break;
        else if (x <= xprev) {
            s[curr] ^= 1;
        }
        curr++;
        curr %= n;
    }
    for (int c = 0; c < n; c++) {
        s[c] ^= 1;
        x = tryCombination(s);
        s[c] ^= 1;
        d[c] = x;
    }
    answer(s, d);
}

/*
int32_t main() {
    designed by AndreasK

    return 0;
}*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...