# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728759 | jampm | Genetics (BOI18_genetics) | C++17 | 1572 ms | 19972 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)a.size()
int const Mxn = 4101;
int lobo[26] = {0, -1, 1, -1, -1, -1, 2, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 3, -1, -1, -1, -1, -1};
struct relsB {
unsigned long long int B[4][Mxn/64 + 1];
void init(string & s) {
for (int i = 0; i < sz(s); i++) {
B[lobo[s[i] - 'A']][i/64] ^= 1<<(i%64);
}
}
} A[Mxn];
int grid[Mxn][Mxn], is_good[Mxn];
int count(relsB & X, relsB & Y, int ans = 0) {
for (int i = 0; i <= Mxn/64; i++) {
for (int j = 0; j < 4; j++) {
ans += __builtin_popcount(X.B[j][i]^Y.B[j][i]);
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k, m; cin >> n >> m >> k;
k <<= 1; string s;
for (int i = 0; i < n; i++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |