#include <bits/stdc++.h>
using namespace std;
int uc[4][4107],arr[4107][4107],k,m;
long long ars[4107][1000];
bool c[4107],ps;
bool check(int a,int b)
{
int x=0;
for(int i=0;i<=(ps?(m-1)/16:(m-1)/64);i++) x+=__builtin_popcountll(ars[a][i] xor ars[b][i]);
if(ps) x/=2;
printf("%d\n",x);
if(x==k) return true;
return false;
}
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n>>m>>k;
string s;
for(int i=0;i<n;i++)
{
cin>>s;
for(int j=0;j<m;j++)
{
if(s[j]=='A') arr[i][j]=0;
if(s[j]=='C') arr[i][j]=1;
if(s[j]=='G') arr[i][j]=2;
if(s[j]=='T') arr[i][j]=3;
if(arr[i][j]>1) ps=true;
uc[arr[i][j]][j]++;
}
}
if(!ps) for(int i=0;i<n;i++) for(int j=0;j<m;j++) ars[i][j/64]+=(arr[i][j]<<(j%64));
else for(int i=0;i<n;i++) for(int j=0;j<m;j++) ars[i][j/16]+=(1LL<<(arr[i][j]+(j%16)*4));
/*for(int ttt=0;ttt<200000;ttt++)
{
int x=rand()%n,y=rand()%n;
if(x==y) continue;
int st=0;
if(!check(x,y)) {c[x]=c[y]=true;};
}*/
for(int i=0;i<n;i++) if(!c[i])
{
int skor=0;
bool propo=false;
for(int j=0;j<m;j++) skor+=(n-uc[arr[i][j]][j]);
if(skor!=(n-1)*k) continue;
for(int j=0;j<n;j++) if(i!=j) if(!check(i,j)) {propo=true; break;}
if(propo) continue;
printf("%d",i+1);
return 0;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
1020 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
55 ms |
23032 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
55 ms |
23032 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
1020 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
