# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006454 | vjudge1 | Knjige (COCI20_knjige) | C++17 | 26 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;
while (cur >= 0){
int placed = 0;
vector<int> tmp;
bool taken = 0;
for (int i = 0; i <= cur; i ++){
if (d[i] == a[cur] and !taken){
taken = 1;
vec.push_back({"UZMI", {'L', 'L'}});
}
else{
vec.push_back({"UZMI", {'R', 'L'}});
vec.push_back({"STAVI", {'R', 'R'}});
tmp.push_back(d[i]);
placed++;
}
}
vec.push_back({"STAVI", {'L', 'L'}});
while (placed){
placed--;
vec.push_back({"UZMI", {'R', 'R'}});
vec.push_back({"STAVI", {'R', 'L'}});
}
d[cur] = a[cur];
for (int i = 0; i < cur; i ++)
d[i] = tmp[i];
cur--;
}
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... |