oj.uz

Submission #523464

# Submission time Handle Problem Language Result Execution time Memory
523464 2022-02-07T17:10:52 Z Farhan_HY CONSUL (info1cup19_consul) C++14
0 / 100
 27 ms 212 KB 
#include<bits/stdc++.h>
#include "grader.h"

using namespace std;

map<int, bool> mp;


void solve(int n)
{
    mp.clear();
    srand(0);
    int q = 60;
    int i = 0;
    while(q--)
    {
//        int i = rand() % n + 1;
        i++;
        if (i > n)
            break;
        int x = kth(i);
        if(mp[x])
            continue;
        mp[x] = 1;
        int Count = cnt(x);
        if (Count > n / 3)
        {
            say_answer(x);
            return;
        }
    }
    say_answer(-1);
    /// insert your code
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 27 ms 212 KB Output is partially correct
2 Incorrect 10 ms 200 KB Wrong answer
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Partially correct 24 ms 200 KB Output is partially correct
2 Partially correct 26 ms 200 KB Output is partially correct
3 Incorrect 1 ms 200 KB Wrong answer
4 Halted 0 ms 0 KB -