# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
369479 |
2021-02-21T18:19:25 Z |
sad |
CONSUL (info1cup19_consul) |
C++14 |
|
23 ms |
640 KB |
#include "grader.h"
#include "bits/stdc++.h"
#define fi first
#define se second
#define pb push_back
#define ll long long
using namespace std;
map<int,int>m;
void solve(int n)
{
for(int i=1;i<=min(25,n);i++)
{
int w=rand();
w%=n;w++;
int x=kth(i);
if(m[x])continue;
int y=cnt(x);
if(y>n/3)
{
say_answer(x);return;
}
m[x]=1;
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
640 KB |
Wrong answer |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
492 KB |
Output is correct |
2 |
Incorrect |
1 ms |
364 KB |
Wrong answer |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
376 KB |
Output is correct |
2 |
Correct |
23 ms |
364 KB |
Output is correct |
3 |
Incorrect |
1 ms |
364 KB |
Wrong answer |
4 |
Halted |
0 ms |
0 KB |
- |