Submission #881024

#	Time	Username	Problem	Language	Result	Execution time	Memory
881024		HossamHero7	Knjige (COCI20_knjige)	C++14	25 / 50	2 ms	988 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
    int n;
    cin>>n;
    deque<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.front() == vv.back()){
            ans.push_back("UZMI L L");
            st1.pop_front();
        }
        else {
            ans.push_back("UZMI D L");
            ans.push_back("STAVI D D");
            st2.push_front(st1.front());
            st1.pop_front();
        }
    }
    ans.push_back("STAVI L L");
    int tar = vv.size();
    tar -= 2;
    while(tar>=0){
        if(st2.front() == vv[tar]){
            ans.push_back("UZMI L D");
            st2.pop_front();
            while(st1.size()){
                ans.push_back("UZMI D L");
                ans.push_back("STAVI D D");
                st2.push_front(st1.front());
                st1.pop_front();
            }
            ans.push_back("STAVI L L");
            tar --;
        }
        else {
            ans.push_back("UZMI D D");
            ans.push_back("STAVI D L");
            st1.push_front(st2.front());
            st2.pop_front();
        }
    }
    assert(ans.size() <= 2 * (n*n));
    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;
}

• Subtask 1: 25 / 50