# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315037 | 2020-10-22T01:07:04 Z | thtsshz_bgwrswh | CONSUL (info1cup19_consul) | C++17 | 6 ms | 384 KB |
#pragma GCC optimize("Ofast") #include "grader.h" #include<algorithm> #include<random> #include<vector> #include<utility> #include<map> using namespace std; int order[1005]; map<int,int> m; vector<pair<int,int>> q; void solve(int n){ int i; for(i=1;i<=n;i++) order[i]=i; random_shuffle(order+1,order+n+1); for(i=1;i<=40;i++) m[kth(order[i])]++; for(auto x:m) q.emplace_back(x.second,x.first); sort(q.begin(),q.end()); reverse(q.begin(),q.end()); if(n<=50){ int ans=0,v; for(i=0;i<10&&i<(int)q.size();i++){ int temp=cnt(q[i].second); if(temp>ans){ ans=temp; v=q[i].second; } } if(ans>n/3) say_answer(v); else say_answer(-1); } else{ int ans=0,v; for(i=0;i<20&&i<(int)q.size();i++){ int temp=cnt(q[i].second); if(temp>ans){ ans=temp; v=q[i].second; } } if(ans>n/3) say_answer(v); else say_answer(-1); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 256 KB | Wrong answer |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 384 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 256 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |