# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091065 | AndreasK | Cave (IOI13_cave) | C++14 | 8 ms | 548 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>
#include "cave.h";
using namespace std;
#define designed ios_base::sync_with_stdio(0);
#define by cin.tie(0);
#define AndreasK cout.tie(0);
//#define int long long
#define ii pair <int, int>
#define vi vector <int>
#define iii pair <int, ii>
#define vii vector <ii>
#define vc vector <char>
#define vb vector <bool>
void exploreCave(int n) {
int a[n] = {};
int b[n];
for (int c = 0; c < n; c++)
b[c] = c;
int x = tryCombination(a);
/*int x;
cin >> x;*/
while (x != -1) {
a[x] = 1;
x = tryCombination(a);
//cin >> x;
}
/*for (auto aek : a)
cout << aek << ' ';*/
answer(a, b);
}
/*int32_t main() {
designed by AndreasK
int n;
cin >> n;
exploreCave(n);
return 0;
}*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |