제출 #518725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
518725		Ierus	Genetics (BOI18_genetics)	C++17	46 / 100	2084 ms	24912 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 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)
typedef long long ll;
const int E = 1e6+777;
const long long inf = 1e18+777;
const int N = 4102;
const int MOD = 1e9+7;
const bool I = 1;
int n, m, k;
string s[N];
bitset<N> bin[4][N];
int cnt[4][N];
int get(char a){
	if(a == 'A') return 0;
	if(a == 'C') return 1;
	if(a == 'G') return 2;
	return 3;
}
int main(){
	NFS;
	cin >> n >> m >> k;
	for(int i = 1; i <= n; ++i){
		cin >> s[i];
		for(int x = 0; x < 4; ++x){
			for(int j = 0; j < m; ++j){
				bin[x][i][j] = (x == get(s[i][j]));
			}
			cnt[x][i] = bin[x][i].count();
		}
	}
	for(int i = 1; i <= n; ++i){
		bool ok = true;
		for(int j = 1; j <= n; ++j){
			if(i == j) continue;
			int sum = 0;
			for(int x = 0; x < 4; ++x){
				sum += cnt[x][i] - (bin[x][i] & bin[x][j]).count();
			}
			if(sum != k){
				ok = false;
				break;
			}
		}
		if(ok){
			cout << i;
			return 0;	
		}
	}
};
 
 
 
 

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