oj.uz

Submission #540650

# Submission time Handle Problem Language Result Execution time Memory
540650 2022-03-21T10:33:30 Z Carmel_Ab1 CONSUL (info1cup19_consul) C++17
0 / 100
 3 ms 208 KB 
#include "grader.h"
#include "bits/stdc++.h"

void solve(int n){
    std::vector<int>ord(n);
    for(int i=0; i<n; i++)
        ord[i]=i+1;

    std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
    std::shuffle(ord.begin(),ord.end(),rng);

    for(int i=0; i<std::min(n,30); i++){
        int c=cnt(kth(ord[i]));
        if(c>=(n+2)/3) {
            say_answer(ord[i]);
            return;
        }
    }
    say_answer(-1);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 1 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 3 ms 208 KB Wrong answer
2 Halted 0 ms 0 KB -