# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123613 | MoNsTeR_CuBe | Genetics (BOI18_genetics) | C++17 | 2083 ms | 35952 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 int long long
int getIndex(char c){
if(c == 'A') return 0;
if(c == 'C') return 1;
if(c == 'G') return 2;
return 3;
}
vector< vector< vector< int > > > opti(4, vector< vector< int > > (65, vector< int >(4101)));
int n, m, K;
int compare(int a, int b){
int tot = 0;
for(int i = 0; i < min((int)65, m/64+1); i++){
for(int j = 0; j < 4; j++){
tot += __builtin_popcountll(opti[j][i][a] ^ opti[j][i][b]);
}
}
return tot/2;
}
signed main(){
cin >> n >> m >> K;
vector< string > v(n);
# | 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... |