oj.uz

Submission #330405

# Submission time Handle Problem Language Result Execution time Memory
330405 2020-11-25T06:34:39 Z kshitij_sodani CONSUL (info1cup19_consul) C++14
85 / 100
 54 ms 440 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'


#include "grader.h"

void solve(int n){
	mt19937 rng;
	rng=mt19937(chrono::steady_clock::now().time_since_epoch().count());

    set<int> ss;
    for(int i=0;i<n;i++){
    	ss.insert(i+1);
    }
    for(int i=0;i<30;i++){
    	vector<int> tt;
    	for(auto j:ss){
    		tt.pb(j);

    	}
    	if(tt.size()==0){
    		break;
    	}
    	int xx=rng()%(tt.size());
    	int x=kth(tt[xx]);
    	if(cnt(x)>n/3){
    		 say_answer(x);
    		 return;
    	}
    	ss.erase(tt[xx]);
    }
    say_answer(-1);









}

Subtask #1
0.0 / 15.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 364 KB Output is correct
2 Correct 10 ms 364 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 364 KB Output is correct
2 Correct 45 ms 364 KB Output is correct
3 Correct 17 ms 364 KB Output is correct
4 Correct 15 ms 440 KB Output is correct
5 Correct 45 ms 364 KB Output is correct
6 Correct 52 ms 364 KB Output is correct
7 Correct 42 ms 364 KB Output is correct
8 Correct 50 ms 364 KB Output is correct
9 Correct 50 ms 364 KB Output is correct
10 Correct 48 ms 364 KB Output is correct
11 Correct 48 ms 364 KB Output is correct
12 Correct 39 ms 364 KB Output is correct
13 Correct 54 ms 364 KB Output is correct
14 Correct 42 ms 364 KB Output is correct