oj.uz

Submission #315121

# Submission time Handle Problem Language Result Execution time Memory
315121 2020-10-22T02:52:52 Z yjojdkgk5bp CONSUL (info1cup19_consul) C++14
0 / 100
 70 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[2001]={0};
	for(int i=1; i<=n; i++)
	{
		while(1)
		{
			int k=(rand()%n)+1;
			if(vis[k]) continue;
			v=kth(k);
			if(cnt(v)>n/3)
			{
				say_answer(v); return;
			}
			vis[k]=1; break;
		}
	}
	say_answer(-1);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 256 KB Output isn't correct

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 70 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 256 KB Too many queries
2 Halted 0 ms 0 KB -