| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1343724 | ElyesChaabouni | Mutating DNA (IOI21_dna) | C++20 | 16 ms | 2348 KiB |
#include <bits/stdc++.h>
using namespace std;
string c,d;
void init(std::string a, std::string b){
c=a;
d=b;
return;
}
int get_distance(int x, int y){
if(y-x==0){
if(c[x]==d[x])return 0;
else return -1;
}
int a=0,t=0;
int a1=0,t1=0;
for(int i=x;i<=y;i++){
if(c[i]!=d[i]){
if(c[i]=='A'){a++;t1++;}
if(c[i]=='T'){t++;a1++;}
}
}
//a!=t || a1!=t1 ||
if( a!=a1 || t!=t1)return -1;
if(a==0 && t==0)return 0;
else (a+t)/2;
}Compilation message (stderr)
| # | 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... | ||||
