Submission #1211746

#	Time	Username	Problem	Language	Result	Execution time	Memory
1211746		M_SH_O	CONSUL (info1cup19_consul)	C++20	65 / 100	6 ms	412 KiB

consul

#include <bits/stdc++.h>
#include "grader.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
//#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 5000000000000000000
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

void solve(int n) {
    set<ll> s;

    for (int i = 0; i < 25; i ++) {
        if (s.size() == n) break;
        ll x = randll(0, n-1);
        if (s.find(x) != s.end()) {
            i --;
            continue;
        }
        s.insert(x);
        int a = kth(x);
        int k = cnt(a);
        if (k*3 > n) {
            say_answer(a);
            return;
        }
    }
    say_answer(-1);
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 20
• Subtask 3: 65 / 65