제출 #900722

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
900722		Darren0724	Genetics (BOI18_genetics)	C++17	100 / 100	445 ms	36572 KiB

genetics

#pragma GCC optimize("Ofast","O3","unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define int long long 
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=15005;
const int mod=1e9+9;
__gnu_cxx::sfmt19937 rnd(time(0));
map<char,int> m1={{'A',0},{'T',1},{'C',2},{'G',3}};
int32_t main() {
    LCBorz;
    int n,m,k;cin>>n>>m>>k;
    vector<int> a(n);
    vector<string> str(n);
    vector v(4,vector<int>(m,0));
    int total=0;
    for(int i=0;i<n;i++){
        a[i]=rnd();
        total+=a[i];
        cin>>str[i];
        for(int j=0;j<m;j++){
            v[m1[str[i][j]]][j]+=a[i];
        }
    }
    for(int i=0;i<n;i++){
        int p=-total*(m-k);
        for(int j=0;j<m;j++){
            p+=v[m1[str[i][j]]][j];
        }
        if(p==a[i]*k){
            cout<<i+1<<endl;
            return 0;
        }
    }
    
    return 0;
}

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