Submission #369381

#	Time	Username	Problem	Language	Result	Execution time	Memory
369381		doowey	CONSUL (info1cup19_consul)	C++14	0 / 100	2 ms	364 KiB

consul

#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair


void solve(int n)
{
    vector<int> xa(n);
    for(int i = 0 ;i < n; i ++ ){
        xa[i]=i+1;
    }
    random_shuffle(xa.begin(), xa.end());
    int cur;
    int Q = 0;
    for(int i = 0 ; i < n; i ++ ){
        if(Q <= 48){
            cur = kth(xa[i]);
            Q ++ ;
            if(cnt(cur) > n/3){
                say_answer(cur);
            }
        }

    }
    say_answer(-1);
}

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