제출 #1234641

#제출 시각아이디문제언어결과실행 시간메모리
1234641SolikhaCONSUL (info1cup19_consul)C++20
19 / 100
224 ms408 KiB
#include "grader.h" #include "bits/stdc++.h" using namespace std; void solve(int n) { map<int, int> mp; int mx = 0; for(int i = 1; i <= n; i++){ int x = kth(i); mp[x]++; mx = max(mx, mp[x]); if(mp[x] > n / 3){ say_answer(x); return; } if(mx + (n - i) <= n / 3){ say_answer(-1); return; } } say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...