oj.uz

Submission #635778

# Submission time Handle Problem Language Result Execution time Memory
635778 2022-08-26T22:22:30 Z Dec0Dedd CONSUL (info1cup19_consul) C++14
85 / 100
 63 ms 336 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rnd(int a, int b){ 
	return a+rng()%(b-a+1);
}

void solve(int n) {
   pair<int, int> x={0, -1};
   for (int i=0; i<30; ++i) {
      int r=rnd(1, n), val=kth(r);
      x=max(x, {cnt(val), val});
   }
   if (x.first > n/3) say_answer(x.second);
   else say_answer(-1); 
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 208 KB Output is correct
2 Correct 44 ms 208 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 208 KB Output is correct
2 Correct 47 ms 336 KB Output is correct
3 Correct 60 ms 208 KB Output is correct
4 Correct 48 ms 208 KB Output is correct
5 Correct 54 ms 208 KB Output is correct
6 Correct 47 ms 296 KB Output is correct
7 Correct 54 ms 208 KB Output is correct
8 Correct 35 ms 208 KB Output is correct
9 Correct 55 ms 208 KB Output is correct
10 Correct 63 ms 208 KB Output is correct
11 Correct 41 ms 208 KB Output is correct
12 Correct 48 ms 296 KB Output is correct
13 Correct 42 ms 208 KB Output is correct
14 Correct 54 ms 208 KB Output is correct