863D - Yet Another Array Queries Problem - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define Yes cout<<"YES\n"
#define No  cout<<"NO\n"
#define all(a) a.begin(),a.end()
#define pb push_back
#define endl '\n'
//#define int ll
const ll mod=1e9+7;const int M=2e5+5;const int N=2e5+5;
int dx[] = {-1, 1, 0, 0};int dy[] = {0, 0, -1, 1};
struct node
{
    int op,l,r;
};
void solve()
{
	int n,q,m;cin>>n>>q>>m;
	vector<int> a(n+1,0);
	for(int i=1;i<=n;i++) cin>>a[i];
	vector<node> opp;
	while(q--)
    {
        node tmp;cin>>tmp.op>>tmp.l>>tmp.r;
        opp.pb(tmp);
    }
    reverse(all(opp));
    while(m--)
    {
        int pos;cin>>pos;
        for(auto x:opp)
        {
            if(x.op==1&&x.l<=pos&&x.r>=pos)
            {
                if(pos>x.l) pos--;
                else pos=x.r;
            }
            else if(x.op==2&&x.l<=pos&&x.r>=pos)
            {
                pos=x.l+x.r-pos;
            }
        }
        cout<<a[pos]<<endl;
    }
}
signed main()
{
	ios::sync_with_stdio(0);cin.tie(0);
	int __;
	__=1;
	//cin>>__;
	while(__--)
	{
	solve();
	}
}