//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
string ss1,ss2;
void init(string s1,string s2)
{
ss1=s1,ss2=s2;
}
int get_distance(int n,int m)
{
if(n==m)
{
if(ss1[n]==ss2[m])
{
return 0;
}
else
{
return -1;
}
}
else
{
int cnt=0;
string res1="",res2="",res1C,res2C;
for(int i=n;i<=m;i++)
{
res1+=ss1[i],res2+=ss2[i];
}
res1C=res1,res2C=res2,sort(res1.begin(),res1.begin()),sort(res2.begin(),res2.end());
if(res1==res2)
{
if(n+1==m)
{
if(res1C==res2C)
{
return 0;
}
else
{
return 1;
}
}
else
{
for(int i=0;i<res1.size();i++)
{
if(res1[i]==res2[i])
{
cnt++;
}
}
if(cnt==0)
{
return 2;
}
else if(cnt==2)
{
return 1;
}
else
{
return 0;
}
}
}
else
{
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... |