# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
388445 | phathnv | Knjige (COCI20_knjige) | C++11 | 6 ms | 1608 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 107;
int n, a[N];
vector<string> ans;
void Move(int x){
for(int i = 1; i < x; i++){
ans.push_back("UZMI L L");
ans.push_back("STAVI L D");
}
ans.push_back("UZMI D L");
for(int i = 1; i < x; i++){
ans.push_back("UZMI L D");
ans.push_back("STAVI L L");
}
ans.push_back("STAVI D L");
for(int i = x; i > 1; i--)
swap(a[i], a[i - 1]);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= n; i++){
int p = max_element(a + i, a + 1 + n) - a;
Move(p);
}
cout << ans.size() << '\n';
for(string s : ans)
cout << s << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |