oj.uz

Submission #690522

# Submission time Handle Problem Language Result Execution time Memory
690522 2023-01-30T09:11:48 Z alexdd CONSUL (info1cup19_consul) C++17
0 / 100
 0 ms 208 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;

unordered_map<int,int> fr1;
unordered_map<int,bool> bl1;
unordered_map<int,int> fr2;
unordered_map<int,bool> bl2;
int maxq;
int cntq;
int actual_kth(int k)
{
    if(bl1[k]==0)
    {
        fr1[k]=kth(k);
        bl1[k]=1;
        cntq++;
    }
    return fr1[k];
}
int actual_cnt(int x)
{
    if(bl2[x]==0)
    {
        fr2[x]=cnt(x);
        bl2[x]=1;
        cntq++;
    }
    return fr2[x];
}

void solve(int n)
{
    cntq=0;
    fr1.clear();
    bl1.clear();
    fr2.clear();
    bl2.clear();
    maxq=min(60,n);

    mt19937 rnd(82396293);

    while(cntq+2<=maxq)
    {
        int x=rnd();
        if(bl1[x]==0)
        {
            int care = actual_kth(x);
            if(actual_cnt(care) > n/3)
            {
                say_answer(care);
                return;
            }
        }
    }
    say_answer(-1);
    return;
}

Subtask #1
0.0 / 15.0

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

Subtask #2
0.0 / 20.0

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

Subtask #3
0.0 / 65.0

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