제출 #1197060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1197060		12345678	Genetics (BOI18_genetics)	C++20	100 / 100	1105 ms	20676 KiB

genetics

#include <bits/stdc++.h>

using namespace std;

#define ll long long

mt19937 rng(12345678);

const ll nx=4105, mod=1e9+7;

ll n, m, k, mp[100];
string s[nx];

struct hash
{
    ll w[nx], qs[nx][4], sm, target;
    void init()
    {
        for (int i=0; i<n; i++) w[i]=(rng()%(mod-1))+1, sm+=w[i];
        for (int i=0; i<n; i++) for (int j=0; j<m; j++) qs[j][mp[s[i][j]]]=(qs[j][mp[s[i][j]]]+w[i])%mod;
    }
    bool valid(int idx)
    {
        target=0;
        for (int i=0; i<m; i++) for (int j=0; j<4; j++) if (j!=mp[s[idx][i]]) target=(target+qs[i][j])%mod;
        return target==(((((sm-w[idx])%mod+mod)%mod)*k)%mod);
    }
} h[5];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>k;
    mp['A']=0, mp['C']=1, mp['T']=2, mp['G']=3;
    for (int i=0; i<n; i++) cin>>s[i];
    for (int i=0; i<5; i++) h[i].init();
    for (int i=0; i<n; i++)
    {
        bool f=1;
        for (int j=0; j<5; j++) if (!h[j].valid(i)) f=0;
        if (f) return cout<<i+1, 0;
    }
}

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