#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
#include "icc.h"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
struct custom_hash
{
template<class T>
unsigned long long operator()(T v) const
{
unsigned long long x = v;
x += FIXED_RANDOM;
// x += 11400714819323198485ull;
// x = (x ^ (x >> 30)) * 13787848793156543929ull;
x = (x ^ (x >> 27)) * 10723151780598845931ull;
return x ^ (x >> 31);
}
};
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;
template<class T>
T randomize(T mod)
{
return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
x = 0;
bool negative = false;
char c = ' ';
while (c < '-')
{
c = getchar();
}
if (c == '-')
{
negative = true;
c = getchar();
}
while (c >= '0')
{
x = x * 10 + (c - '0');
c = getchar();
}
if (negative)
{
x = -x;
}
}
template<class T>
void printi(T output)
{
if (output == 0)
{
putchar('0');
return;
}
if (output < 0)
{
putchar('-');
output = -output;
}
int buf[20], n = 0;
while(output)
{
buf[n] = ((output % 10));
output /= 10;
n++;
}
for (n--; n >= 0; n--)
{
putchar(buf[n] + '0');
}
return;
}
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);
}
long long expo(long long a, long long e, long long mod)
{
return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
return (b ? gcd(b, a % b) : a);
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;
#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 113
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;
int dsu[MAXN];
vi blocks[MAXN];
int get(int u)
{
return (u == dsu[u] ? u : dsu[u] = get(dsu[u]));
}
bool ask(vi a, vi b)
{
int A[SZ(a)], B[SZ(b)];
FOR(i, 0, SZ(a))
{
A[i] = a[i] + 1;
}
FOR(i, 0, SZ(b))
{
B[i] = b[i] + 1;
}
// cerr << "ask\n";
// for (int x : a)
// {
// cerr << x << ' ';
// }
// cerr << endl;
// for (int x : b)
// {
// cerr << x << ' ';
// }
// cerr << endl;
bool ret = query(SZ(a), SZ(b), A, B);
// cerr << ret << endl;
return ret;
}
void go(int a, int b)
{
// cerr << "win " << a << ' ' << b << endl;
setRoad(a + 1, b + 1);
}
void merge(int a, int b)
{
a = get(a);
b = get(b);
dsu[a] = b;
}
int N;
void run(int n)
{
N = n;
FOR(i, 0, N)
{
dsu[i] = i;
}
FOR(i, 0, N - 1)
{
pii res;
//find all the blocks!
FOR(i, 0, N)
{
blocks[i].clear();
}
FOR(i, 0, N)
{
blocks[get(i)].PB(i);
}
//find which two blocks are paired!
vi nums, lt, rt, L, R;
FOR(i, 0, N)
{
if (get(i) == i)
{
// cerr << "push " << i << endl;
nums.PB(i);
}
}
while(true)
{
FOR(i, 0, SZ(nums))
{
if (i & 1) rt.PB(nums[i]);
else lt.PB(nums[i]);
}
for(int x : lt)
{
for (int u : blocks[x])
{
L.PB(u);
}
}
for (int x : rt)
{
for (int u : blocks[x])
{
R.PB(u);
}
}
if (ask(L, R)) break;
nums.clear();
nums.insert(nums.end(), ALL(lt));
nums.insert(nums.end(), ALL(rt));
lt.clear(); rt.clear(); L.clear(); R.clear();
}
//ok we know lt and rt are good!
int lo = 0, hi = SZ(L);
while(hi > lo)
{
int mid = (lo + hi) >> 1;
lt.clear();
lt.insert(lt.end(), L.begin(), L.begin() + mid + 1);
if (ask(lt, R)) hi = mid;
else lo = mid + 1;
}
res.fi = L[lo];
lo = 0; hi = SZ(R);
while(hi > lo)
{
int mid = (lo + hi) >> 1;
rt.clear();
rt.insert(rt.end(), R.begin(), R.begin() + mid + 1);
if (ask(L, rt)) hi = mid;
else lo = mid + 1;
}
res.se = R[lo];
// cerr << res.fi << ' ' << res.se << endl;
go(res.fi, res.se);
merge(res.fi, res.se);
}
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
512 KB |
Ok! 104 queries used. |
| 2 |
Correct |
11 ms |
512 KB |
Ok! 109 queries used. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
512 KB |
Ok! 528 queries used. |
| 2 |
Correct |
57 ms |
512 KB |
Ok! 686 queries used. |
| 3 |
Correct |
49 ms |
512 KB |
Ok! 679 queries used. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
122 ms |
632 KB |
Ok! 1441 queries used. |
| 2 |
Correct |
162 ms |
636 KB |
Ok! 1678 queries used. |
| 3 |
Correct |
141 ms |
512 KB |
Ok! 1625 queries used. |
| 4 |
Correct |
184 ms |
512 KB |
Ok! 1521 queries used. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
133 ms |
636 KB |
Ok! 1525 queries used. |
| 2 |
Correct |
132 ms |
564 KB |
Ok! 1517 queries used. |
| 3 |
Correct |
157 ms |
604 KB |
Ok! 1648 queries used. |
| 4 |
Correct |
132 ms |
512 KB |
Ok! 1521 queries used. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
142 ms |
512 KB |
Ok! 1632 queries used. |
| 2 |
Correct |
152 ms |
512 KB |
Ok! 1633 queries used. |
| 3 |
Correct |
144 ms |
564 KB |
Ok! 1645 queries used. |
| 4 |
Correct |
149 ms |
576 KB |
Ok! 1641 queries used. |
| 5 |
Correct |
140 ms |
632 KB |
Ok! 1449 queries used. |
| 6 |
Correct |
137 ms |
512 KB |
Ok! 1548 queries used. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
145 ms |
636 KB |
Too many queries! 1668 out of 1625 |
| 2 |
Halted |
0 ms |
0 KB |
- |
