Submission #401015

#TimeUsernameProblemLanguageResultExecution timeMemory
401015dolphingarlicCONSUL (info1cup19_consul)C++14
35.01 / 100
17 ms296 KiB
#include "grader.h" #include <bits/stdc++.h> typedef long long ll; using namespace std; void solve(int n) { set<int> found; int unknown = n; vector<int> rem(n); iota(rem.begin(), rem.end(), 1); random_shuffle(rem.begin(), rem.end()); while (unknown > n / 3) { int curr = rem.back(); rem.pop_back(); int v = kth(curr); if (found.count(v)) continue; found.insert(v); int c = cnt(v); if (c > n / 3) { say_answer(v); return; } unknown -= c; } say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...