oj.uz

Submission #667100

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

void solve(int n){
    m.clear();
    int salt = max(1, 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{
            m[val] = cnt(val); nrq++;
            if(m[val] > n/3){
                say_answer(val);
                return ;
            }
        }
    }
    say_answer(-1);
}

Subtask #1
0.0 / 15.0

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

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 22 ms 208 KB Output is partially correct
2 Incorrect 8 ms 208 KB Wrong answer
3 Halted 0 ms 0 KB -

Subtask #3
52.65 / 65.0

# Verdict Execution time Memory Grader output
1 Partially correct 22 ms 208 KB Output is partially correct
2 Partially correct 23 ms 208 KB Output is partially correct
3 Correct 25 ms 208 KB Output is correct
4 Correct 15 ms 208 KB Output is correct
5 Partially correct 24 ms 208 KB Output is partially correct
6 Partially correct 13 ms 208 KB Output is partially correct
7 Partially correct 17 ms 296 KB Output is partially correct
8 Partially correct 25 ms 208 KB Output is partially correct
9 Partially correct 26 ms 208 KB Output is partially correct
10 Partially correct 29 ms 288 KB Output is partially correct
11 Partially correct 29 ms 208 KB Output is partially correct
12 Partially correct 19 ms 292 KB Output is partially correct
13 Partially correct 25 ms 292 KB Output is partially correct
14 Partially correct 10 ms 208 KB Output is partially correct