# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006492 | vjudge1 | Knjige (COCI20_knjige) | C++17 | 26 ms | 1492 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;
const int N = 105;
vector<int> a;
string space = " ", take = "UZMI", put = "STAVI", lft = "L", rht = "D";
vector<string> sol;
int n;
void SORT(vector<int> v)
{
//cerr << v.size() << endl;
//for(auto x : v)
//cout << x << ' ';
//cout << endl;
if(v.size() <= 1) return;
vector<int> vp;
int l = v.back();
sol.push_back(take + space + lft + space + rht);
for(int j = v.size() - 2; j >= 0; j--)
{
sol.push_back(take + space + rht + space + rht);
int r = a[j];
if(l > r)
{
vp.push_back(l);
sol.push_back(put + space + lft + space + lft);
sol.push_back(put + space + rht + space + lft);
sol.push_back(take + space + lft + space + lft);
l = r;
}
else
{
vp.push_back(r);
sol.push_back(put + space + rht + space + lft);
}
}
for(int i = 0; i < vp.size(); i++)
{
sol.push_back(take + space + rht + space + lft);
sol.push_back(put + space + rht + space + rht);
}
sol.push_back(put + space + lft + space + lft);
reverse(vp.begin(), vp.end());
SORT(vp);
}
int main()
{
cin >> n;
a.resize(n);
for(int i = 0; i < n; i ++)
cin >> a[i];
for(int i = 0; i < n; i ++)
{
sol.push_back(take);
sol.back() += space + lft + space + lft;
sol.push_back(put);
sol.back() += space + lft + space + rht;
}
SORT(a);
cout << sol.size() << endl;
for(auto s : sol)
cout << s << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |