# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384613 | 2021-04-01T22:17:47 Z | fadi57 | CONSUL (info1cup19_consul) | C++14 | 9 ms | 364 KB |
//#include "grader.cpp" #include<bits/stdc++.h> #include "grader.h" using namespace std; void solve(int n) { map<int,int>mp; /// insert your code /// for example int z=n/3; int ok=0; int mid=n/2; for(int i=1;i<=mid;i++){ // int me=kth(i); // mp[me]++; int myfreq=cnt(i); if(myfreq>z){ ok=1; say_answer(kth(i)); break; } } if(ok==0){ for(int i=mid+1;i<=n;i++){ int me=kth(i); // mp[me]++; int myfreq=cnt(i); if(myfreq>z){ ok=1; say_answer(kth(i)); break; } } if(!ok){say_answer(-1);} } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 364 KB | Wrong answer |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 364 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 9 ms | 364 KB | Too many queries |
2 | Halted | 0 ms | 0 KB | - |