# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872526 | Onur_Ilgaz | Knjige (COCI20_knjige) | C++17 | 2 ms | 1496 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>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;
int32_t main(){
fast
int n;
cin >> n;
vector <int> arr(n), order;
for(int i = 0; i < n; i++) {
cin >> arr[i];
order.push_back(arr[i]);
}
sort(order.begin(), order.end());
vector<string> output;
for(int i = 0; i < n; i++) {
// i şimdiye kadar silinen eleman sayısı aynı zamanda
int eleman = order[i];
int from;
for(int j = 0; j < arr.size(); j++) {
if(arr[j] == eleman) {
from = j;
break;
}
}
if(!from) {
arr.erase(arr.begin() + from);
continue;
}
// to = i
for(int i = 0; i < arr.size(); i++) {
if(i == from) {
output.push_back("ULMI D L\n");
}
else {
output.push_back("ULMI L L\n");
output.push_back("STAVI L D\n");
}
}
output.push_back("STAVI D L\n");
for(int i = 0; i < arr.size() - 1; i++) {
output.push_back("ULMI L D\n");
output.push_back("STAVI L L\n");
}
arr.erase(arr.begin() + from);
}
cout << output.size() << "\n";
for(auto &it:output) {
cout << it;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |