oj.uz

Submission #645657

# Submission time Handle Problem Language Result Execution time Memory
645657 2022-09-27T15:30:31 Z notme CONSUL (info1cup19_consul) C++14
0 / 100
 42 ms 208 KB 
#include<bits/stdc++.h>
#define endl '\n'
#include "grader.h"
using namespace std;

map < int , int > mapche;
void solve(int N)
{
    mapche.clear();
    bool ok = false;
    int total = 0;
    for (int i = 1; i <= N && total < N && !ok; ++ i)
    {
        int num = kth(i);
        if(!mapche[num])
        {
            int times = cnt(num);
            mapche[num] = 1;
            total += times;
        if(times > N/3)
        {
            say_answer(num);
            ok = 1;
        }
        }
    }
    if(!ok)say_answer(-1);
}

Subtask #1
0.0 / 15.0

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

Subtask #2
0.0 / 20.0

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

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 208 KB Too many queries
2 Halted 0 ms 0 KB -