| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 473430 | Ahmadsm2005 | Genetics (BOI18_genetics) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
bool BAD[4100];
string s;
vector<int>lolz;
vector<pair<string,int>>lolz2;
bitset<4100>wow[4100];
bitset<4100>TEMP;
int COMP(int x,int y){
int K=0;
for(int i=0;i<m;i++)
if(lolz2[x].first[i]!=lolz2[y].first[i])
K++;
return K;
}
int32_t main()
{
cin.tie(0),iostream::sync_with_stdio(0);
//freopen("halfnice.in","r",stdin);
cin>>n>>m>>k;
mt19937 rng(2005);
bool NO=0;
for(int i=0;i<n;i++){
cin>>s;
lolz.push_back(i);
lolz2.push_back({s[i],i});
for(int l=0;l<m;l++){
if(s[l]=='A')
wow[i][l]=0;
else if(s[l]=='C')
wow[i][l]=1;
else
NO=1;
}
}
if(!NO){
while(1){
shuffle(lolz.begin(),lolz.end(),rng);
if(BAD[lolz[0]])
continue;
for(int i=1;i<n;i++){
TEMP=wow[lolz[0]]^wow[lolz[i]];
if(TEMP.count()!=k){
BAD[lolz[0]]=1,BAD[lolz[i]]=1;
goto a;
}
}
cout<<lolz[0]+1<<endl;
exit(0);
a:;
}
}
while(1){
shuffle(lolz2.begin(),lolz2.end(),rng);
for(int i=1;i<n;i++){
if(COMP(0,i)!=k)
goto a;
}
cout<<lolz2[0].second+1<<endl;
break;
a:;
}
}