oj.uz

Submission #315036

# Submission time Handle Problem Language Result Execution time Memory
315036 2020-10-22T01:05:37 Z daniel920712 CONSUL (info1cup19_consul) C++14
0 / 100
 95 ms 256 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;
    for(i=1;i<=n;i++)
    {
        t=kth(i);
        all[t]++;
        if(all[t]==10)
        {
            x=cnt(t);
            big=max(big,x);
            xx-=(x-10);
        }
        big=max(big,all[t]);

        if(big>n/3)
        {
            //printf("%d %d\n",big,n/3);
            say_answer(t);
            return;
        }
        if(big+(xx-i)<=n/3)
        {
            say_answer(-1);
            return;
        }
    }
    say_answer(-1);
}

Subtask #1
0.0 / 15.0

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

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 35 ms 256 KB Output is partially correct
2 Incorrect 2 ms 256 KB Wrong answer

Subtask #3
0.0 / 65.0

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