Submission #1142077

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142077		joker	Mutating DNA (IOI21_dna)	C++17	0 / 100	1595 ms	2116 KiB

dna

#include "dna.h"
#include <unordered_set>
#include <unordered_map>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <iomanip>
#include <numeric>

using namespace std;
string ast;
string bst;

void init(std::string a, std::string b) {
    ast = a;
    bst = b;
}

int get_distance(int x, int y) {
    string sl = ast.substr(x,y-x+1);
    string sr = bst.substr(x,y-x+1);

    string t1 = sl;
    string t2 = sr;
    sort(t1.begin(),t1.end());
    sort(t2.begin(),t2.end());
    if (t1 == t2) {
        int ans = 0;
        int i = 0;
        while (sl != sr) {
            if (sl[i] == sr[i]) {
                i++;
            } else {
                char sw;
                for (size_t j = i+1;j < y-x+1;j++){
                    if (sl[j] == sr[i] && sr[j] != sl[j] && sr[j] == sl[i]) {
                        sw = sl[j];
                        break;
                    }else if (sl[j] == sr[i] && sr[j] != sl[j]) {
                        sw = sl[j];
                    }
                }
                ans++;
            }
        }
        return ans;
    }
	return -1;
}

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