# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378257 | Nima_Naderi | Genetics (BOI18_genetics) | C++14 | 543 ms | 36552 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.
///In the name of GOD
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 4100 + 10;
const ll Mab = 4783;
const ll Mod = 1e9 + 87;
ll n, m, k;
ll hsh[MXN][4], pw[MXN], one[MXN];
string S[MXN];
void mkay(ll& x){
if(x >= Mod) x -= Mod;
if(x < 0) x += Mod;
}
ll MAP(char c){
switch(c){
case 'A' : return 0;
case 'T' : return 1;
case 'C' : return 2;
case 'G' : return 3;
}
assert(0);
}
int main(){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
pw[0] = one[0] = 1;
for(int i = 1; i < MXN; i ++){
pw[i] = pw[i - 1] * Mab % Mod;
# | 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... |