Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*Rofyda Mohamed Hamed Hamed Elghadban*/
- //#include <bits/stdc++.h>
- #include <iostream>
- #include <iomanip>
- #include <cmath>
- #include <algorithm>
- #include <cstdlib>
- #include <limits.h>
- #include <string>
- #include <vector>
- #include <map>
- #include <stack>
- #include <set>
- #include <deque>
- #include <fstream>
- #include <bitset>
- #include <cmath>
- #include <numeric>
- #include <cstring>
- #include <utility>
- #include <queue>
- /***********************************************************************************/
- #define ll long long
- #define ull unsigned long long
- #define pi 3.141592654
- #define NUM 1e18
- #define Mod 1'000'000'007
- #define fixed(n) fixed<<setprecision(n)
- #define cin(v) for(auto &i:v) cin >> i ;
- #define cout(v) for(auto &i:v) cout << i <<" ";
- #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
- #define small(x) (x>=97&&x<=122)
- #define capital(x) (x>=65&&x<=90)
- #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
- #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
- #define all(v) ((v).begin()), ((v).end())
- #define allr(v) ((v).rbegin()), ((v).rend())
- #define updmax(a,b) a=max(a,b)
- #define updmin(a,b) a=min(a,b)
- #define ceil(a,b) ((a/b)+(a%b?1:0))
- /* asc -> 1 2 3 ,des -> 3 2 1 */
- /***********************************************************************************/
- using namespace std;
- void Rofyda_Elghadban(){
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- #endif
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- }
- void solve(){
- }
- int main(){
- Rofyda_Elghadban();
- //freopen("input.txt","r",stdin);
- //freopen("output.txt","r",stdout);
- int n,q;
- cin>>n>>q;
- vector<char>v(2*n);
- cin(v);
- deque<int>d;
- for(int i=0;i<v.size();i++){
- if(v[i]=='L'){
- d.push_front(v[i+1]);
- }else if(v[i]=='R'){
- d.push_back(v[i+1]);
- }
- }
- cout(d);
- map<int,vector<int>>mp;
- for(int i=0;i<d.size();i++){
- mp[d[i]].push_back(i);
- }
- while(q--){
- int num;
- cin>>num;
- for(int j=0;j<mp[num].size();j++){
- if(mp[num][j]<n/2){
- cout<<"Left"<<"\n";
- }else{
- cout<<"Right"<<"\n";
- }
- }cout<<"\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement