Submission #315040

#TimeUsernameProblemLanguageResultExecution timeMemory
315040daniel920712CONSUL (info1cup19_consul)C++14
12.80 / 100
195 ms256 KiB
#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/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);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...