| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1315339 | muhammad-ahmad | CONSUL (info1cup19_consul) | C++20 | 1 ms | 332 KiB |
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int N){
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int l = 1, r = N;
int ans = 0;
for (int q = 1; q <= 25; q++){
int x = uniform_int_distribution<int>(l,r)(rng);
int val = kth(x);
int C = cnt(val);
if (C > N / 3) ans = val;
}
say_answer(ans);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
