제출 #623852

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

cave

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

using namespace std;
typedef long long ll;
int a[5050], ans1[5050], ans2[5050], used[5050], rans[5050];

void exploreCave(int n) {
    for (int i=1;i<=n;i++){
        int ret = tryCombination(a+1);
        if (ret > i || ret==-1) ans1[i] = 0;
        else ans1[i] = 1;
        for (int j=0;j<13;j++){
            for (int k=1;k<=n;k++) if (!used[k] && (k&(1<<j))){
                a[k] = 1;
            }

            ret = tryCombination(a+1);
            if (!(ret > i || ret==-1)) ans2[i] |= (1<<j);

            for (int k=1;k<=n;k++) if (!used[k] && (k&(1<<j))){
                a[k] = 0;
            }
        }

        if (ans1[i]) ans2[i] ^= (1<<13)-1;
        a[ans2[i]] = ans1[i];
        used[ans2[i]] = 1;
        rans[ans2[i]] = i-1;
    }

    answer(ans1+1, rans+1);
}

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