#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e2 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nArr;
int a[MAX];
vector<string> ans;
void Move(int p){
int cnt = 0;
for (int i = 1; i < p; ++i){
ans.push_back("UZMI L L");
ans.push_back("STAVI L D");
}
ans.push_back("UZMI D L");
for (int i = 1; i < p; ++i){
ans.push_back("UZMI L D");
ans.push_back("STAVI L L");
}
ans.push_back("STAVI D L");
for (int i = p; i > 1; --i) swap(a[i], a[i - 1]);
}
void Whisper(){
cin >> nArr;
for (int i = 1; i <= nArr; ++i) cin >> a[i];
for (int i = 1; i <= nArr; ++i){
int p = max_element(a + i, a + nArr + 1) - a;
Move(p);
}
cout << (int)ans.size() << '\n';
for (string &s : ans) cout << s << '\n';
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
Compilation message
Main.cpp: In function 'void Move(long long int)':
Main.cpp:52:9: warning: unused variable 'cnt' [-Wunused-variable]
52 | int cnt = 0;
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1752 KB |
Output is correct |
2 |
Correct |
3 ms |
1752 KB |
Output is correct |
3 |
Correct |
4 ms |
1752 KB |
Output is correct |
4 |
Correct |
3 ms |
1748 KB |
Output is correct |
5 |
Correct |
3 ms |
1752 KB |
Output is correct |
6 |
Correct |
2 ms |
1752 KB |
Output is correct |
7 |
Correct |
3 ms |
1752 KB |
Output is correct |
8 |
Correct |
3 ms |
1752 KB |
Output is correct |
9 |
Correct |
3 ms |
1748 KB |
Output is correct |
10 |
Correct |
2 ms |
1748 KB |
Output is correct |