# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715757 | aykhn | 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>
#include "grader.cpp"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define OPT ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pull pair<ull,ull>
#define endl "\n"
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define inf 0x3F3F3F3F
#define bpc __builtin_popcount
#define print(v) for(int i = 0; i < v.size(); i++) \
cout << v[i] << " "; \
cout<<endl;
void solve(int n, vector<int> b)
{
vector<int> ans(n, -1);
for (int i = 0; i < n; i++)
{
b[i] = 1;
int x = tryCombination(b);
ans[i] = x;
b[i] = 0;
}
for (int i = 0; i < n; i++) b[i] = 0;
answer(b, ans);
}
void exploreCave(int n)
{
vector<int> b;
for (int i = 0; i < n; i++) b.pb(0);
int ans = tryCombination(b);
if (ans == -1)
{
solve(n, b);
}
}