제출 #536596

#제출 시각아이디문제언어결과실행 시간메모리
536596MajidCONSUL (info1cup19_consul)C++17
0 / 100
1 ms208 KiB
#include<bits/stdc++.h>
#include<grader.h>
using namespace std;
 
//Types
using ll = long long;
using db = double;
 
//Vectors
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
 
//things
#define f first
#define s second
const int SMALLINF = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);
// Speeed
void solve(int n){
	
    srand(time(0));
    
    if(n<=50)n = 25;
    else n = 30;
    
    for(ll i = 0; i < n; i++){
        
        ll rndm = (rand()%n) + 1;
        ll val = kth(rndm);
        
        if(cnt(val) > n/3){
            
            say_answer(val);
            return;
        }
    }
    
    say_answer(-1);
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...