oj.uz

답안 #923166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923166 2024-02-06T19:07:47 Z NValchanov CONSUL (info1cup19_consul) C++17
100 / 100
 12 ms 500 KB 
#include<bits/stdc++.h>
#include "grader.h"

using namespace std;

typedef long long ll;

vector<bool>used;

void solve(int n)
{
    used.resize(n+1);
    for(int i=1;i<=n;i++)
    {
        used[i]=false;
    }
    int q=0;
    int border=0;
    while(q<=60 && 2*border<=n)
    {
        q++;
        if(q>60)
            return;
        int left=1, right=n;
        int idx=rand()%(right-left+1)+left;
        while(used[idx])
        {
            idx=rand()%(right-left+1)+left;
        }
        used[idx]=true;
        int val=kth(idx);
        int valcnt=cnt(val);
        if(3*valcnt > n)
        {
            say_answer(val);
            return;
        }
        q++;
        border++;
    }
    say_answer(-1);
}

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 500 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 9 ms 344 KB Output is correct
12 Correct 9 ms 340 KB Output is correct
13 Correct 12 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct