oj.uz

Submission #760775

# Submission time Handle Problem Language Result Execution time Memory
760775 2023-06-18T12:24:19 Z voliaanyk CONSUL (info1cup19_consul) C++14
0 / 100
 1 ms 208 KB 
#include "bits/stdc++.h"
#include "grader.h"
using namespace std;
 
#define DIM 100007
#define DIM2 2007
#define fi first
#define se second
#define mod 1000000007
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
 

void solve(int n){
    
    bool w = 0;
    set<int> s;
    
    for(int i=1;i<=20;i++){
        
        if(i>n) break;
        
        int x = rand()%n + 1;
        while(s.count(x)!=0){
            x = rand()%n + 1;
        }
        s.insert(x);
        
        x = kth(x);
        int c = cnt(x);
        
        if(c>n*1.0/3){
            w = x;
            break;
        }
        
    }
    if(w) say_answer(w);
    else say_answer(-1);
    
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong answer
2 Halted 0 ms 0 KB -