Codeforces Round #297 (Div. 2) B. Pasha and String

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 300005
#define eps 1e-3
#define mod 9999677
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
//head

char s[maxn];
int a[maxn];
int n;

int cmp(int a, int b)
{
return a > b;
}

void work()
{
scanf("%s%d", s+1, &n);
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
int len = strlen(s+1);
sort(a, a+n, cmp);
int last = len/2, x;
for(int i = 0; i < n; i++) {
int x = a[i];
if(i != n-1 && a[i] == a[i+1]) {
i++;
continue;
}
if(((n - i) & 1) == 1) for(int j = last; j >= x; j--) swap(s[j], s[len-j+1]);
last = x-1;
}
puts(s+1);

}

int main()
{
work();

return 0;
}