| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1151538 | KluydQ | Mouse (info1cup19_mouse) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "grader.h"
#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
using namespace std;
const int N1 = 2e5 + 123;
int a[N1], b[N1], n, m, k, z, w, ans, x, y;
mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
int rand( int l, int r )
{
uniform_int_distribution <int> uid( l, r );
return uid( rng );
}
void solve( int N )
{
n = N;
vector <int> q;
FOR( i, 0, n - 1, 1 ) q.pb(i), a[i] = i + 1;
random_shuffle(q);
a[n - 1] = 0;
FOR( i, 0, n - 1, 1 )
{
x = query(q);
int sv = q[i];
if( x == n ) return;
while( 1 )
{
q[i] = a[q[i]];
y = query(q);
if( y == n ) return;
if( x != y ) break;
}
if( x > y ) q[i] = sv;
}
}
//signed main()
//{
//// freopen("connect.in", "r", stdin);
//// freopen("connect.out", "w", stdout);
//
// respagold
//
// int test = 0;
//
// if( !test ) cin >> test;
//
// while( test -- )
// {
// solve();
// }
//}
//// solved by KluydQ