Submission #878162

#	Time	Username	Problem	Language	Result	Execution time	Memory
878162		vjudge1	Genetics (BOI18_genetics)	C++17	27 / 100	207 ms	8820 KiB

genetics

#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define pb push_back

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")

const int N = 4100 + 4;

int n, m, k;
char s[N][N];
bitset<N> t, b[N];

mt19937 rng(time(0));

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    bool AC = true;

    cin >> n >> m >> k;
    
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
        s[i][m] = i;
    }

    shuffle(s, s + n, rng);

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (s[i][j] == 'G') {
                AC = 0;
            }
            else {
                if (s[i][j] == 'C') {
                    b[i][j] = 1;
                }
            }
        }
    }

    if (AC == false) {
        for (int i = 0; i < n; ++i) {
            int cntOk = 0;
            for (int j = 0; j < n; ++j) {
                if (j == i) {
                    continue;
                }
                int cnt = 0;
                for (int l = 0; l < m; ++l) {
                    cnt += (s[i][l] != s[j][l]);
                }
                cntOk += (cnt == k);
            }

            if (cntOk == n - 1) {
                cout << (int) s[i][m] + 1;
                return 0;
            }
        }
    }
    
    for (int i = 0; i < n; ++i) {
        int cntOk = 0;
        for (int j = 0; j < n; ++j) {
            if (i == j) {
                continue;
            }
            t = b[i] ^ b[j];
            cntOk += (t.count() == k);
        }
        if (cntOk == n - 1) {
            cout << (int) s[i][m] + 1;
            return 0;
        }
    }

    return 0;
}

Compilation message (stderr)

genetics.cpp: In function 'int main()':
genetics.cpp:74:33: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   74 |             cntOk += (t.count() == k);
      |                       ~~~~~~~~~~^~~~

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