제출 #777797

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777797		TheSahib	Genetics (BOI18_genetics)	C++14	46 / 100	928 ms	17124 KiB

genetics

#include <bits/stdc++.h>

#pragma GCC target("popcnt")

#define ll long long
#define oo 1e9
#define pii pair<int, int>

using namespace std;

const int MAX = 1 << 12;

int n, m, k; 
bitset<MAX> st[MAX][4];

int comp(int a, int b){
    int cnt = 0;
    for (int i = 0; i < 4; i++)
    {
        cnt += (st[a][i] & st[b][i]).count();
    }
    return m - cnt;
}

void solve(){
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 0; i < n; i++)
    {
        getchar();
        for (int j = 0; j < m; j++)
        {
            char c = getchar();
            if(c == 'G') c = 'B';
            if(c == 'T') c = 'D';
            st[i][c - 'A'][j] = 1;
        }
    }
    vector<int> v;
    v.resize(n);
    iota(v.begin(), v.end(), 0);
    
    srand(time(0));
    random_shuffle(v.begin(), v.end());
    
    vector<int> p;
    for(int i:v){
        if(i == v[0]) continue;
        if(comp(i, v[0]) == k){
            p.push_back(i);
        }
    }
    if(p.size() == n - 1){
        cout << v[0] + 1 << '\n';
        return;
    }
    random_shuffle(v.begin(), v.end());
    for(int i:p){
        bool pos = true;
        for(int j:v){
            if(i == j) continue;
            if(comp(i, j) != k){
                pos = false;
                break;
            }
        }
        if(pos){
            cout << i + 1 << '\n';
            return;
        }
    }
}

int main()
{
    solve();
}

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

genetics.cpp: In function 'void solve()':
genetics.cpp:52:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |     if(p.size() == n - 1){
      |        ~~~~~~~~~^~~~~~~~
genetics.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~

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