Submission #1001626

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001626		vjudge1	Mutating DNA (IOI21_dna)	C++17	43 / 100	1552 ms	3932 KiB

dna

#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;
     string k = a.substr(x,y-x+1);
     string h= b.substr(x,y-x+1);
     sort(k.begin(),k.end());
     sort(h.begin(),h.end());
     if(h!=k){
        return -1;
     }
     for(int i = x; i<= y; i++){
       if(a[i]!=b[i]){
           add++;
           if(mp[a[i]]){
                sub++;
                mp[a[i]]--;
           }
           else mp[b[i]]++;
    
            
       }
         
    }
    //cout << add<<" "<<sub<< " "<< endl;
    return add-sub;
}

• Subtask 1: 21 / 21
• Subtask 2: 22 / 22
• Subtask 3: 0 / 13
• Subtask 4: 0 / 28
• Subtask 5: 0 / 16