제출 #473351

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
473351		Ahmadsm2005	Genetics (BOI18_genetics)	C++14	0 / 100	9 ms	6676 KiB

genetics

#include <bits/stdc++.h>
#define endl '\n'
#define modulo 998244353
#define modulo2 998244353
#define eps 0.00000001
#define int long long
#define PI acos(-1)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#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=modulo)
{
if(y<0)
return 0;
int temp;
if(y == 0)
return 1;
temp = (power(x, y/2,m))%m;
if (y%2 == 0)
return ((temp%m)*temp)%m;
else
return ((x*temp%m)*temp%m)%m;
}
int inv(int x,int m=modulo)
{
return (power(x,m-2,m))%m;
}
int n,m,k;
string s;
vector<pair<string,int>>lolz;
int COMP(int x,int y){
int K=0;
for(int i=0;i<m;i++)
if(lolz[x].first[i]!=lolz[y].first[i])
K++;
return K;
}
map<string,int>lol;
int32_t main()
{
cin.tie(0),iostream::sync_with_stdio(0);
//freopen("halfnice.in","r",stdin);
cin>>n>>m>>k;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
for(int i=0;i<n;i++){
cin>>s;
lolz.push_back({s,i});
lol[s]++;
}
while(clock()<=1900){
shuffle(lolz.begin(),lolz.end(),rng);
if(lol[lolz[0].first]-1)continue;
for(int i=1;i<n;i++){
if(COMP(0,i)!=k)
goto a;
}
cout<<lolz[0].second+1<<endl;
break;
a:;
}
}

• Subtask 1: 0 / 27
• Subtask 2: 0 / 19
• Subtask 3: 0 / 28
• Subtask 4: 0 / 26