# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315119 | 2020-10-22T02:50:13 Z | yjojdkgk5bp | CONSUL (info1cup19_consul) | C++14 | 10 ms | 256 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; void solve(int n) { srand(time(0)); int v; map<int,int> can; int vis[1001]={0}; for(int i=1; i<=n; i++) { while(1) { int k=rand()%n+1; if(vis[k]) continue; if(cnt(kth(k))>n/3) say_answer(k); vis[k]=1; } } say_answer(-1); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Wrong answer |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 256 KB | Too many queries |
2 | Halted | 0 ms | 0 KB | - |