Submission #645660

#TimeUsernameProblemLanguageResultExecution timeMemory
645660notmeCONSUL (info1cup19_consul)C++14
0 / 100
24 ms208 KiB
#include<bits/stdc++.h> #define endl '\n' #include "grader.h" using namespace std; map < int , int > mapche; int kth(int k); void say_answer(int k); int cnt(int k); void solve(int N) { mapche.clear(); bool ok = false; int total = 0; for (int i = 1; i <= N && total < N && !ok; ++ i) { int num = kth(i); if(!mapche[num]) { int times = cnt(num); mapche[num] = 1; total += times; if(times > N/3) { say_answer(num); ok = 1; } } } if(!ok)say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...