Submission #996756

#TimeUsernameProblemLanguageResultExecution timeMemory
996756overwatch9Mutating DNA (IOI21_dna)C++17
0 / 100
49 ms3664 KiB
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string A, B;
void init(std::string a, std::string b) {
	A = a;
	B = b;
}

int get_distance(int x, int y) {
	string a = A.substr(x, y - x + 1);
	string b = B.substr(x, y - x + 1);
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	if (a != b)
		return -1;
	a = A.substr(x, y - x + 1);
	b = B.substr(x, y - x + 1);
	vector <set <int>> pos(26);
	for (int i = 0; i < y - x + 1; i++) {
		pos[b[i] - 'A'].insert(i);
	}
	ll ans = 0;
	for (int i = 0; i < y - x + 1; i++) {
		int j = *pos[a[i] - 'A'].begin();
		ans += abs(j - i);
		cout << "J: " << j << '\n';
		pos[b[i] - 'A'].erase(pos[b[i] - 'A'].begin());
        if (i != j)
		    pos[b[j] - 'A'].erase(pos[b[j] - 'A'].begin());
		if (i != j)
			pos[b[i] - 'A'].insert(j);
        swap(b[i], b[j]);
	}
	return ans;
}

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