#include <bits/stdc++.h>
#include "grader.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e3 + 2;
const int inf = 1e9;
void solve(int n) {
int l = 60;
if (n <= 50) l = 50;
l /= 2;
mt19937 mt(time(nullptr));
while(l--) {
int i = (mt() % n) + 1;
int j = kth(i);
if (cnt(j) > n / 3) {
say_answer(j);
return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
288 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
208 KB |
Output is correct |
2 |
Correct |
8 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
288 KB |
Output is correct |
2 |
Correct |
27 ms |
208 KB |
Output is correct |
3 |
Correct |
8 ms |
208 KB |
Output is correct |
4 |
Correct |
5 ms |
208 KB |
Output is correct |
5 |
Correct |
17 ms |
208 KB |
Output is correct |
6 |
Correct |
20 ms |
208 KB |
Output is correct |
7 |
Correct |
31 ms |
292 KB |
Output is correct |
8 |
Correct |
20 ms |
208 KB |
Output is correct |
9 |
Correct |
25 ms |
208 KB |
Output is correct |
10 |
Correct |
24 ms |
208 KB |
Output is correct |
11 |
Correct |
23 ms |
208 KB |
Output is correct |
12 |
Correct |
17 ms |
296 KB |
Output is correct |
13 |
Correct |
27 ms |
208 KB |
Output is correct |
14 |
Correct |
18 ms |
208 KB |
Output is correct |