# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96544 | 2019-02-10T08:56:52 Z | Kastanda | Genetics (BOI18_genetics) | C++11 | 0 ms | 0 KB |
#include<bits/stdc++.h> #pragma GCC optimize("unroll-loops") #pragma GCC optimize("O3") using namespace std; const int N = 4105; int n, m, k, P[N]; bitset < N > B[N]; inline int Diff(int i, int j) { return ((B[i] ^ B[j]).count()); /*int diff = m; for (int w = 0; w <= 3; w ++) diff -= (B[i][w] & B[j][w]).count(); return (diff);*/ } int main() { scanf("%d%d%d", &n, &m, &k); getchar(); for (int i = 1; i <= n; i++, getchar()) { for (int j = 1; j <= m; j++) { int ch = getchar(); A[j] = ch; if (ch == 'A') ch = 0; else if (ch == 'C') ch = 1; else assert(0); //else if (ch == 'G') ch = 2; //else ch = 3; //B[i][ch][j] = 1; B[i][j] = ch; } } srand(time(0)); iota(P, P + n + 1, 0); for (int i = 1; i <= n; i++) { if (i % 20 == 0) random_shuffle(P + 1, P + n + 1); int j = 1; for (; j <= n; j++) if (i != P[j] && Diff(i, P[j]) != k) break; if (j > n) return !printf("%d\n", i); } assert(0); }