oj.uz

답안 #498946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498946 2021-12-26T19:42:51 Z cadmiumsky CONSUL (info1cup19_consul) C++14
85 / 100
 27 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);
      }
    }
    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
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 200 KB Multiple answers provided for the same testcase!

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 200 KB Output is correct
2 Correct 6 ms 200 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 200 KB Output is correct
2 Correct 24 ms 200 KB Output is correct
3 Correct 6 ms 200 KB Output is correct
4 Correct 7 ms 200 KB Output is correct
5 Correct 22 ms 200 KB Output is correct
6 Correct 23 ms 200 KB Output is correct
7 Correct 26 ms 200 KB Output is correct
8 Correct 21 ms 200 KB Output is correct
9 Correct 25 ms 200 KB Output is correct
10 Correct 23 ms 200 KB Output is correct
11 Correct 27 ms 200 KB Output is correct
12 Correct 22 ms 200 KB Output is correct
13 Correct 26 ms 200 KB Output is correct
14 Correct 18 ms 200 KB Output is correct