# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
502204 |
2022-01-05T13:27:23 Z |
bigo |
CONSUL (info1cup19_consul) |
C++14 |
|
19 ms |
292 KB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n) {
map<int, int>his;
set<int>vec;
for (int i = 0; i < n; i++) {
int k = kth(i+1);
his[k]++;
vec.insert(k);
}
for (auto u : vec) {
if (his[u] > n / 3)
say_answer(u);
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
200 KB |
Multiple answers provided for the same testcase! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
292 KB |
Multiple answers provided for the same testcase! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
19 ms |
200 KB |
Multiple answers provided for the same testcase! |
2 |
Halted |
0 ms |
0 KB |
- |