제출 #977637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977637		efedmrlr	Genetics (BOI18_genetics)	C++17	47 / 100	1016 ms	85072 KiB

genetics

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("bmi,avx2,popcnt")
#include <bits/stdc++.h>

#define lli long long int
#define ld long double
#define pb push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.begin(), x.end()
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)

using namespace std;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 4102;
const int INF = 1e9 + 500;
const int MOD = 1e9 + 7;
array<bitset<N>, N> s;
array<array<int, N>, N> dif;
int n, m, k;
bitset<N> tmp;
bitset<N> vis; 
void solve() {
    cin >> n >> m >> k;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            char t;
            cin >> t;
            s[i][j] = (t == 'A');
        }
    }

    REP(i, n) REP(j, n) dif[i][j] = -1;

    for(int i = 0; i < n; i++) {
        if(vis[i]) continue;
        for(int j = 0; j < n; j++) {
            if(i == j) continue;
            if(dif[i][j] == -1) {   
                tmp = s[i] ^ s[j];
                dif[i][j] = dif[j][i] = (int)tmp.count();
            }
            if(dif[i][j] != k) {
                vis[i] = vis[j] = 1;
            }
        }
        if(!vis[i]) {
            cout << i + 1 << "\n";
            return;
        }
    }
}

signed main() {
    fastio();
    solve();
}

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