Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.
Pasha didn't like his present very much so he decided to change it. After his birthday Pasha spent m days performing the following transformations on his string — each day he chose integer ai and reversed a piece of string (a segment) from position ai to position |s| - ai + 1. It is guaranteed that 2·ai ≤ |s|.
You face the following task: determine what Pasha's string will look like after m days.
Input
The first line of the input contains Pasha's string s of length from 2 to 2·105 characters, consisting of lowercase Latin letters.
The second line contains a single integer m (1 ≤ m ≤ 105) — the number of days when Pasha changed his string.
The third line contains m space-separated elements ai (1 ≤ ai; 2·ai ≤ |s|) — the position from which Pasha started transforming the string on the i-th day.
OutputIn the first line of the output print what Pasha's string s will look like after m days.
Examplesabcdef 1 2
aedcbf
vwxyz 2 2 2
vwxyz
abcdef 3 1 2 3
fbdcea
思路是去确定每个对称的位置最后的交换情况,比如第三个样例,第一次换会对第二次,第三次影响,第二次换会对第三次影响。那么第三次一共被换三次,是奇数,于是交换,第二次一共被换两次,是偶数,于是不换。第一次是奇数,要换。
代码:
#include"iostream"
#include"algorithm"
#include"cstring"
using namespace std;
char a[200005];
int main()
{
while(cin >> a)
{
int b[100005]={0};
int m;
int l=strlen(a);
cin >> m;
for(int i = 0;i <m;i ++)
{
int h;
cin >> h;
b[h-1]++;
}
int sum = 0;
for(int i = 0;i < l/2;i ++)
{
sum+=b[i];
if(sum%2==1)
{
swap(a[i],a[l-i-1]);
}
// cout<<"i="<<i<<" sum="<<sum<<endl;
}
cout<<a<<endl;
}
return 0;
}