Submission #1363484

#TimeUsernameProblemLanguageResultExecution timeMemory
1363484madamadam3Genetics (BOI18_genetics)C++20
46 / 100
2094 ms24800 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int n, m, k; cin >> n >> m >> k;
    vector<string> seq(n); for (int i = 0; i < n; i++) cin >> seq[i];
    using b = bitset<4100>;

    vector<b> s1(n), s2(n), s3(n), s4(n);
    for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) {
        if (seq[i][j] == 'A') s1[i][j] = 1;
        if (seq[i][j] == 'T') s2[i][j] = 1;
        if (seq[i][j] == 'C') s3[i][j] = 1;
        if (seq[i][j] == 'G') s4[i][j] = 1;
    }

    vector<int> cnt(n);

    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            int t = 0;
            t += (s1[i] ^ s1[j]).count();
            t += (s2[i] ^ s2[j]).count();
            t += (s3[i] ^ s3[j]).count();
            t += (s4[i] ^ s4[j]).count();

            if (t == 2*k) cnt[i]++, cnt[j]++;
        }

        if (cnt[i] == n-1) {
            cout << i+1 << "\n";
            break;
        }
    }
    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...