oj.uz

Submission #369381

# Submission time Handle Problem Language Result Execution time Memory
369381 2021-02-21T13:41:57 Z doowey CONSUL (info1cup19_consul) C++14
0 / 100
 2 ms 364 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair


void solve(int n)
{
    vector<int> xa(n);
    for(int i = 0 ;i < n; i ++ ){
        xa[i]=i+1;
    }
    random_shuffle(xa.begin(), xa.end());
    int cur;
    int Q = 0;
    for(int i = 0 ; i < n; i ++ ){
        if(Q <= 48){
            cur = kth(xa[i]);
            Q ++ ;
            if(cnt(cur) > n/3){
                say_answer(cur);
            }
        }

    }
    say_answer(-1);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Multiple answers provided for the same testcase!

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Multiple answers provided for the same testcase!
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Multiple answers provided for the same testcase!
2 Halted 0 ms 0 KB -