Merkkijono

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

using namespace std;

vector<int> lst;
vector<int> oper;

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

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);
	}
	
	int k = 0;
	
	while (!sorted()) {
		k++;
		if (lst[0] > lst[1]) {
			int f = lst[1]; lst[1] = lst[0]; lst[0] = f;
			oper.push_back(0);
		} else {
			int last = lst[25];
			lst.pop_back();
			lst.insert(lst.begin(), last);
			oper.push_back(1);
		}
	}
	
	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: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED