Submission #523469

#	Time	Username	Problem	Language	Result	Execution time	Memory
523469		Farhan_HY	CONSUL (info1cup19_consul)	C++14	100 / 100	30 ms	292 KiB

consul

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

using namespace std;

map<int, bool> mp;
bool vis[1001];

void solve(int n)
{
    mp.clear();
    for(int i = 1; i <= n; i++)
        vis[i] = 0;
    srand(0);
    int q = 59;
    bool ok = false;
    while(q-- > 0)
    {
        int i = rand() % n + 1;
        if (vis[i])
            continue;
        vis[i] = 1;
        int x = kth(i);
        if(mp[x])
            continue;
        q--;
        mp[x] = 1;
        int Count = cnt(x);
        if (Count > n / 3)
        {
            ok = true;
            say_answer(x);
            break;
        }
    }
    if (!ok)
        say_answer(-1);
    /// insert your code
}

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