제출 #518559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
518559		Ierus	Genetics (BOI18_genetics)	C++17	0 / 100	5 ms	1096 KiB

genetics

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
#define F first
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
typedef long long ll;
const int E = 1e6+777;
const long long inf = 1e18+777;
const int N = 111;
const int MOD = 1e9+7;
const bool I = 1;
int n, m, k;
string s[N];
int main(){
	cin >> n >> m >> k;
	for(int i = 1; i <= n; ++i){
		cin >> s[i];
	}
	for(int i = 1; i <= n; ++i){
		int cnt = 0;
		for(int j = 1; j <= n; ++j){
			if(i == j) continue;
			int mx = 0;
			for(int p = 0; p < m; ++p){	
				mx += (s[i][p] != s[j][p]);
			}
			cnt = max(mx, cnt);
		}
		if(cnt <= k){
			cout << i << '\n';
			return 0;
		}
	}
};

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