# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993667 | 2024-06-06T09:47:15 Z | ramalzaher | CONSUL (info1cup19_consul) | C++14 | 578 ms | 692 KB |
#include "grader.h" #include<bits/stdc++.h> using namespace std ; void solve(int n) { bool ok= 0 ; map<int,int> mp ; for(int i = 1; i <= n; i ++ ) { mp[kth(i)] ++ ; } for(auto &[x , y ] : mp ) { if(y > n/3&&!ok) { say_answer(x) ; ok=1;} } if(ok == 0) say_answer(-1); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 43 ms | 344 KB | Output is partially correct |
2 | Partially correct | 44 ms | 344 KB | Output is partially correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 578 ms | 692 KB | Output is partially correct |
2 | Halted | 0 ms | 0 KB | - |