oj.uz

답안 #687606

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
687606 2023-01-26T16:02:26 Z Rares CONSUL (info1cup19_consul) C++14
85 / 100
 25 ms 336 KB 
#include <bits/stdc++.h>
//#include <grader.h>
using namespace std;

int kth(int i);
int cnt(int x);
void say_answer(int a);

void solve (int N){
    int op=0;
    srand (time (0));
    vector <int> a;
    while (1){
        int x=kth (rand ()%N+1);
        op++;
        if (op>=59){
            say_answer (-1);
            return;
        }
        bool ok=0;
        for (int i=0;i<int (a.size ());++i){
            if (a[i]==x){
                ok=1;
                break;
            }
        }
        if (ok==0){
            a.push_back (x);
            int f=cnt (x);
            op++;
            if (f>N/3){
                say_answer (x);
                return;
            }
            if (op>=59){
                say_answer (-1);
                return;
            }
        }
    }
    return;
}

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

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

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 336 KB Output is correct
2 Correct 21 ms 256 KB Output is correct
3 Correct 7 ms 292 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 18 ms 336 KB Output is correct
6 Correct 21 ms 288 KB Output is correct
7 Correct 9 ms 288 KB Output is correct
8 Correct 21 ms 208 KB Output is correct
9 Correct 20 ms 208 KB Output is correct
10 Correct 24 ms 208 KB Output is correct
11 Correct 21 ms 292 KB Output is correct
12 Correct 16 ms 208 KB Output is correct
13 Correct 25 ms 292 KB Output is correct
14 Correct 19 ms 208 KB Output is correct