Submission #932701

#TimeUsernameProblemLanguageResultExecution timeMemory
932701WongChun1234Genetics (BOI18_genetics)C++14
47 / 100
1872 ms18976 KiB
#include<bits/stdc++.h>
using namespace std;
const int N=4150;
int n,m,k,cnt,bad[N];
string s;
bitset<4100> bs[N];
int main(){
	cin>>n>>m>>k;
	for (int i=1;i<=n;i++){
		cin>>s;
		for (int j=0;j<m;j++) bs[i][j]=(s[j]=='A');
	}
	for (int i=1;i<=n;i++){
		for (int j=i+1;j<=n;j++){
			if (i==j) continue;
			cnt=(bs[i]^bs[j]).count();
			if (cnt!=k) bad[j]=bad[i]=1;
		}
		if (!bad[i]){
			cout<<i<<"\n";
			return 0;
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...