oj.uz

Submission #872518

# Submission time Handle Problem Language Result Execution time Memory
872518 2023-11-13T09:24:34 Z Onur_Ilgaz Knjige (COCI20_knjige) C++17
0 / 50
 3 ms 1496 KB 
#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++) {
		int to = lower_bound(order.begin(), order.end(), arr[i]) - order.begin();
		for(int j = n - 1; j > i; j--) {
			output.push_back("UZMI L L\n");
			output.push_back("STAVI L D\n");
		} // iden büyük bütün kitaplar sağ rafta
		output.push_back("UZMI D L\n"); // i. nesneyi sağ ele aldık
		for(int j = i; j < n; j++) {
			if(j == to) {
				output.push_back("STAVI D L\n");
			}
			else {
				output.push_back("UZMI L D\n");
				output.push_back("STAVI L L\n");
			}
		}
	}
	cout << output.size() << "\n";
	for(auto &it:output) {
		cout << it;
	}
}

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1496 KB No book to take
2 Incorrect 3 ms 1492 KB No book to take
3 Incorrect 2 ms 1496 KB No book to take
4 Incorrect 2 ms 1496 KB No book to take
5 Incorrect 2 ms 1496 KB No book to take
6 Incorrect 1 ms 1496 KB No book to take
7 Incorrect 2 ms 1496 KB No book to take
8 Incorrect 2 ms 1492 KB No book to take
9 Incorrect 2 ms 1492 KB No book to take
10 Incorrect 2 ms 1496 KB No book to take