# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364127 | 2021-02-08T09:26:40 Z | soba | CONSUL (info1cup19_consul) | C++14 | 37 ms | 512 KB |
#include <bits/stdc++.h> #include "grader.h" //#include "grader.cpp" using namespace std; void solve(int n) { int need=(n)/3; need++; vector<int>v; for(int i=1; i <= n ; i++) { v.push_back(i); } random_shuffle(v.begin(), v.end()); random_shuffle(v.begin(), v.end()); random_shuffle(v.begin(), v.end()); int cn=1 , ans=-1; map<int,int>mp; for(int i = 1 ; i<=min(30,need) ; i++) { int x=kth(v[i]); if(mp[x]) continue; else mp[x]=cnt(x); if(mp[x]>=need) { ans=x; break; } } say_answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 364 KB | Output is correct |
2 | Correct | 9 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 364 KB | Output is correct |
2 | Correct | 33 ms | 364 KB | Output is correct |
3 | Correct | 15 ms | 364 KB | Output is correct |
4 | Correct | 14 ms | 512 KB | Output is correct |
5 | Correct | 31 ms | 364 KB | Output is correct |
6 | Correct | 32 ms | 364 KB | Output is correct |
7 | Correct | 34 ms | 364 KB | Output is correct |
8 | Correct | 37 ms | 364 KB | Output is correct |
9 | Correct | 31 ms | 364 KB | Output is correct |
10 | Correct | 23 ms | 364 KB | Output is correct |
11 | Correct | 24 ms | 364 KB | Output is correct |
12 | Correct | 23 ms | 364 KB | Output is correct |
13 | Correct | 28 ms | 364 KB | Output is correct |
14 | Correct | 25 ms | 364 KB | Output is correct |