제출 #996287

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996287		amine_aroua	Genetics (BOI18_genetics)	C++17	100 / 100	1799 ms	15564 KiB

genetics

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

using namespace std;
#define pb push_back
#define nl '\n'
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i, x, y) for(int i = x;i<=y;i++)
#define forn(i, y, x) for(int i = y; i >= x; i--)
mt19937 rng (chrono::steady_clock::now().time_since_epoch().count());
vector<int> encode(char c)
{
    vector<int> v(3 , 0);
    if(c == 'A')
        v[0] = 1;
    else if(c == 'C')
        v[1] = 1;
    else if(c == 'G')
        v[2] = 1;
    else
    {
        v = vector<int>(3 , 1);
    }
    return v;
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n , m , k;
    cin>>n>>m>>k;
    bitset<3 * 4100> bs[n];
    vector<int> cnt(n);
    vector<int> perm;
    fore(i , n) {
        string s;
        cin >> s;
        fore(j, m) {
            vector<int> code = encode(s[j]);
            forr(l , 3*j , 3*j + 2)
            {
                if(code[l - 3*j] == 1)
                    cnt[i]++;
                bs[i][l] = code[l - 3*j];
            }
        }
    }

    fore(i , n)
    {
        perm.clear();
        fore(j , n)
        {
            if(i == j)
                continue;
            if(abs(cnt[i] - cnt[j]) > 2 * k || cnt[i] + cnt[j] < 2 * k)
                continue;
            perm.pb(j);
        }
        shuffle(perm.begin() , perm.end() , rng);
        bool acc = 1;
        for(auto j : perm)
        {
            if((bs[j]^bs[i]).count() != 2*k)
            {
                acc = 0;
                break;
            }
        }
        if(acc)
        {
            cout<<i + 1<<nl;
            return 0;
        }
    }
}

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

genetics.cpp: In function 'int main()':
genetics.cpp:66:38: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   66 |             if((bs[j]^bs[i]).count() != 2*k)
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~

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