#include<bits/stdc++.h>
#include<grader.h>
using namespace std;
//Types
using ll = long long;
using db = double;
//Vectors
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
//things
#define f first
#define s second
const int SMALLINF = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);
// Speeed
void solve(int n){
for(ll i = 0; i <= 50; i++){
ll rndm = (rand()%n) + 1;
ll val = kth(rndm);
if(cnt(val) > n/3){
say_answer(val);
return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
14 ms |
208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
34 ms |
208 KB |
Output is partially correct |
2 |
Correct |
6 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
29 ms |
208 KB |
Output is partially correct |
2 |
Partially correct |
34 ms |
208 KB |
Output is partially correct |
3 |
Correct |
8 ms |
208 KB |
Output is correct |
4 |
Correct |
6 ms |
208 KB |
Output is correct |
5 |
Partially correct |
29 ms |
208 KB |
Output is partially correct |
6 |
Partially correct |
44 ms |
208 KB |
Output is partially correct |
7 |
Partially correct |
34 ms |
208 KB |
Output is partially correct |
8 |
Partially correct |
45 ms |
208 KB |
Output is partially correct |
9 |
Partially correct |
33 ms |
208 KB |
Output is partially correct |
10 |
Partially correct |
32 ms |
208 KB |
Output is partially correct |
11 |
Partially correct |
43 ms |
208 KB |
Output is partially correct |
12 |
Partially correct |
25 ms |
208 KB |
Output is partially correct |
13 |
Partially correct |
37 ms |
208 KB |
Output is partially correct |
14 |
Partially correct |
34 ms |
208 KB |
Output is partially correct |