Submission #667100

#	Time	Username	Problem	Language	Result	Execution time	Memory
667100		divad	CONSUL (info1cup19_consul)	C++14	52.65 / 100	29 ms	328 KiB

consul

#include "grader.h"
#include <iostream>
#include <map>
using namespace std;
map<int, int> m;

void solve(int n){
    m.clear();
    int salt = max(1, n/60);
    int nrq = 0;
    for(int i = 1; i <= n && nrq <= 60; i += salt){
        int val = kth(i); nrq++;
        if(m.count(val)){
        }else{
            m[val] = cnt(val); nrq++;
            if(m[val] > n/3){
                say_answer(val);
                return ;
            }
        }
    }
    say_answer(-1);
}

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