oj.uz

Submission #364116

# Submission time Handle Problem Language Result Execution time Memory
364116 2021-02-08T09:03:45 Z Ahmadsm2005 CONSUL (info1cup19_consul) C++14
80 / 100
 44 ms 512 KB 
#include <bits/stdc++.h>
#include "grader.h"
//#define endl '\n'
#define modulo 1000000007
//#define int long long
#define PI acos(-1)
#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")
#define sinDegrees(x) sin((x) * PI / 180.0)
#define cosDegrees(x) cos((x) * PI / 180.0)
#define tanDegrees(x) tan((x) * PI / 180.0)
#define atanDegrees(x) atan(x)* 180.0 / PI
#define asinDegrees(x) asin(x)* 180.0 / PI
#define EPS 0.000000001
using namespace std;
int power(int x,int y,int m)
{
int temp;
if(y == 0)
return 1;
temp = (power(x, y/2,m))%m;
if (y%2 == 0)
return ((temp%m)*temp);
else
return ((x*temp%m)*temp%m)%m;
}
int inv(int x,int m=modulo)
{
return (power(x,m-2,m))%m;
}
///IOI 2021 isA
int F=40,K=10;
bool freq[1001];
map<int,int>lol;
void solve(int N){
int X=F-K,ANS=-1;
srand(1298);
if(N>100)
X=50,K=10;
for(int i=0;i<=N;i++)
freq[i]=0;
for(int i=0;i<X;i++){
if(i*3>N)
break;
int Z=rand()%N;
while(freq[Z]){
Z=rand()%N;
}
freq[Z]=1;
int RE=kth(Z+1);
lol.insert({RE,0});
lol.at(RE)++;
X--;
}
vector<pair<int,int>>TEMP;
for(auto itr=lol.begin();itr!=lol.end();itr++){
TEMP.push_back({itr->second,itr->first});
}
lol.clear();
sort(TEMP.begin(),TEMP.end()),reverse(TEMP.begin(),TEMP.end());
for(int i=0;i<min((int)TEMP.size(),X+K);i++){
if(cnt(TEMP[i].second)*3>N){
ANS=TEMP[i].second;
break;
}
}
say_answer(ANS);
}
/*int32_t main()
{
//freopen("output.txt","w",stdout);
//freopen("sorting.in","r",stdin);
cin.tie(0),iostream::sync_with_stdio(0);

return 0;
}*/

Subtask #1
15.0 / 15.0

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

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 364 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 364 KB Output is correct
2 Correct 31 ms 364 KB Output is correct
3 Correct 32 ms 364 KB Output is correct
4 Correct 31 ms 364 KB Output is correct
5 Correct 40 ms 364 KB Output is correct
6 Correct 41 ms 364 KB Output is correct
7 Correct 17 ms 364 KB Output is correct
8 Correct 30 ms 364 KB Output is correct
9 Correct 28 ms 364 KB Output is correct
10 Correct 36 ms 512 KB Output is correct
11 Correct 21 ms 364 KB Output is correct
12 Correct 17 ms 364 KB Output is correct
13 Correct 44 ms 364 KB Output is correct
14 Correct 33 ms 364 KB Output is correct