제출 #1235014

#제출 시각아이디문제언어결과실행 시간메모리
1235014SolikhaCONSUL (info1cup19_consul)C++20
0 / 100
0 ms412 KiB
#include "grader.h" #include "bits/stdc++.h" using namespace std; mt19937 rng(123); void solve(int n) { map<int, int> mp, us; int sm = 0; int c = 0; int nw = 0; while(c < n){ int i = rng() % (n + 1); c++; while(us[i] == 1 || i == 0) i = rng() % (n + 1); us[i] = 1; int x = kth(i); mp[x]++; if(mp[x] == 1){ int k = cnt(x); sm += k; nw += k; if(k > n / 3){ say_answer(x); return; } } nw--; if(sm >= n / 3 || c >= n / 3 || (n - c - nw) <= 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...