# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
993694 | 2024-06-06T10:12:00 Z | ramalzaher | CONSUL (info1cup19_consul) | C++14 | 30 ms | 344 KB |
#include "grader.h" #include<bits/stdc++.h> using namespace std ; mt19937_64 randd(chrono::steady_clock::now().time_since_epoch().count()); void solve(int n) { if(n<=50) { bool ok= 0 ; map<int,int> mp ; for(int i = 1; i <= n; i ++ ) { mp[ kth(i)] ++ ; } for(auto &[x , y ] : mp ) { if(y > n/3&&!ok) { say_answer(x) ; ok=1;} } if(ok == 0) say_answer(-1); }else { bool ok=1; for(int i = 1 ;i < 31; i ++ ) { int ans = kth(randd()%(n)+1) ; int temp = cnt(ans); if(temp > n/3 && ok ) { say_answer(ans) ; ok=0;break ; } } if(ok) say_answer(-1) ; }}
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 344 KB | Output is correct |
2 | Correct | 4 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 344 KB | Output is correct |
2 | Correct | 10 ms | 344 KB | Output is correct |
3 | Correct | 3 ms | 344 KB | Output is correct |
4 | Correct | 3 ms | 344 KB | Output is correct |
5 | Correct | 8 ms | 344 KB | Output is correct |
6 | Correct | 12 ms | 344 KB | Output is correct |
7 | Correct | 9 ms | 344 KB | Output is correct |
8 | Correct | 9 ms | 344 KB | Output is correct |
9 | Correct | 13 ms | 344 KB | Output is correct |
10 | Correct | 13 ms | 344 KB | Output is correct |
11 | Correct | 13 ms | 344 KB | Output is correct |
12 | Correct | 15 ms | 344 KB | Output is correct |
13 | Correct | 16 ms | 344 KB | Output is correct |
14 | Correct | 13 ms | 344 KB | Output is correct |