oj.uz

Submission #486306

# Submission time Handle Problem Language Result Execution time Memory
486306 2021-11-11T08:20:10 Z NintsiChkhaidze CONSUL (info1cup19_consul) C++14
15 / 100
 42 ms 328 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

int kth(int k);
void say_answer(int k);
int cnt(int k);

map <int,int> mp;

void solve(int n){
    if (n<=50){
        mp.clear();
        for (int i = 1; i <= n; i++){
            int val = kth(i);
            mp[val]++;
            if (mp[val] > n/3){
                say_answer(val);
                return;
            }
        }
        say_answer(-1);
        return;
    }
    
    set <int> st; st.clear();
    for (int i = 1; i <= n; i++){
        int val = kth(i);
        if (st.find(val)!=st.end())
            continue;
        
        st.insert(val);
        if (cnt(val) > n/3){
            say_answer(val);
            return;
        }
        
    }
    
    say_answer(-1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 328 KB Output is correct

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 42 ms 200 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 11 ms 296 KB Too many queries
2 Halted 0 ms 0 KB -