Submission #1142589

#TimeUsernameProblemLanguageResultExecution timeMemory
1142589sam12345678910112Mutating DNA (IOI21_dna)C++20
0 / 100
29 ms2356 KiB
 #include<bits/stdc++.h>
using namespace std;
# define ll long long
string A ,B;
int f[100003];


void init(string a, string b){
 
    string A=a;
    string B=b;
    
  
}
int get_distance(int x, int y){
map<char,int>m1;
map<char,int>m2;
int count=0;
   for(int so=x;so<=y;so++){
       if(A[so]!=B[so]){count++;}
   } 
   
   
   if(m1['T']==m2['T']&&m1['A']==m2['A']&&m1['C']==m2['C']){return max(0,count-1);}
   else return -1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...