# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
933367 |
2024-02-25T15:03:40 Z |
SulA |
CONSUL (info1cup19_consul) |
C++17 |
|
20 ms |
692 KB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n) {
vector<int> a;
a.reserve(n);
for (int i = 1; i <= n; i++) a.push_back(i);
srand(time(NULL));
int queries = 30;
while (queries--) {
int i = (rand() % a.size()) + 1;
int x = kth(i);
if (cnt(x) > (n+2)/3) {cout << x; return;}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
688 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
5 ms |
692 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
20 ms |
688 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |