# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1147008 | Ice_man | CONSUL (info1cup19_consul) | C++20 | 0 ms | 0 KiB |
/**
____ ____ ____ __________________ ____ ____ ____
||I || ||c || ||e || || || ||M || ||a || ||n ||
||__|| ||__|| ||__|| ||________________|| ||__|| ||__|| ||__||
|/__\| |/__\| |/__\| |/________________\| |/__\| |/__\| |/__\|
*/
#include <iostream>
#include <chrono>
#include <vector>
#include "grader.h"
#define maxn 305
#define maxlog 20
#define INF 1000000010
#define LINF 1000000000000000005
#define endl '\n'
#define pb(x) push_back(x)
#define X first
#define Y second
#define mod 998244353
#define control cout<<"passed"<<endl;
using namespace std;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;
typedef pair <ll, ll> pll;
typedef pair <int, ll> pil;
typedef pair <ll, int> pli;
typedef long double pd;
void solve(int n)
{
random_device rd;
mt19937 rng(rd());
uniform_int_distribution <int> d(1 , n);
for(int step = 1; step <= 30; step++)
{
int i = d(rng());
int candidate = kth(i);
int br = cnt(candidate);
if(br > n / 3)
{
bool c = say_answer(candidate);
if(c == true)
return;
}
}
}