Submission #1302624

#TimeUsernameProblemLanguageResultExecution timeMemory
1302624yusifmCONSUL (info1cup19_consul)C++20
19 / 100
260 ms332 KiB
//pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n)
{
    int ans=-1;
    map<int,int>counts;
    for(int i=0;i<n;i++)
    {
        counts[kth(i+1)]++;
        for(auto cnt:counts)
        {
            if(cnt.second>n/3)
            {
                ans=cnt.first;
                break;
            }
        }
        if(ans!=-1)
        {
            break;
        }
    }
    say_answer(ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...