| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1336643 | teodorazvan | Mutating DNA (IOI21_dna) | C++20 | 460 ms | 2616 KiB |
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
string a,b;
void init(string A,string B){
a=A;
b=B;
}
int get_distance(int l,int r){
string s1,s2;
s1='.'+a;
s2='.'+b;
int c1a=0,c1t=0,c1c=0;
for(int i=l;i<=r;i++){
if(s1[i]=='A') c1a++;
else if(s1[i]=='T') c1t++;
else c1c++;
}
int c2a=0,c2t=0,c2c=0;
for(int i=l;i<=r;i++){
if(s2[i]=='A') c2a++;
else if(s2[i]=='T') c2t++;
else c2c++;
}
if(c1a!=c2a||c1t!=c2t||c1c!=c2c) return -1;
int cnt=0;
for(int i=l;i<=r;i++){
if(s1[i]!=s2[i]) cnt++;
}
if(cnt==0) return 0;
if(cnt==2) return 1;
if(cnt==3) return 2;
return -1;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
