Submission #1141895

#TimeUsernameProblemLanguageResultExecution timeMemory
1141895samiaMutating DNA (IOI21_dna)C++20
21 / 100
30 ms2376 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 x, int y) {
  int ans;
  map<char,int>m;
    map<char,int>m1;
 
      ans=0;
      for(int so=x;so<=y;so++){
          if(A[so]!=B[so]){ans++;m[A[so]]+=1;m1[B[so]]+=1;}
      }
      if(m1['A']==m['A']&&m1['C']==m['C']&&m1['T']==m['T']){
         
          return max(0,ans-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...