oj.uz

답안 #923156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923156 2024-02-06T18:51:24 Z NValchanov CONSUL (info1cup19_consul) C++17
86.85 / 100
 11 ms 596 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 4 ms 344 KB Output is correct

Subtask #2
19.2 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 9 ms 352 KB Output is partially correct
2 Correct 3 ms 596 KB Output is correct

Subtask #3
52.65 / 65.0

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