# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006568 | 2024-06-24T03:31:53 Z | vjudge1 | Knjige (COCI20_knjige) | C++17 | 31 ms | 1492 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long int const N=5e5+5; int const mod=1e9+7; int main(){ int n; cin>>n; stack<int> lst,rst; for(int i=0;i<n;i++){ int a; cin>>a; lst.push(a); } vector<string> move; for(int i=0;i<n;i++){ int rh=-1; while(lst.size()>i){ if(rh==-1){ //take the book on top of left in your rh move.push_back("UZMI D L"); rh=lst.top(); lst.pop(); } else if(rh<lst.top()){ //put rh book on top of right. move.push_back("STAVI D D"); rst.push(rh); //take the book from top of left in your rh move.push_back("UZMI D L"); rh=lst.top(); lst.pop(); } else{ rst.push(lst.top()); //take the book from top of left in your lh move.push_back("UZMI L L"); lst.pop(); //put lh book on top of right. move.push_back("STAVI L D"); } } //place book in your rh on top of left move.push_back("STAVI D L"); lst.push(rh); while(!rst.empty()){ lst.push(rst.top()); //take book in your lh from top of right move.push_back("UZMI L D"); rst.pop(); //place book in your lh on top of left. move.push_back("STAVI L L"); } } cout<<move.size()<<endl; for (string s:move) cout<<s<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 1488 KB | Wrong configuration |
2 | Incorrect | 20 ms | 1492 KB | Wrong configuration |
3 | Incorrect | 21 ms | 1488 KB | Wrong configuration |
4 | Incorrect | 27 ms | 1492 KB | Wrong configuration |
5 | Incorrect | 20 ms | 1492 KB | Wrong configuration |
6 | Incorrect | 21 ms | 1492 KB | Wrong configuration |
7 | Incorrect | 21 ms | 1492 KB | Wrong configuration |
8 | Incorrect | 21 ms | 1492 KB | Wrong configuration |
9 | Incorrect | 31 ms | 1488 KB | Wrong configuration |
10 | Incorrect | 21 ms | 1488 KB | Wrong configuration |