oj.uz

Submission #498949

# Submission time Handle Problem Language Result Execution time Memory
498949 2021-12-26T19:43:35 Z cadmiumsky CONSUL (info1cup19_consul) C++14
100 / 100
 38 ms 200 KB 
#include <random>
#include <unordered_map>
#include <chrono>
#include "grader.h"

using namespace std;

mt19937 rng(time(0));

void solve(int N) {
  if(N<=50) {
    unordered_map<int,int> freq;
    for(int i=1,x; i<=N; i++) {
      freq[x = kth(i)];
      freq[x]++;
    }
    for(auto x:freq) {
      if(x.second > N/3) {
        say_answer(x.first);
        return;
      }
      
    }
    say_answer(-1);
    return;
  }
  for(int i=0; i<30; i++) {
    int index=(rng()%N)+1;
    int val=kth(index);
    int freq=cnt(val);
    if(freq > N/3) {
      say_answer(val);
      return;
    }
  }
  say_answer(-1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 200 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 200 KB Output is correct
2 Correct 5 ms 200 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 200 KB Output is correct
2 Correct 20 ms 200 KB Output is correct
3 Correct 7 ms 200 KB Output is correct
4 Correct 7 ms 200 KB Output is correct
5 Correct 13 ms 200 KB Output is correct
6 Correct 22 ms 200 KB Output is correct
7 Correct 23 ms 200 KB Output is correct
8 Correct 25 ms 200 KB Output is correct
9 Correct 22 ms 200 KB Output is correct
10 Correct 12 ms 200 KB Output is correct
11 Correct 28 ms 200 KB Output is correct
12 Correct 23 ms 200 KB Output is correct
13 Correct 38 ms 200 KB Output is correct
14 Correct 19 ms 200 KB Output is correct