Submission #44507290

---

Source Code Expand

#include<bits/stdc++.h>
#include<atcoder/all>

using namespace std;
using namespace atcoder;
typedef long long ll;

#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,s,e) for(ll i=s;i<=e;++i)
#define FFOR(i,s,e) for(ll i=s;i>=e;--i)

#define yesno(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define ALL(a) (a).begin(),(a).end()
#define mp make_pair
#define pb push_back
#define vl vector<ll>
#define vs vector<string>
#define so(a) sort(a.begin(),a.end())

#define fi first
#define se second
#define print(a) cout<<a<<endl
#define ssize(a) (ll)(a.size())

#define MAX_N 1002
#define i197 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


const ll INF=1000000000000000001;
struct edge
{
	int to, cost;
};

struct pos{
	// 1 変数を入れる;
	ll t;
	ll x,y;
	set<ll> st;

};
int dx[4] = { 1, 0, -1, 0};
int dy[4] = { 0, 1, 0, -1};
int dd[5] = { 0, 1, 0, -1, 0};

typedef pair<ll, ll> P2;
typedef pair<pair<ll,ll>,ll> P3;
typedef pair<string,ll> Ps;
typedef pair<pair<ll,ll>,pair<ll,ll> > P4;



int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);

	ll n;
	cin>>n;

	vector<char> s(n+1);
	rep(i,n)cin>>s[i+1];

	ll q;
	cin>>q;
	vl l(n+1);
	vl t(q+1),x(q+1);
	vector<char> c(q+1);
	rep(i,q){
		cin>>t[i+1]>>x[i+1]>>c[i+1];
		if(t[i+1]==1)l[x[i+1]]=i+1;
	}

	ll d[q+5][2]={};
	d[q+1][0]=0;
	d[q+1][1]=1;
	FFOR(i,q,1){
		d[i][0]=d[i+1][0];
		d[i][1]=d[i+1][1];
		if(t[i]==2)d[i][0]=d[i+1][1];
		if(t[i]==3)d[i][1]=d[i+1][0];
	}
	d[0][0]=d[1][0];
	d[0][1]=d[1][1];

	string ans;
	FOR(i,1,n){
		char s2;
		if(l[i]==0)s2=s[i];
		else s2=c[l[i]];

		ll a=0;
		if(islower(s2))a=1;
		a=d[l[i]][a];
		if(a==0)ans+=toupper(s2);
		else ans+=tolower(s2);
	}
	print(ans);

	return 0;
}

Submission Info

Judge Result