Submission #405667

#TimeUsernameProblemLanguageResultExecution timeMemory
405667souvenir_vayneKnjige (COCI20_knjige)C++14
0 / 50
34 ms520 KiB
#include<bits/stdc++.h> using namespace std; int32_t main() { int n; cin >> n; long long ans = 0; for(int i = 0; i < n; i++) ans += 2 * (n - i) + 2*(n - i - 1); cout << ans << endl; stack<int> left, right; for(int i = 0; i < n; i++) { int x; cin >> x; left.push(x); } int did = 0; while(did < n) { stack<int> aux; int mn = INT_MAX; while(!left.empty()) { mn = min(mn, left.top()); aux.push(left.top()); left.pop(); } left = aux; bool taken = false; for(int i = 0; i < n - did; i++) { if(left.top() == mn && !taken) { taken = true; cout << "UZMI L L" << endl; } else { cout << "UZMI D L" << endl << "STAVI D D" << endl; right.push(left.top()); } left.pop(); } did++; cout << "STAVI L L" << endl; while(!right.empty()) { cout << "UZMI D D" << endl << "STAVI D L" << endl; left.push(right.top()); right.pop(); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...