oj.uz

Submission #362624

# Submission time Handle Problem Language Result Execution time Memory
362624 2021-02-03T18:05:58 Z Tenis0206 CONSUL (info1cup19_consul) C++14
0 / 100
 9 ms 364 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

/*static const int MIN_VALUE = 0, MAX_VALUE = (1e9) - 1;

static map<int,int> mp;
static int Q, N, a[5005];
static bool issol, answer;
void say_answer(int k)
{
    cout<<k<<'\n';
}

int cnt(int k)
{
    ++Q;
    if(!(k>=MIN_VALUE && k<=MAX_VALUE))
    {
        cout << "Wrong query format\n";
        exit(0);
    }
    return mp[k];
}

int kth(int k)
{
    ++Q;
    if(!(k>=1 && k<=N))
    {
        cout << "Wrong query format\n";
        exit(0);
    }
    return a[k];
}
*/

void solve(int n)
{
    map<int,bool> sel;
    int r = n;
    for(int i=1; i<=50; i++)
    {
        int x = rand()%r;
        int nrr = 0;
        for(int j=1;j<=n;j++)
        {
            if(!sel[j])
            {
                ++nrr;
            }
            if(nrr==x)
            {
                x=j;
                break;
            }
        }
        int val = kth(x);
        int nr = cnt(val);
        sel[x]=true;
        if(nr>n/3)
        {
            say_answer(val);
            return;
        }
        --r;
    }
    say_answer(-1);
}
/*int main()
{
    int tests, i;
    cin >> tests;

    while(tests--)
    {
        cin >> N; mp.clear();
        Q = 0; issol = 0; answer = 0;

        for(i=1; i<=N; ++i) cin >> a[i], ++mp[a[i]];
        for(i=1; i<=N; ++i) issol |= (mp[a[i]] > N/3);
        solve(N);
    }

    return 0;
}
*/

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Wrong query format

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Wrong query format
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 364 KB Wrong query format
2 Halted 0 ms 0 KB -