Submission #762881

# Submission time Handle Problem Language Result Execution time Memory
762881 2023-06-21T22:58:58 Z Trunkty CONSUL (info1cup19_consul) C++14
100 / 100
50 ms 208 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll

#include "grader.h"

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

void solve(int n){
    for(int i=1;i<=n;i++){
        vis[i] = false;
    }
    mp.clear();
    srand(314);
    if(n<=50){
        for(int i=1;i<=n;i++){
            mp[kth(i)]++;
        }
        for(pair<int,int> i:mp){
            if(i.second>n/3){
                say_answer(i.first);
                return;
            }
        }
        say_answer(-1);
        return;
    }
    for(int i=1;i<=50;i++){
        int curr = rand()%n+1;
        while(vis[curr]){
            curr = rand()%n+1;
        }
        vis[curr] = true;
        mp[kth(curr)]++;
    }
    vector<vector<int>> v;
    for(pair<int,int> i:mp){
        v.push_back({i.second,i.first});
    }
    sort(v.begin(),v.end(),greater<vector<int>>());
    int vs = v.size();
    for(int i=0;i<min(vs,10);i++){
        if(cnt(v[i][1])>n/3){
            say_answer(v[i][1]);
            return;
        }
    }
    say_answer(-1);
}
# Verdict Execution time Memory Grader output
1 Correct 25 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 48 ms 208 KB Output is correct
2 Correct 27 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 43 ms 208 KB Output is correct
2 Correct 50 ms 208 KB Output is correct
3 Correct 32 ms 208 KB Output is correct
4 Correct 43 ms 208 KB Output is correct
5 Correct 47 ms 208 KB Output is correct
6 Correct 35 ms 208 KB Output is correct
7 Correct 50 ms 208 KB Output is correct
8 Correct 22 ms 208 KB Output is correct
9 Correct 27 ms 208 KB Output is correct
10 Correct 46 ms 208 KB Output is correct
11 Correct 27 ms 208 KB Output is correct
12 Correct 43 ms 208 KB Output is correct
13 Correct 47 ms 208 KB Output is correct
14 Correct 43 ms 208 KB Output is correct