oj.uz

Submission #384629

# Submission time Handle Problem Language Result Execution time Memory
384629 2021-04-01T23:15:32 Z fadi57 CONSUL (info1cup19_consul) C++14
19 / 100
 823 ms 364 KB 
#include "grader.h"
#include<bits/stdc++.h>

using namespace std;

void solve(int n)
{
    map<int,int>mp;
    /// insert your code
    /// for example

    int z=n/3;

    int ok=0;
    int zz=n-z+n/2;
    map<int,int>mp2;
    for(int i=1;i<=n;i++){
            int me=kth(i);
    mp[me]++;
        if(mp[me]>z){
                ok=1;
            say_answer(me);
            break;
        }
        if(i>=zz&&mp2[me]==0&&ok==0){
            int w=cnt(me);
            mp2[me]=w;
            if(w>n/3){
                ok=1;
                    say_answer(me);
            break;}
        }
    }
    if(!ok){say_answer(-1);}

}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 364 KB Output is correct

Subtask #2
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 89 ms 364 KB Output is partially correct
2 Partially correct 68 ms 364 KB Output is partially correct

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Partially correct 823 ms 364 KB Output is partially correct
2 Halted 0 ms 0 KB -