Submission #1178980

#TimeUsernameProblemLanguageResultExecution timeMemory
1178980asli_bgKnjige (COCI20_knjige)C++20
0 / 50
178 ms32664 KiB
#include<bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; #define int long long //#define int double typedef pair<int,int> pii; typedef vector<pii> vii; typedef vector<int> vi; typedef vector<bool> vb; #define FOR(i,a) for(int i=0;i<(a);i++) #define FORE(i,a,b) for(int i=(a);i<(b);i++) #define all(x) x.begin(),x.end() #define fi first #define se second #define pb push_back #define sp <<" "<< #define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl; #define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl; #define DEBUG(x) cout<<#x sp x<<endl; #define carp(x,y) ((x%MOD)*(y%MOD))%MOD #define topla(x,y) ((x%MOD)+(y%MOD))%MOD #define mid (double)(l+r)/2 const int MAXN=5e4+5; const int INF=1e9+7; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n; cin>>n; vi d(n), a(n); FOR(i,n){ cin>>d[i]; a[i]=d[i]; } vi vec;//right shelf sort(all(a)); vector<vector<string>> ans; int p1=0; while(p1<n){ //p1 çift ise leftin hepsini righta al //righttan gelen min varsa onu koy //min olanı bir elinde tut //o mini lefte koy //p1 tek ise rightin hepsini lefte al //min olanı tut /*DEBUG(p1); cont(d); cont(a); cont(vec);*/ if(p1==0){ while(d.size()>p1){ if(d.back()!=a[p1]){ ans.pb({"UZMI","L","L"}); ans.pb({"STAVI","L","D"}); vec.pb(d.back()); } else{ ans.pb({"UZMI","D","L"}); } d.pop_back(); } ans.pb({"STAVI","D","L"}); } else{ while(vec.back()!=a[p1]){ ans.pb({"UZMI","D","D"}); ans.pb({"STAVI","D","L"}); d.pb(vec.back()); vec.pop_back(); } ans.pb({"UZMI","D","D"}); while(d.size()>p1-1){ ans.pb({"UZMI","L","L"}); ans.pb({"STAVI","L","D"}); vec.pb(d.back()); d.pop_back(); } ans.pb({"STAVI","D","L"}); } p1++; } cout<<ans.size()<<endl; for(auto el:ans){ for(auto el2:el){ cout<<el2<<' '; } cout<<endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...