# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530142 | LucaDantas | CONSUL (info1cup19_consul) | C++17 | 37 ms | 200 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 1e5+10, SZ = 90, tot = 100;
mt19937 rng(random_device{}());
int rnd(int x) { return (rng() % x + x) % x; }
int a[maxn], mark[maxn];
void solve(int n)
{
vector<int> usar;
map<int,int> freq;
while(usar.size() < min(n, SZ)) {
int rd = rnd(n)+1;
if(!mark[rd])
usar.push_back(rd), a[rd] = kth(rd), freq[a[rd]]++;
mark[rd] = 1;
}
for(int x : usar)
mark[x] = 0;
vector<pair<int,int>> maiores;
for(auto it : freq)
maiores.push_back({it.second, it.first});
sort(maiores.begin(), maiores.end(), greater<pair<int,int>>());
while(maiores.size() > tot - SZ)
maiores.pop_back();
if(n <= SZ) {
if(maiores[0].first > n/3) say_answer(maiores[0].second);
else say_answer(-1);
return;
}
for(int i = 0; i < maiores.size(); i++)
if(cnt(maiores[i].second) > n/3) return (void)(say_answer(maiores[i].first));
say_answer(-1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |