#include "combo.h"
#include <bits/stdc++.h>
#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
#define ll long long
//#define int 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 = 3e5 + 123;
const int inf = 2e9;
const int MOD1 = 1e9 + 7;
const int MOD = 998244353;
const int P = 6547;
int b[N1], nw[N1], n, m, k, L, R, x, y, z, w, a[16][16], svb;
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 );
}
string guess_sequence( int N )
{
string s = "";
FOR( i, 1, N, 1 )
{
int lena = press( s + "A" ), lenb = press( s + "B" ), lenx = press( s + "X" ), leny = press( s + "Y" );
if( lena == i ) s += 'A';
else if( lenb == i ) s += 'B';
else if( lenx == i ) s += 'X';
else if( leny == i ) s += 'Y';
}
return s;
}
//void solve()
//{
//
//}
//signed main()
//{
//// freopen("newbarn.in", "r", stdin);
//// freopen("newbarn.out", "w", stdout);
//
// respagold
//
// int test = 1;
//
// if( !test ) cin >> test;
//
// while( test -- )
// {
// solve();
// }
//}
//// solved by KluydQ
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |