oj.uz

Submission #315012

# Submission time Handle Problem Language Result Execution time Memory
315012 2020-10-22T00:33:25 Z 2qbingxuan CONSUL (info1cup19_consul) C++14
0 / 100
 0 ms 256 KB 
#include "grader.h"
#include <bits/stdc++.h>
#ifdef local
#define debug(args...) qqbx(#args, args)
template <typename ...T> void qqbx(const char *s, T ...args) {
    int cnt = sizeof...(T);
    (std::cerr << "(" << s << ") = (" , ... ,
         (std::cerr << args << (--cnt ? ", " : ")\n")));
}
#else
#define debug(...) ((void)0)
#endif // local
#define pb emplace_back
#define all(v) begin(v), end(v)
using namespace std;

void solve(int n)
{
    /// insert your code
    /// for example
    vector<int> p(n);
    mt19937 rng(7122);
    shuffle(all(p), rng);
    for(int i = 0; i < 30 && i < n; i++) {
        int x = kth(p[i]);
        if(cnt(x) > n / 3) {
            say_answer(x);
            return;
        }
    }
    say_answer(-1);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Wrong query format

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Wrong query format
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Wrong query format
2 Halted 0 ms 0 KB -