#include "bits/stdc++.h"
using namespace std;
#define endl '\n'
using lint = long long;
using pii = pair<int,int>;
constexpr int maxn = 2e5+5;
constexpr int inf = 2e9;
constexpr int mod = 1e9+7;
int n, a[maxn];
vector<string> v;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
do {
int mx = max_element(a, a + n) - a;
for(int i = 0; i < mx; i++) {
v.push_back("UZMI L L");
v.push_back("STAVI L D");
}
v.push_back("UZMI D L");
for(int i = mx + 1; i < n; i++) {
v.push_back("UZMI L L");
v.push_back("STAVI L D");
}
v.push_back("STAVI D L");
for(int i = 0; i < n - 1; i++) {
v.push_back("UZMI L D");
v.push_back("STAVI L L");
}
for(int i = mx + 1; i < n; i++)
swap(a[i - 1], a[i]);
} while(--n);
cout << v.size() << endl;
for(auto& s : v)
cout << s << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1484 KB |
Output is correct |
2 |
Correct |
2 ms |
1484 KB |
Output is correct |
3 |
Correct |
3 ms |
1484 KB |
Output is correct |
4 |
Correct |
2 ms |
1484 KB |
Output is correct |
5 |
Correct |
2 ms |
1484 KB |
Output is correct |
6 |
Correct |
3 ms |
1484 KB |
Output is correct |
7 |
Correct |
2 ms |
1484 KB |
Output is correct |
8 |
Correct |
2 ms |
1484 KB |
Output is correct |
9 |
Correct |
2 ms |
1484 KB |
Output is correct |
10 |
Correct |
2 ms |
1484 KB |
Output is correct |