oj.uz

답안 #760778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760778 2023-06-18T12:29:28 Z voliaanyk CONSUL (info1cup19_consul) C++14
100 / 100
 26 ms 284 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;
    
    int p = 20;
    
    if(n>100) p = 29;
    
    for(int i=1;i<=p;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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 208 KB Output is correct
2 Correct 7 ms 208 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 208 KB Output is correct
2 Correct 22 ms 208 KB Output is correct
3 Correct 5 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 17 ms 208 KB Output is correct
6 Correct 12 ms 208 KB Output is correct
7 Correct 12 ms 208 KB Output is correct
8 Correct 25 ms 208 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 22 ms 256 KB Output is correct
11 Correct 22 ms 208 KB Output is correct
12 Correct 19 ms 208 KB Output is correct
13 Correct 26 ms 208 KB Output is correct
14 Correct 15 ms 284 KB Output is correct