oj.uz

Submission #364093

# Submission time Handle Problem Language Result Execution time Memory
364093 2021-02-08T08:29:51 Z soba CONSUL (info1cup19_consul) C++14
0 / 100
 17 ms 364 KB 
#include <bits/stdc++.h>
#include "grader.h"
//#include "grader.cpp"
using namespace std;
void solve(int n)
{
    int need=(n+2)/3;
    int arr[n+1];
    for(int i=1; i <= n ; i++)
    {
        arr[i]=(kth(i));
    }
    sort(arr+1, arr+n);
    int cn=1 , ans=-1;
    for(int i = 2 ; i<=n ; i++)
    {
        if(arr[i]==arr[i-1])cn++;
        else
        {
            if( (n%3==0&&cn>need) || (n%3!=0&&cn>=need))
            {
                ans=arr[i-1];
                break;
            }
            cn=1;
        }
    }
    if( (n%3==0&&cn>need) || (n%3!=0&&cn>=need))
            {
                ans=arr[n];
            }
    say_answer(ans);
}

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 1 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 17 ms 364 KB Wrong answer
2 Halted 0 ms 0 KB -