Submission #1234664

#TimeUsernameProblemLanguageResultExecution timeMemory
1234664SolikhaCONSUL (info1cup19_consul)C++20
31.40 / 100
31 ms408 KiB
#include "grader.h" #include "bits/stdc++.h" using namespace std; void solve(int n) { map<int, int> mp; int sm = 0; for(int i = 1; i <= n; i++){ int x = kth(i); mp[x]++; if(mp[x] == 1){ int k = cnt(x); //cerr << x << ' ' << k << endl; sm += k; if(k > n / 3){ say_answer(x); return; } } if(sm >= (n - 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...