oj.uz

Submission #667107

# Submission time Handle Problem Language Result Execution time Memory
667107 2022-11-30T11:46:31 Z divad CONSUL (info1cup19_consul) C++14
100 / 100
 23 ms 208 KB 
#include "grader.h"
#include <iostream>
#include <map>
using namespace std;
map<int, int> m;

void solve(int n){
    m.clear();
    int salt = max(2, n/60);
    int nrq = 0;
    for(int i = 1; i <= n && nrq < 60; i += salt){
        int val = kth(i); nrq++;
        if(m.count(val)){
        }else{
            if(nrq < 60){
                m[val] = cnt(val); nrq++;
                if(m[val] > n/3){
                    say_answer(val);
                    return ;
                }
            }
        }
    }
    say_answer(-1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 208 KB Output is correct
2 Correct 15 ms 208 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 208 KB Output is correct
2 Correct 15 ms 208 KB Output is correct
3 Correct 17 ms 208 KB Output is correct
4 Correct 16 ms 208 KB Output is correct
5 Correct 22 ms 208 KB Output is correct
6 Correct 21 ms 208 KB Output is correct
7 Correct 19 ms 208 KB Output is correct
8 Correct 22 ms 208 KB Output is correct
9 Correct 19 ms 208 KB Output is correct
10 Correct 21 ms 208 KB Output is correct
11 Correct 22 ms 208 KB Output is correct
12 Correct 19 ms 208 KB Output is correct
13 Correct 21 ms 208 KB Output is correct
14 Correct 23 ms 208 KB Output is correct