Submission #866388

#	Time	Username	Problem	Language	Result	Execution time	Memory
866388		The_Samurai	Genetics (BOI18_genetics)	C++17	46 / 100	240 ms	36944 KiB

genetics

//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll inf = 1e18;

const int M = 1800;

int main() {
    cin.tie(0)->sync_with_stdio(false);
#ifdef sunnatov
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int n, m, k;
    cin >> n >> m >> k;
    vector<string> a(n);
    for (string &s: a) cin >> s;
    bool sub2 = true;
    for (int i = 0; i < n and sub2; i++) for (char x: a[i]) sub2 &= x == 'A' or x == 'C';
    if (sub2) {
        vector<bitset<M>> bs(n);
        for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (a[i][j] == 'A') bs[i].set(j);
        vector<bool> ok(n, true);
        for (int i = 0; i < n; i++) {
            if (!ok[i]) continue;
            for (int j = 0; j < n; j++) {
                if (i == j) continue;
                if ((bs[i] ^ bs[j]).count() != k) {
                    ok[i] = ok[j] = false;
                    break;
                }
            }
            if (ok[i]) {
                cout << i + 1;
                return 0;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        bool ok = true;
        for (int j = 0; j < n and ok; j++) {
            if (i == j) continue;
            int cnt = 0;
            for (int p = 0; p < m and cnt <= k; p++) cnt += a[i][p] != a[j][p];
            ok &= cnt == k;
        }
        if (ok) {
            cout << i + 1;
            return 0;
        }
    }
}

Compilation message (stderr)

genetics.cpp: In function 'int main()':
genetics.cpp:31:45: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |                 if ((bs[i] ^ bs[j]).count() != k) {
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~

• Subtask 1: 27 / 27
• Subtask 2: 19 / 19
• Subtask 3: 0 / 28
• Subtask 4: 0 / 26