| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 861718 | serifefedartar | Genetics (BOI18_genetics) | C++17 | 2079 ms | 19284 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;
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9+9;
const ll LOGN = 20;
const ll MAXN = 4100 + 100;
bitset<4200> bs[MAXN];
int main() {
fast
int N, M, K;
cin >> N >> M >> K;
for (int i = 1; i <= N; i++) {
string s;
cin >> s;
for (int j = 0; j < M; j++) {
if (s[j] == 'A')
bs[i][j] = 1;
}
}
for (int i = 1; i <= N; i++) {
int cnt = 0;
for (int j = 1; j <= N; j++) {
bitset<4200> res = bs[i] ^ bs[j];
if (res.count() == K)
cnt++;
}
if (cnt + 1 == N) {
cout << i << "\n";
return 0;
}
}
}
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... | ||||
