oj.uz

Submission #390246

# Submission time Handle Problem Language Result Execution time Memory
390246 2021-04-15T15:57:10 Z mariowong CONSUL (info1cup19_consul) C++14
0 / 100
 1000 ms 464 KB 
#include "grader.h"
#include <bits/stdc++.h>

using namespace std;

int val,pos,ct,x,a[15];
map <int,int> m,now;
void solve(int n){
    mt19937 gen(time(NULL));
    uniform_int_distribution <int> dis(1,1e9);
    now[0]=true;
    for (int i=1;i<=25;i++){
 		while (now[pos])
    	pos=dis(gen)%n+1; 
    	
		now[pos]=true;
		val=kth(pos);
    	if (m[val])
    	ct++;
    	else
    	{
    		m[val]=true;
    		if (cnt(val) > n/3){
    			say_answer(val);
    			return;
			}
    		ct+=2;
		}
    	
	}
	say_answer(-1);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3091 ms 200 KB Time limit exceeded

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3081 ms 200 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 320 KB Output is correct
2 Execution timed out 3009 ms 464 KB Time limit exceeded
3 Halted 0 ms 0 KB -