Submission #1324100

#	Time	Username	Problem	Language	Result	Execution time	Memory
1324100		aritro_	Mutating DNA (IOI21_dna)	C++20	43 / 100	1594 ms	2900 KiB

dna

#include<bits/stdc++.h>
using namespace std;

#define all(a) a.begin(),a.end()

string s1,s2;
int preSum[100000 + 15];

int get_distance(int x,int y){
    string t1,t2;
    for(int i=x;i<=y;i++){
        t1+=s1[i];
        t2+=s2[i];
    }
    sort(all(t1));
    sort(all(t2));
    if(t1!=t2) return -1;
    //subtask 1
    if((y-x)<=2){
        int cnt=0;
        for(int i=x;i<=y;i++) cnt+=(s1[i]!=s2[i]);
        return (cnt+1)/2;
    }
    return (preSum[y+1]-preSum[x])/2;
}

void init(string a,string b){
    s1=a;
    s2=b;
    int n=a.size();
    for(int i=0;i<n;i++){
        preSum[i+1]=(a[i]!=b[i])+preSum[i];
    }
    return ;
}

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