제출 #208467

#제출 시각아이디문제언어결과실행 시간메모리
208467tleontest1Genetics (BOI18_genetics)C++14
27 / 100
2080 ms3516 KiB

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 5005;
const lo mod = 1000000007;
 
int n,m,b[li],a[li],k,flag,t,dp[li][li],vis[li];
int cev;
string s[li];
vector<int> v;
 
int main(void){
	cin>>n>>m>>k;
	FOR{
		cin>>s[i];
	}
	FOR{
		flag=0;
		if(vis[i]==1)continue;
		for(int j=1;j<=n;j++){
			if(i==j)continue;
			cev=0;
			for(int jj=0;jj<m;jj++){
				if(s[i][jj]!=s[j][jj])cev++;
			}
			if(cev!=k){vis[i]=1;vis[j]=1;}
		}
	}
	FOR{
		if(vis[i]==0){printf("%d\n",i);return 0;}
	}
	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...