| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 151804 | qkxwsm | 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 "grader.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
struct chash
{
int operator()(int x) const
{
x ^= (x >> 20) ^ (x >> 12);
return x ^ (x >> 7) ^ (x >> 4);
}
int operator()(long long x) const
{
return x ^ (x >> 32);
}
};
template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
return (((x % mod) + mod) % mod);
}
static long long randomizell(long long mod)
{
return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
static int randomize(int mod)
{
return ((1ll << 15) * rand() + rand()) % mod;
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 5013
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
static int idx[MAXN], ret[MAXN], pos[MAXN], res[MAXN];
static int tst[MAXN];
void exploreCave(int N)
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
tst[j] = 0;
}
for (int j = 0; j < i; j++)
{
tst[idx[j]] = ret[j];
}
int g = tryCombination(tst);
if (g == i)
{
ret[i] = 1;
}
else
{
ret[i] = 0;
}
//you know which index this is!
int lo = 0, hi = N - 1;
while(hi > lo)
{
int mid = (hi + lo) >> 1;
//set everything in 0...mid to be wrong and mid+1...N to be correct
for (int j = 0; j <= mid; j++)
{
tst[j] = 1 - ret[i];
}
for (int j = mid + 1; j < N; j++)
{
tst[j] = ret[i];
}
for (int j = 0; j < i; j++)
{
tst[idx[j]] = ret[j];
}
// for (int j = 0; j < N; j++)
// {
// cerr << tst[j] << ' ';
// }
int g = tryCombination(tst);
// cerr << "\nret = " << g << endl;
if (g == i)
{
hi = mid;
}
else
{
lo = mid + 1;
}
}
idx[i] = lo;
}
for (int i = 0; i < N; i++)
{
pos[idx[i]] = i;
res[idx[i]] = ret[i];
}
answer(res, pos);
}