Submission #518852

#	Time	Username	Problem	Language	Result	Execution time	Memory
518852		Ierus	Genetics (BOI18_genetics)	C++17	100 / 100	1034 ms	36784 KiB

genetics

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
#define F first
//#define int short
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
const int N = 4102;
const bool I = 1;

int n, m, k;
char a[N][N];
bitset<N> bin[4][N];
int cnt[4][N];
int sum[N][4];
template<class T> T randomize(T mod){
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
int get(char a){
	if(a == 'A') return 0;
	if(a == 'C') return 1;
	if(a == 'G') return 2;
	return 3;
}
signed main(){
	NFS;
	cin >> n >> m >> k;
	for(int i = 1; i <= n; ++i){
		for(int j = 0; j < m; ++j){
			cin >> a[i][j];
			bin[get(a[i][j])][i][j] = true;
			++sum[j][get(a[i][j])];
		}
		cnt[0][i] = bin[0][i].count();
		cnt[1][i] = bin[1][i].count();
		cnt[2][i] = bin[2][i].count();
		cnt[3][i] = bin[3][i].count();
	}
	for(int i = 1; i <= n; ++i){
		int kol = 0;
		for(int j = 0; j < m; ++j){
			kol += n - sum[j][get(a[i][j])];
		}
		if(kol != (n - 1) * k){
			continue;
		}
		bool ok = true;
		for(int j = 1; j <= n; ++j){
			if(i == j) continue;
			int sm = 0;
			for(int x = 0; x < 4; ++x){
				sm += cnt[x][i] - (bin[x][i] & bin[x][j]).count();
			}
			if(sm != k){
				ok = false;
				break;
			}
		}
		if(ok){
			cout << i;
			return 0;	
		}
	}
};
 
 
 

Compilation message (stderr)

genetics.cpp:16:14: warning: unnecessary parentheses in declaration of 'rd' [-Wparentheses]
   16 | random_device(rd);
      |              ^

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