-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
64 lines (63 loc) · 1.39 KB
/
C.cpp
File metadata and controls
64 lines (63 loc) · 1.39 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include<bits/stdc++.h>
#define vi vector<int>
#define ma map<int,int>
#define uma unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t;cin>>t; while(t--)
#define mp make_pair
#define pr pair<int,int>
using namespace std;
/*************************************************************************************************/
void solve()
{
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,x,a,b,q,t;
string s;
cin>>n>>s>>q;
string s1,s2,s3,s4;
s1=s;
bool tog=0;
while (q--)
{
cin>>t>>a>>b;
if(t==2)
{
tog=!tog;
}
else
{
if(tog)
{
if(a<=n)
a+=n;
else
a-=n;
if(b<=n)
b+=n;
else
b-=n;
}
char c=s1[a-1];
s1[a-1]=s1[b-1];
s1[b-1]=c;
//cout<<a<<' '<<b<<' '<<s1<<' '<<endl;
}
}
//cout<<s1<<endl;
s2=s1.substr(0,n);
s3=s1.substr(n);
if(tog)
s1=s3+s2;
cout<<s1;
return 0;
}