oj.uz

Submission #364126

# Submission time Handle Problem Language Result Execution time Memory
364126 2021-02-08T09:26:39 Z ahmedfouadnew CONSUL (info1cup19_consul) C++17
32.9554 / 100
 43 ms 512 KB 
#include "grader.h"
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
void solve(int n)
{
   int x;
   map<int,bool>mp;
    int vis[1001]={0};
    int cur=60;
    bool ok=0;
   while(cur--)
   {
       x=rand()%n+1;
       if(vis[x]) continue;
       vis[x]=1;
       int y=kth(x);
       if(!mp[y])
       {
           mp[y]=1;
           if(cnt(y)>n/3)
           {
               ok=1;
               say_answer(y);
               break;
           }
       }
   }
   if(!ok) say_answer(-1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 364 KB Output is correct

Subtask #2
15.2 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 22 ms 364 KB Output is partially correct
2 Correct 8 ms 364 KB Output is correct

Subtask #3
2.7554252895 / 65.0

# Verdict Execution time Memory Grader output
1 Partially correct 26 ms 504 KB Output is partially correct
2 Partially correct 27 ms 512 KB Output is partially correct
3 Correct 9 ms 364 KB Output is correct
4 Correct 8 ms 364 KB Output is correct
5 Partially correct 35 ms 504 KB Output is partially correct
6 Partially correct 29 ms 364 KB Output is partially correct
7 Partially correct 43 ms 364 KB Output is partially correct
8 Partially correct 37 ms 364 KB Output is partially correct
9 Partially correct 35 ms 364 KB Output is partially correct
10 Partially correct 31 ms 364 KB Output is partially correct
11 Partially correct 27 ms 364 KB Output is partially correct
12 Partially correct 34 ms 364 KB Output is partially correct
13 Partially correct 31 ms 364 KB Output is partially correct
14 Partially correct 41 ms 364 KB Output is partially correct