#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
int n;
cin>>n;
vector<int> st1 , st2;
vector<int> vv;
for(int i=0;i<n;i++) {
int x;cin>>x;
st1.push_back(x);
vv.push_back(x);
}
sort(vv.begin(),vv.end());
vector<string> ans;
while(st1.size()){
if(st1.back() == vv.back()){
ans.push_back("UZMI L L");
st1.pop_back();
}
else {
ans.push_back("UZMI D L");
ans.push_back("STAVI D D");
st2.push_back(st1.back());
st1.pop_back();
}
}
ans.push_back("STAVI L L");
int tar = vv.size();
tar -= 2;
while(tar){
if(st2.back() == vv[tar]){
ans.push_back("UZMI L D");
st2.pop_back();
while(st1.size()){
ans.push_back("UZMI D L");
ans.push_back("STAVI D D");
st2.push_back(st1.back());
st1.pop_back();
}
ans.push_back("STAVI L L");
tar --;
}
else {
ans.push_back("UZMI D D");
ans.push_back("STAVI D L");
st1.push_back(st2.back());
st2.pop_back();
}
}
cout<<ans.size()<<endl;
for(auto i : ans) cout<<i<<endl;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
992 KB |
Execution killed with signal 6 |
2 |
Runtime error |
1 ms |
992 KB |
Execution killed with signal 6 |
3 |
Runtime error |
1 ms |
992 KB |
Execution killed with signal 6 |
4 |
Incorrect |
1 ms |
992 KB |
Wrong configuration |
5 |
Incorrect |
1 ms |
1144 KB |
Wrong configuration |
6 |
Runtime error |
1 ms |
996 KB |
Execution killed with signal 6 |
7 |
Runtime error |
2 ms |
1500 KB |
Execution killed with signal 6 |
8 |
Incorrect |
1 ms |
992 KB |
Wrong configuration |
9 |
Incorrect |
1 ms |
736 KB |
Wrong configuration |
10 |
Incorrect |
1 ms |
992 KB |
Wrong configuration |