CF 525B Pasha and String
2015-03-30 20:36
260 查看
B. Pasha and String
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Output
In the first line of the output print what Pasha's string
s will look like after m days.
Sample test(s)
Input
Output
Input
Output
Input
Output
解析
所有的变换都是关于中心的镜像对称,然后显然变换的顺序和结果无关,那么我只用知道一个点被翻转的次数的奇偶性。
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Output
In the first line of the output print what Pasha's string
s will look like after m days.
Sample test(s)
Input
abcdef 1 2
Output
aedcbf
Input
vwxyz 2 2 2
Output
vwxyz
Input
abcdef 3 1 2 3
Output
fbdcea
解析
所有的变换都是关于中心的镜像对称,然后显然变换的顺序和结果无关,那么我只用知道一个点被翻转的次数的奇偶性。
#include<iostream> #include<string> #include<algorithm> using namespace std; string s; int M,Q[100100],B[100100]; int main() { //std::ios::sync_with_stdio(false); cin >>s >>M; int len=s.size(); for(int i=1;i<=M;i++) { int a; cin >>a; B[min(a,len-a+1)-1]++; } for(int i=1;i<(len+1)>>1;i++) B[i]+=B[i-1]; for(int i=0;i<(len+1)>>1;i++) if(B[i]&1) swap(s[i],s[len-i-1]); cout <<s<<endl; return 0; }
相关文章推荐
- ARC下OC对象和CF对象之间的桥接(bridge)
- CF 585B Phillip and Trains(预处理+BFS)
- cf 3a Shortest path of the king
- cf 17a Noldbach problem
- cf(找规律,模拟)
- iOS之CF和OC之间类型转换
- ARC下OC对象和CF对象之间的架桥
- cf(打磨你)(大模拟)
- cf B. Wilbur and Array
- CF - Profact(DFS + 剪枝)
- 论弱逼的自我修养——2014集训队CF试题泛做
- CF 600E(Lomsat gelral-dfs)
- CF 335 div.2-B/606B Testing Robots(读不懂题系列)
- ARC下OC对象和CF对象之间的桥接(bridge)
- [__NSCFString containsString:]: unrecognized selector sent to instance 0x17d68490
- CF Good Bye 2015 F. New Year and Cleaning(思维)
- CF Dinner with Emma 616B
- Guess Your Way Out! II---cf 558D (区间覆盖,c++STL map 的使用)
- cf-A. Wet Shark and Odd and Even(水)
- CF Round#343(2)-B-暴力求解