oj.uz

Submission #760776

# Submission time Handle Problem Language Result Execution time Memory
760776 2023-06-18T12:25:09 Z voliaanyk CONSUL (info1cup19_consul) C++14
35 / 100
 18 ms 296 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){
    
    int w = -1;
    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;
        }
        
    }
    say_answer(w);
    
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 208 KB Output is correct
2 Correct 13 ms 208 KB Output is correct
3 Correct 5 ms 296 KB Output is correct
4 Correct 6 ms 292 KB Output is correct
5 Correct 15 ms 288 KB Output is correct
6 Correct 18 ms 208 KB Output is correct
7 Correct 14 ms 208 KB Output is correct
8 Correct 17 ms 276 KB Output is correct
9 Correct 10 ms 292 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Incorrect 4 ms 208 KB Wrong answer
12 Halted 0 ms 0 KB -