# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135686 | xnqs | Genetics (BOI18_genetics) | C++20 | 0 ms | 0 KiB |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <bitset>
int x, y, tgt;
char str[4105][4105];
inline int dist(char* a, char* b) {
int ret = 0;
for (int i = 0; i < y &&; ++i) {
ret += (a[i]==b[i]);
}
return y - ret;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cin >> x >> y >> tgt;
for (int i = 0; i < x; i++) {
std::cin >> str[i];