제출 #777956

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777956		TheSahib	Genetics (BOI18_genetics)	C++17	100 / 100	1893 ms	16180 KiB

genetics

#pragma GCC target("popcnt")

#include <bits/stdc++.h> 
 
#define ll long long
#define ull unsigned ll
#define oo 1e9
#define pii pair<int, int>
 
using namespace std;
 
const int MAX = 4105;
const int SIZE = (MAX / 64 + 1) * 4;

int n, m, k;

struct bs{
    ull arr[SIZE];
    bs(){
        memset(arr, 0, sizeof(arr));
    }
    void setBit(int pos){
        arr[pos / 64] |= (1ull << (pos % 64));
    }
};

int band(bs& a, bs& b){
    int cnt = 0;
    for (int i = 0; i < SIZE; i++)
    {
        cnt += __popcount(a.arr[i] & b.arr[i]);
    }
    return cnt;
}

bs st[MAX];

int comp(int a, int b){
    return m - band(st[a], st[b]);
}

int ans[MAX];

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].setBit((c - 'A') * MAX + j);
        }
    }
    
    vector<int> v;
    v.resize(n);
    iota(v.begin(), v.end(), 0);
    srand(time(0));
    random_shuffle(v.begin(), v.end());
    
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if(comp(v[i], v[j]) == k){
                ans[v[i]]++;
                ans[v[j]]++;
            }
        }
        if(ans[v[i]] == n - 1){
            cout << v[i] + 1 << '\n';
            return;
        }
    }
}
 
int main()
{
    solve();
}

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

genetics.cpp: In function 'void solve()':
genetics.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~

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