oj.uz

Submission #384619

# Submission time Handle Problem Language Result Execution time Memory
384619 2021-04-01T22:41:38 Z fadi57 CONSUL (info1cup19_consul) C++14
0 / 100
 24 ms 384 KB 
//#include "grader.cpp"
#include<bits/stdc++.h>
#include "grader.h"

using namespace std;

void solve(int n)
{
    map<int,int>mp;


    int ok=0;
    int mid=n/2;
    int ans;
    for(int i=1;i<=mid;i++){

           int myfreq=cnt(i);
        if(myfreq>(n/3)){
                ok=1;
          ans=kth(i);
            break;
        }
    }

    if(ok==0){
      for(int i=mid+1;i<=n;i++){
           // int me=kth(i);
           // mp[me]++;
           int myfreq=cnt(i);
        if(myfreq>(n/3)){
                ok=1;
             ans=kth(i);
             say_answer(ans);
            break;
        }
    }

    }
     if(!ok){
        say_answer(-1);
    }





}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Wrong answer

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 364 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 384 KB Wrong answer
2 Halted 0 ms 0 KB -