# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315080 | 2020-10-22T02:14:06 Z | daniel920712 | CONSUL (info1cup19_consul) | C++14 | 158 ms | 256 KB |
#include "grader.h" #include "grader.h" #include <map> #include <time.h> #include <algorithm> using namespace std; map < int , int > all; int how[1005]; void solve(int n) { srand(time(NULL)); all.clear(); int i,t,big=0,xx=n,x,y; if(n<=50) { for(i=1;i<=n;i++) { t=kth(i); all[t]++; big=max(big,all[t]); if(all[t]>n/3) { say_answer(t); return; } if(big+(n-i)<=n/3) { say_answer(-1); return; } } say_answer(-1); } else { for(i=1;i<=n/3*2+2;i++) { t=kth(i); all[t]++; if(all[t]==2) { x=cnt(t); big=max(big,x); xx-=(x-2); } if(big>n/3) { say_answer(t); return; } } say_answer(-1); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 34 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 25 ms | 256 KB | Output is partially correct |
2 | Partially correct | 22 ms | 256 KB | Output is partially correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 158 ms | 256 KB | Output is partially correct |
2 | Halted | 0 ms | 0 KB | - |