oj.uz

Submission #397866

# Submission time Handle Problem Language Result Execution time Memory
397866 2021-05-03T10:28:52 Z MarcoMeijer CONSUL (info1cup19_consul) C++14
100 / 100
 37 ms 288 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;
const int N = (1<<20);

void solve(int N) {
    vi order;
    RE1(i,N) order.pb(i);
    random_shuffle(all(order),[](int i){return rng()%i;});

    RE(i,min(N,25)) {
        int x = kth(order[i]);
        int c = cnt(x);
        if(c*3 > N) {
            say_answer(x);
            return;
        }
    }
    say_answer(-1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 288 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 200 KB Output is correct
2 Correct 5 ms 288 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 200 KB Output is correct
2 Correct 27 ms 200 KB Output is correct
3 Correct 11 ms 200 KB Output is correct
4 Correct 14 ms 200 KB Output is correct
5 Correct 31 ms 200 KB Output is correct
6 Correct 28 ms 204 KB Output is correct
7 Correct 31 ms 200 KB Output is correct
8 Correct 28 ms 200 KB Output is correct
9 Correct 34 ms 200 KB Output is correct
10 Correct 37 ms 200 KB Output is correct
11 Correct 30 ms 200 KB Output is correct
12 Correct 18 ms 200 KB Output is correct
13 Correct 36 ms 200 KB Output is correct
14 Correct 28 ms 200 KB Output is correct