# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167736 | Dedibeat | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define put(x) cout << (x) << '\n'
using namespace std;
using ll = long long;
void exploreCave(int N){
int S[N], D[N];
for(int i = 0; i < N; i++) S[i] = 0;
for(int i = 0; i < N; i++){
S[i] = 1;
D[i] = tryCombination(S);
S[i] = 0;
}
answer(S, D);
}