oj.uz

Submission #524435

# Submission time Handle Problem Language Result Execution time Memory
524435 2022-02-09T08:21:12 Z iskhakkutbilim CONSUL (info1cup19_consul) C++14
0 / 100
 11 ms 200 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

void solve(int n)
{
    map<int, int> mp;
    for(int i = 1;i <= n; i++){
        int x = kth(i);
        if(mp[x] == 1) continue;
        int c = cnt(x);
        mp[x] = 1;
        if(c > n / 3) say_answer(x);
    }
    say_answer(-1);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Multiple answers provided for the same testcase!
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 200 KB Multiple answers provided for the same testcase!
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

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