제출 #645460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
645460		mychecksedad	Genetics (BOI18_genetics)	C++17	46 / 100	2077 ms	8052 KiB

genetics

/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;



int n, m, k, c;
bitset<4200> a[4200][4];
vector<bool> is(N);
int dif(int x, int y){
    int ans = 0;
    for(int i = 0; i < c; ++i) ans += (a[x][i] & a[y][i]).count();
    return m - ans;
}

void solve(){
    cin >> n >> m >> k;
    string t;
    if(n <= 100) c = 4;
    else c = 2;
    for(int i = 0; i < n; ++i){
        cin >> t;
        for(int j = 0; j < m; ++j){
            if(t[j] == 'A') a[i][0][j] = 1;
            if(t[j] == 'C') a[i][1][j] = 1;
            if(t[j] == 'T') a[i][2][j] = 1;
            if(t[j] == 'G') a[i][3][j] = 1;
        }
    }
    set<int> cur;
    for(int i = 0; i < n; ++i){
        if(cur.empty()){
            bool ok = 1;
            for(int j = 0; j < i; ++j) if(dif(j, i) != k){
                ok = 0;
            }
            if(ok) cur.insert(i), is[i] = 1;
            continue;
        }
        bool ok = 1;
        for(int j = 0; j < i; ++j) if(dif(j, i) != k){
            if(is[j]) cur.erase(j), is[j] = 0;
            ok = 0;
        }
        if(ok) cur.insert(i), is[i] = 1;
    }
    cout << *cur.begin() + 1;
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

컴파일 시 표준 에러 (stderr) 메시지

genetics.cpp: In function 'int main()':
genetics.cpp:66:16: warning: unused variable 'aa' [-Wunused-variable]
   66 |     int T = 1, aa;
      |                ^~

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