# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
360861 | 2021-01-28T07:16:28 Z | ezdp | CONSUL (info1cup19_consul) | C++14 | 39 ms | 512 KB |
#include "grader.h" #include<bits/stdc++.h> #define ll long long using namespace std; void solve(int n) { set<ll> s; srand(42069); while(s.size() < min(29, n / 2)){ int i = rand() % n + 1; if(!s.count(i)){ s.insert(i); ll val = kth(i); if(cnt(val) > n / 3){ say_answer(val); return; } } } say_answer(cnt(kth(1)) > n / 3 ? kth(1) : -1); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 364 KB | Output is correct |
2 | Correct | 6 ms | 364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 15 ms | 364 KB | Output is correct |
2 | Correct | 20 ms | 364 KB | Output is correct |
3 | Correct | 7 ms | 364 KB | Output is correct |
4 | Correct | 6 ms | 364 KB | Output is correct |
5 | Correct | 32 ms | 364 KB | Output is correct |
6 | Correct | 25 ms | 364 KB | Output is correct |
7 | Correct | 29 ms | 364 KB | Output is correct |
8 | Correct | 25 ms | 364 KB | Output is correct |
9 | Correct | 32 ms | 364 KB | Output is correct |
10 | Correct | 23 ms | 364 KB | Output is correct |
11 | Correct | 15 ms | 512 KB | Output is correct |
12 | Correct | 34 ms | 364 KB | Output is correct |
13 | Correct | 39 ms | 364 KB | Output is correct |
14 | Correct | 24 ms | 364 KB | Output is correct |