제출 #532678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532678		sidon	Genetics (BOI18_genetics)	C++17	100 / 100	597 ms	77300 KiB

genetics

#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2", "popcnt", "sse4.2")
#include <bits/stdc++.h>
using namespace std;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int Z = 4100;
using num = unsigned long long;
struct Bitset {
	static const int B = 1<<6;
 
#define setBit(X, I) (X ^= (num(-1) ^ X) & (num(1)<<(I)))
#define blk(X) ((X)>>6)
 
	num v[blk(Z<<2)+1] {};
 
	void assign(const int &i) {
		setBit(v[blk(i)], (i & 63));
	}
	inline int countAnd(const Bitset &x) const {
		int res = 0;
		for(int i = blk(Z<<2); i >= 0; --i)
			res += __builtin_popcountll(v[i] & x.v[i]);
 
		return res;
	}
	void flip() {
		for(num &i : v) i = ~i;
	}
};
 
int N, M, K;
Bitset a[Z];
 
int g[100];
 
bool chk[Z][Z], cnt[Z][Z];
int cntAt[Z][4];

string inp[Z];

int main() {
	ios::sync_with_stdio(0), cin.tie(0);

	g['C'] = 1;
	g['G'] = 2;
	g['T'] = 3;
 
	cin >> N >> M >> K;
 
	int o[N];
 
	for(int i = 0; i < N; ++i) {
		cin >> inp[i];
		for(int j = 0; j < M; ++j) {
			a[i].assign(g[int(inp[i][j])] * Z + j);
			++cntAt[j][g[int(inp[i][j])]];
		}
		o[i] = i;
	}

	shuffle(o, o + N, rng);

	for(const int &i : o) {
		bool ok = 1;

		int sum = 0;

		for(int j = 0; j < M; ++j)
			sum += N - cntAt[j][g[int(inp[i][j])]];

		if(sum != (N - 1) * K) continue;
		a[i].flip();

		for(const int &j : o) if(i != j) {
			bool c = (chk[i][j] ? cnt[i][j] : a[i].countAnd(a[j]) == K);
 
			chk[j][i] = 1;
			cnt[j][i] = c;
 
			if(!c) {
				ok = 0;
				break;
			}
		}
 
		if(ok) {
			cout << i + 1;
			return 0;
		}
		a[i].flip();
	}
}

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