제출 #202910

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
202910		admin	Genetics (BOI18_genetics)	C++14	100 / 100	272 ms	17532 KiB

genetics

#include<bits/stdc++.h>
#define ll            long long
#define pb            emplace_back
#define fi            first
#define se            second
#define mp            make_pair
//#define int           int64_t
 
using namespace std;
 
typedef pair<ll, ll> pii;
const int N = (int)1e4 + 2;
 
ll p[N], k, sum[N][5], cur = 0, ss, ssum[N];
char s[4200][4200];
int n, m;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int Code(char c) {
    if(c == 'A') return 1;
    if(c == 'C') return 2;
    if(c == 'T') return 3;
    return 0;
}
 
int main() {
	cin.sync_with_stdio(false);
  cin>>n>>m>>k;
    for(int i = 1; i <= n; ++i) {
      cin>>s[i];
    }//cin >> s[i];
    int step = 10;
    while(step --) {
        for(int i = 1; i <= n; ++i) {
            p[i] = uniform_int_distribution<ll>((ll)1e10, (ll)1e11)(rng);
            for(int j = 0; j < m; ++j) sum[j][Code(s[i][j])] += p[i];
            cur += p[i] * k;
        }
        for(int i = 0; i < m; ++i) {
            ssum[i] = 0;
            for(int j = 0; j < 4; ++j) ssum[i] += sum[i][j];
        }
        for(int i = 1; i <= n; ++i) {
            ss = 0;
            for(int j = 0; j < m; ++j) ss += (ssum[j] - sum[j][Code(s[i][j])]);
            if(cur - p[i] * k == ss) return cout << i, 0;
        }
        if(step == 0) return cout << n, 0;
    }
}

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