# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
813393 | OrazB | Cave (IOI13_cave) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
void exploreCave(int n){
int S[n], D[n];
for (int i = 0; i < n; i++){
D[i] = i;
S[i] = 0;
}
while(1){
int j = tryCombination(S);
if (j == -1){
answer(S, D);
return;
}
S[j] = !S[j];
}
}
// int main ()
// {
// ios::sync_with_stdio(false);
// cin.tie(0);
// cin >> t;
// while (t--){
// }
// }