# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006578 | vjudge1 | Knjige (COCI20_knjige) | C++17 | 28 ms | 1624 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;
int main(){
int n;
cin >> n;
int a[n], d[n];
for (int i = 0; i < n; i ++)
cin >> d[i], a[i] = d[i];
sort(a, a + n);
int cur = n - 1;
int done = 0;
vector<pair<string, pair<char, char>>> vec;
stack<int> left, right;
for (int i = 0; i < n; i ++)
left.push(d[i]);
while (cur >= 0){
int l = -1, r = -1;
bool taken = 0;
while (left.size() != done){
int b = left.top();
left.pop();
if (b == a[cur] and !taken){
taken = 1;
l = b;
vec.push_back({"UZMI", {'L', 'L'}});
}
else{
r = b;
vec.push_back({"UZMI", {'R', 'L'}});
vec.push_back({"STAVI", {'R', 'R'}});
right.push(r);
r = -1;
}
}
vec.push_back({"STAVI", {'L', 'L'}});
left.push(l);
l = -1;
while (right.size()){
int b = right.top();
right.pop();
r = b;
vec.push_back({"UZMI", {'R', 'R'}});
left.push(r);
r = -1;
vec.push_back({"STAVI", {'R', 'L'}});
}
cur--;
done++;
}
// for (int i = 0; i < n; i ++)
// cout << d[i] << " ";
// cout << endl;
cout << vec.size() << endl;
for (auto [s, P] : vec){
auto [x, y] = P;
cout << s << " " << x << " " << y << endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |