# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
451989 | 2021-08-03T15:40:21 Z | PiejanVDC | Knjige (COCI20_knjige) | C++17 | 2 ms | 712 KB |
#include <bits/stdc++.h> using namespace std; signed main() { int n; cin>>n; vector<int>sorted(n); stack<int>l,r; for(int i = 0 ; i < n ; i++) { cin>>sorted[i]; l.push(sorted[i]); } vector<string>ans; // rechts ==> nemen // links ==> vasthouden int cnt=0; sort(sorted.rbegin(),sorted.rend()); bool f = true; for(int i = 0 ; i < n ; i++) { int t = sorted[i]; if(f) { for(int j = 0 ; j < n - i ; j++) { if(l.top() != t) r.push(l.top()), ans.push_back("UZMI D L\nSTAVI D D\n"),cnt+=2; else ans.push_back("UZMI L L\n"),cnt++; l.pop(); } ans.push_back("STAVI L L\n"); cnt++; l.push(t); f=false; } else { while(true) { if(r.top() == t) break; ans.push_back("UZMI D D\nSTAVI D L\n"); cnt+=2; l.push(r.top()); r.pop(); } ans.push_back("UZMI L D\n"); cnt++; r.pop(); while(l.size() > i) { r.push(l.top()); l.pop(); ans.push_back("UZMI D L\nSTAVI D D\n"); cnt+=2; } l.push(t); ans.push_back("STAVI L L\n"); cnt++; } } cout << cnt << "\n"; for(auto z : ans) cout << z; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 332 KB | Execution killed with signal 11 |
2 | Runtime error | 1 ms | 332 KB | Execution killed with signal 11 |
3 | Runtime error | 1 ms | 332 KB | Execution killed with signal 11 |
4 | Incorrect | 2 ms | 652 KB | Wrong configuration |
5 | Incorrect | 1 ms | 712 KB | Wrong configuration |
6 | Runtime error | 1 ms | 332 KB | Execution killed with signal 11 |
7 | Runtime error | 1 ms | 332 KB | Execution killed with signal 11 |
8 | Incorrect | 2 ms | 712 KB | Wrong configuration |
9 | Incorrect | 1 ms | 588 KB | Wrong configuration |
10 | Incorrect | 1 ms | 652 KB | Wrong configuration |