# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522383 | LucaDantas | Genetics (BOI18_genetics) | C++17 | 396 ms | 8744 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.
// subtask n = 1800, only 'A' and 'C'
#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 1810;
bitset<maxn> b[maxn];
int main() {
int n, m, k; cin >> n >> m >> k;
string s;
for(int i = 0; i < n; i++) {
cin >> 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 && (b[i]^b[j]).count() != 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... |