Merkkijono

#include <iostream>
#include <string>
#include <vector>

using namespace std;

vector<int> lst;
vector<int> oper;
int k = 0;
#define N 26
bool popped = false;

void printLst() {
	for (int i = 0; i < (int)lst.size(); i++) {
		cout << lst[i] << " ";
	}
	cout<<"\n";
}

bool sorted() {
	for (int i = 0; i < (int)lst.size()-1; i++) {
		if (lst[i] > lst[i + 1]) return false;
	}
	return true;
}
int ab(int a, int b) {
	return (a<b)?(b-a):(a-b);
}

void sw() {
	int f = lst[1]; lst[1] = lst[0]; lst[0] = f;
	oper.push_back(0);
	k++;
	//cout << "Swap: ";
	//printLst();
}
void mov() {
	int last = lst[N - 1];
	lst.pop_back();
	lst.insert(lst.begin(), last);
	oper.push_back(1);
	k++;
	//cout << "Move: ";
	//printLst();
}
int findIndex(int x) {
	for (int i = 0; i < N; i++) {
		if (lst[i] == x) return i;
	}
	return -1;
}
void moveTo(int x, int to) {
	int loc = findIndex(x);
	int passBy = loc - to;
	while (lst[0] != x) mov();
	// x ...
	// moveTo(4, 1)
	// 1 [2 3] 4 5  [...] passBy
	// 1 4 2 3 5
	// now: 4 5 1 2 3
	// Let the bypassers through.
	for (int i = 0; i < passBy; i++) {
		mov(); sw();
	}
	while (lst[to] != x) mov();
}

int main()
{
	string s; cin >> s;
	for (int i = 0; i < (int)s.size(); i++) {
		char c = s[i];
		lst.push_back((int)c - 65);
		//cout<<((int)c-65)<<" ";
	}
	//cout<<"\n";
	
	int pos = 0;
	for (int i = 0; i <= N - 1; i++) {
		moveTo(i, pos);
		if (sorted()) break;
		pos++;
	}
	//printLst();
	
	cout << k << "\n";
	for (int i = 0; i < (int)oper.size(); i++) {
		if (lst[i] == 0) cout << "SWAP\n";
		else cout << "MOVE\n";
	}
	
	
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER