Submission #637598

#TimeUsernameProblemLanguageResultExecution timeMemory
637598tvladm2009CONSUL (info1cup19_consul)C++14
6.52 / 100
52 ms300 KiB
#include <bits/stdc++.h> #include <grader.h> using namespace std; void solve(int n) { srand(time(NULL)); map<int, int> mp; for (int i = 1; i <= 60; i++) { int x = rand() % n + 1; if (mp.find(x) != mp.end()) { continue; } mp[x] = true; x = kth(x); if (cnt(x) > n / 3) { say_answer(x); return; } } say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...