Submission #1001595

#TimeUsernameProblemLanguageResultExecution timeMemory
1001595vjudge1Mutating DNA (IOI21_dna)C++17
0 / 100
21 ms4692 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define pf push_front
#define pi pair<int,int>

string a,b;
const int MAX = 1e5+1;
int n;
 ll pref[MAX], wrong[MAX];

void init(string A, string B){
    a = A;
    b = B;
}


int get_distance(int x, int y){
    ll add = 0;
    ll sub = 0;
     map<char,int>mp;
     for(int i = x; i< y; i++){
    
        pref[i]= pref[i-1]+1;
        //cout << a[i]<<" " << b[i]<<endl;
       if(a[i]!=b[i]){
           add++;
           if(mp[a[i]]){
                sub++;
                mp[a[i]]--;
           }
    
             mp[b[i]]++;
       }
         
    }
    return add-sub;
}


#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...