제출 #1006449

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006449		vjudge1	Knjige (COCI20_knjige)	C++17	0 / 50	45 ms	4052 KiB

Main

#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 < n - done; 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;
    }
}

• Subtask 1: 0 / 50