제출 #396631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396631		ak2006	동굴 (IOI13_cave)	C++14	13 / 100	18 ms	420 KiB

cave

#include <bits/stdc++.h>
#include <cave.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void exploreCave(int n)
{
    int is[n],val[n];
    for (int i = 0;i<n;i++)is[i] = 0,val[i] = -1;
    for (int i = 0;i<n;i++){
        int pos = tryCombination(is);
        if (pos == -1)break;
        for (int j = 0;j<n;j++){
            is[j] = !is[j];
            int pos2 = tryCombination(is);
            if (pos2 == -1)break;
            if (pos2 > pos)
                val[j] = pos;
            is[j] = !is[j];
        }
    }
    for (int i = 0;i<n;i++){
        if (val[i] != -1)continue;
        is[i] = !is[i];
        val[i] = tryCombination(is);
        is[i] = !is[i];
    }
    answer(is,val);
}

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