oj.uz

Submission #315041

# Submission time Handle Problem Language Result Execution time Memory
315041 2020-10-22T01:10:59 Z daniel920712 CONSUL (info1cup19_consul) C++14
27.8 / 100
 182 ms 384 KB 
#include "grader.h"
#include <map>
using namespace std;
map < int , int > all;
void solve(int n)
{
    all.clear();
    int i,t,big=0,xx=n,x;
    if(n<=50)
    {
        for(i=1;i<=n;i++)
        {
            t=kth(i);
            all[t]++;
            big=max(big,all[t]);
     
            if(all[t]>n/3)
            {
                say_answer(t);
                return;
            }
            if(big+(n-i)<=n/3)
            {
                say_answer(-1);
                return;
            }
        }
        say_answer(-1);
    }
    else 
    {
        for(i=1;i<=n/3*2+10;i++)
        {
            t=kth(i);
            all[t]++;
            if(all[t]==10)
            {
                x=cnt(t);
                big=max(big,x);
                xx-=(x-10);
            }
            if(big>n/3)
            {
                say_answer(t);
                return;
            }
            
        }
        say_answer(-1);
    }
    
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 256 KB Output is correct

Subtask #2
12.8 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 41 ms 256 KB Output is partially correct
2 Partially correct 34 ms 256 KB Output is partially correct

Subtask #3
0.0 / 65.0

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