oj.uz

Submission #365233

# Submission time Handle Problem Language Result Execution time Memory
365233 2021-02-11T09:38:33 Z tengiz05 CONSUL (info1cup19_consul) C++17
100 / 100
 36 ms 492 KB 
#include "grader.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
void solve(int n){
	vector<int> inds;
	for(int i=1;i<=n;i++)inds.push_back(i);
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	shuffle(inds.begin(), inds.end(), rng);
	int numq = min(n/3+1,20);
	for(int i=0;i<numq;i++){
		int x = kth(inds[i]);
		int c = cnt(x);
		if(c > n/3){
			say_answer(x);
			return;
		}
	}
	say_answer(-1);
	return;
}


/*

2
9
4 2 3 4 1 2 5 4

9
4 2 3 4 4 2 5 4



*/

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 364 KB Output is correct
2 Correct 9 ms 364 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 364 KB Output is correct
2 Correct 23 ms 364 KB Output is correct
3 Correct 11 ms 364 KB Output is correct
4 Correct 12 ms 364 KB Output is correct
5 Correct 19 ms 364 KB Output is correct
6 Correct 26 ms 364 KB Output is correct
7 Correct 26 ms 364 KB Output is correct
8 Correct 32 ms 364 KB Output is correct
9 Correct 20 ms 492 KB Output is correct
10 Correct 22 ms 364 KB Output is correct
11 Correct 36 ms 364 KB Output is correct
12 Correct 18 ms 492 KB Output is correct
13 Correct 23 ms 364 KB Output is correct
14 Correct 20 ms 364 KB Output is correct