oj.uz

Submission #635776

# Submission time Handle Problem Language Result Execution time Memory
635776 2022-08-26T22:18:18 Z Dec0Dedd CONSUL (info1cup19_consul) C++14
0 / 100
 1 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<20; ++i) {
      int r=rnd(1, n);
      x=max(x, {cnt(r), kth(r)});
   }

   if (x.first <= n/3) say_answer(-1);
   else say_answer(x.second); 
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 300 KB Wrong answer
2 Halted 0 ms 0 KB -