# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522385 | LucaDantas | Genetics (BOI18_genetics) | C++17 | 349 ms | 16372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 1810;
string a[maxn];
bitset<maxn> b[maxn];
int dist(string x, string y) {
int ans = 0;
for(int i = 0; i < x.size(); i++)
ans += x[i] != y[i];
return ans;
}
int main() {
int n, m, k; cin >> n >> m >> k;
string s;
for(int i = 0; i < n; i++) {
cin >> s; a[i] = s;
for(int i = 0; i < m; i++)
s[i] = (s[i] == 'A') + '0';
b[i] = bitset<maxn>(s);
}
for(int i = 0; i < n; i++) {
bool ok = 1;
for(int j = 0; j < n; j++) {
if(i == j) continue;
if(max(n, m) > 100) { if((b[i]^b[j]).count() != k) { ok = 0; break; } }
else if(dist(a[i], a[j]) != k) { ok = 0; break; }
}
if(ok) printf("%d\n", i+1);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |