제출 #623859

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
623859		qwerasdfzxcl	Cave (IOI13_cave)	C++14	100 / 100	830 ms	592 KiB

cave

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

using namespace std;
typedef long long ll;

int a[5050], rans[5050];
bool used[5050];

void exploreCave(int n) {
    vector<int> C;
    for (int i=0;i<n;i++) C.push_back(i);

    for (int i=0;i<n;i++){
        int ret = tryCombination(a), ans1 = 0, ans2 = 0;
        if (ret > i || ret==-1) ans1 = 0;
        else ans1 = 1;

        for (int j=0;j<13;j++){
            for (int k:C) if (k&(1<<j)){
                a[k] = 1;
            }

            ret = tryCombination(a);
            if (ret==i) ans2 |= (1<<j);

            for (int k:C) if (k&(1<<j)){
                a[k] = 0;
            }
        }

        if (ans1) ans2 ^= (1<<13)-1;
        a[ans2] = ans1;
        used[ans2] = 1;
        rans[ans2] = i;
        C.erase(find(C.begin(), C.end(), ans2));
    }

    answer(a, rans);
}

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