input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
print((a[n//2]-a[n//2-1]))
|
n=int(eval(input()));l=sorted(map(int,input().split()));print((l[n//2]-l[n//2-1]))
|
p02989
|
from collections import Counter
N = int(eval(input()))
d = Counter(list(map(int, input().split())))
ans = 0
l, r = 0, N
for K in range(10**5+1):
if l == r:
ans += 1
l += d[K]
r -= d[K]
print(ans)
|
N = int(eval(input()))
d = sorted(list(map(int, input().split())), reverse=True)
print((d[N//2-1] - d[N//2]))
|
p02989
|
N = int(eval(input()))
L = list(int(i) for i in input().split())
n = N//2
cnt = 0
data = sorted(L)
data1 = data[:n]
data2 = data[n:]
for i in range(100000):
if max(data1) < i and i <= min(data2):
cnt += 1
print(cnt)
|
N = int(eval(input()))
L = list(int(i) for i in input().split())
n = N//2
data = sorted(L)
data1 = data[:n]
data2 = data[n:]
print((min(data2) - max(data1)))
|
p02989
|
n = int(eval(input()))
d_lis = [int(d) for d in input().split()]
cnt = 0
ans = 0
for i in range(max(d_lis)+1):
cnt += d_lis.count(i)
if cnt == n // 2:
ans += 1
print(ans)
|
n = int(eval(input()))
d_lis = list(map(int,input().split()))
li = sorted(d_lis)
mid = n // 2
print((li[mid] - li[mid-1]))
|
p02989
|
n = int(eval(input()))
d = [int(i) for i in input().split()]
c = 0
for k in range(1,max(d)+1):
arc = []
abc = []
for j in range(len(d)):
if d[j] >= k:
arc.append(d[j])
else:
abc.append(d[j])
if len(abc) == len(arc):
c += 1
print(c)
|
n = int(eval(input()))
d = [int(i) for i in input().split()]
d.sort()
ans = d[len(d)//2] - d[len(d)//2-1]
print(ans)
|
p02989
|
N=int(eval(input()))
d=list(map(int,input().split()))
n=0
for k in range(1,10**5+1):
m=0
for b in d:
if b<k:
m+=1
if m==N/2:
n+=1
print(n)
|
N=int(eval(input()))
d=sorted(list(map(int,input().split())))
print((d[int(N/2)]-d[int(N/2-1)]))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[n // 2] - d[n // 2 - 1]))
|
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
m = n // 2
print((a[m] - a[m - 1]))
|
p02989
|
n = int(eval(input()))
m = n//2
D = list(map(int, input().split()))
D.sort()
D.reverse()
if D[m-1] == D[m]:
print((0))
exit()
else:
print((D[m-1]-D[m]))
exit()
|
n = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
if D[n//2-1] == D[n//2]:
print((0))
else:
print((D[n//2] - D[n//2-1]))
|
p02989
|
a = int(eval(input()))
b = list(map(int,input().split()))
c = sorted(b)
print((c[int(0.5*a)]-c[int(0.5*a-1)]))
|
N = int(eval(input()))
D = sorted(map(int,input().split()))
print((max(0,D[N//2]-D[N//2-1])))
|
p02989
|
from bisect import bisect
N = int(eval(input()))
D = list(map(int,input().split()))
D.sort()
ans = 0
for i in range(10**5+5):
j = bisect(D, i)
if j==N//2:
ans += 1
elif j>N//2:
break
print(ans)
|
N = int(eval(input()))
D = list(map(int,input().split()))
D.sort()
print((D[N//2] - D[N//2-1]))
|
p02989
|
N = int(eval(input()))
d = sorted(list(map(int, input().split())))
ans = 0
for i in range(1,d[-1] + 1):
if sum(x <i for x in d) == N//2:
ans += 1
else:
pass
print(ans)
|
N = int(eval(input()))
d = sorted(list(map(int, input().split())))
print((d[N//2] - d[N//2 - 1]))
|
p02989
|
a=[]
i=1
k=1
l=0
rk=[]
bk=[]
a.append(int(eval(input())))
for x in input().split(" "):
a.append(int(x))
while k<=100000:
while i<=a[0]:
if a[i]>=k:
rk.append(a[i])
else:
bk.append(a[i])
i+=1
if len(rk)==len(bk):
l+=1
rk=[]
bk=[]
i=1
k+=1
print(l)
|
n=0
a=[]
i=1
ii=1
l=0
tasu=0
rk=[]
bk=[]
n=int(eval(input()))
for x in input().split(" "):
a.append(int(x))
a.sort()
print((a[int(len(a)/2)]-a[int(len(a)/2)-1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
ans = 0
start_num = d[int(n / 2 - 1)]
end_num = d[int(n / 2)]
ans = end_num - start_num
print(ans)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[n // 2] - d[n // 2 - 1]))
|
p02989
|
num_input = int(eval(input()))
input_arr = [int(x) for x in input().split()]
max_input = max(input_arr)
count = 0
for input_ in range(max_input):
first_arr = [s for s in input_arr if input_ < s]
second_arr = [s for s in input_arr if input_ >= s]
if len(first_arr) == len(second_arr):
count = count + 1
print(count)
|
num_input = int(eval(input()))
input_arr = [int(x) for x in input().split()]
max_input = max(input_arr)
count = 0
second_arr =[]
first_arr = []
sorted_arr = sorted(input_arr)
ans = sorted_arr[int(num_input/2)] - sorted_arr[int(num_input/2)-1]
print(ans)
|
p02989
|
def calculate(arr):
length = len(arr)
s1 = (length // 2) - 1
s2 = (length // 2)
if arr[s2] == arr[s1]:
return 0
else:
return arr[s2] - arr[s1]
def rank(arr):
lastIndex = len(arr) - 1
while lastIndex > 0:
for i in range(lastIndex):
if arr[i + 1] < arr[i]:
tmp = arr[i + 1]
arr[i + 1] = arr[i]
arr[i] = tmp
lastIndex = lastIndex - 1
return arr
N = int(eval(input()))
if N == 0:
result = 0
else:
arr = rank([int(s) for s in input().split(" ")])
result = calculate(arr)
print(result)
|
def calculate(arr):
length = len(arr)
s1 = (length // 2) - 1
s2 = (length // 2)
if arr[s2] == arr[s1]:
return 0
else:
return arr[s2] - arr[s1]
N = int(eval(input()))
if N == 0:
result = 0
else:
list = list([int(s) for s in input().split(" ")])
list.sort()
result = calculate(list)
print(result)
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
d = sorted(d)
min_ans = d[n//2-1]
max_ans = d[n//2]
print((max_ans - min_ans))
|
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)
print((a[n // 2] - a[n // 2 - 1]))
|
p02989
|
n = eval(input())
l = list(map(int,input().split()))
num =0
for i in range(max(l)+1):
s =0
u =0
for j in l:
if j <i:
s +=1
else:
u +=1
if s ==u:
num +=1
print(num)
|
n = eval(input())
l = list(map(int,input().split()))
m = sorted(l)
if len(m)%2!=0:
print((0))
else:
i = len(m)//2 -1
ans = m[i+1]-m[i]
print(ans)
|
p02989
|
N=int(eval(input()))
d=list(map(int, input().split()))
C=N//2
for x in reversed(list(range(1,N+1))):
for y in range(0,x-1):
if d[y]<d[y+1]:
t=d[y]
d[y]=d[y+1]
d[y+1]=t
if d[C]==d[C-1]:
print((0))
else:
print((d[C-1]-d[C]))
|
N=int(eval(input()))
d=list(map(int, input().split()))
C=N//2
d.sort()
if d[C]==d[C-1]:
print((0))
else:
print((d[C]-d[C-1]))
|
p02989
|
n = int(eval(input()))
d = sorted(list(map(int, input().split())))
ans = 0
for i in range(d[n//2-1]+1,d[n//2]+1):
ans +=1
print(ans)
|
n = int(eval(input()))
d = sorted(list(map(int, input().split())))
if d[n//2]==d[n//2 - 1]:
print((0))
else:
print((d[n//2]-d[n//2 - 1]))
|
p02989
|
x = int(eval(input()))
y = input().split()
for u in range(len(y)):
y[u] = int(y[u])
y = sorted(y)
count = 0
for i in range(max(y)):
a = [u for u in y if u > i]
if len(a) == int(len(y) / 2):
count += 1
print(count)
|
x = int(eval(input()))
y = input().split()
for u in range(len(y)):
y[u] = int(y[u])
y = sorted(y)
count = y[int(len(y) / 2)] - y[int((len(y) / 2)) - 1]
print(count)
|
p02989
|
#ABC132_C
N=int(eval(input()))
d=list(map(int,input().split()))
L=2
R=2*10**5
while 1:
#print('Lis',L)
#print('Ris',R)
k=int((L+R)/2)
#print('kis',k)
ABC_num=0
for i in range(len(d)):
if d[i]<k:
ABC_num+=1
#print('ABC_num_is',ABC_num)
if ABC_num==N/2:
k_start=k
break
elif (L+1)==R:
k_start=0
break
elif ABC_num<N/2:
L=k
else:
R=k
if k_start!=0:
k=k_start+1
while 1:
ABC_num=0
for i in range(len(d)):
if d[i]<k:
ABC_num+=1
if ABC_num==N/2:
k+=1
else:
k_r=k-1
break
k=k_start-1
while 1:
ABC_num=0
for i in range(len(d)):
if d[i]<k:
ABC_num+=1
if ABC_num==N/2:
k-=1
else:
k_l=k+1
break
#print('k_ris',k_r)
#print('k_lis',k_l)
print((k_r-k_l+1))
else:
print((0))
|
#ABC132_C
N=int(eval(input()))
d=list(map(int,input().split()))
d.sort()
ans=d[int(N/2)]-d[int(N/2-1)]
print(ans)
|
p02989
|
N=int(eval(input()))
D=[int(s) for s in input().split()]
D=sorted(D)
sum=[]
count=0
for i in reversed(list(range(len(D)))):
sum.append(D.pop(i))
if len(sum) == len(D):
Ans=len(sum)
break
for i in range(D[Ans-1],sum[Ans-1],1):
count+=1
print(count)
|
N=int(eval(input()))
d=[int(s) for s in input().split(" ")]
d.sort()
K=d[(N//2)]-d[(N//2)-1]
print(K)
|
p02989
|
N = int(eval(input()))
d_list = list(map(int, input().split()))
count = 0
for k in range(min(d_list), max(d_list) + 1):
ABC = 0
ARC = 0
for i in range(N):
if k > d_list[i]:
ABC += 1
else:
ARC += 1
if ABC > ARC:
break
elif ABC == ARC:
count += 1
else:
pass
print(count)
|
N = int(eval(input()))
d_list = list(map(int, input().split()))
d_list.sort()
k = d_list[int(N/2)]
count = 0
for i in range(N):
if count == int(N/2):
print((d_list[int(N/2)] - d_list[int(N/2)-1]))
break
elif k > d_list[i]:
count += 1
else:
pass
else: # kの候補の右端は必ずd_listの中
print((0))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
d = sorted(d)
l = []
now = 0
ans = 0
for i in range(n-1):
if d[i] != d[i+1]:
a = d.index(d[i])
b = d.count(d[i])
index = a+b-1
#print(index)
if index+1 == n/2:
#print(d[i+1], d[i])
ans = d[i+1]-d[i]
print(ans)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d = sorted(d)
print((d[int(n/2)]-d[int(n/2)-1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
ans=0
for k in range(1,d[-1]+1):
abc=[k>i for i in d]
arc=[k<=i for i in d]
if sum(arc)==sum(abc):
ans+=1
print(ans)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[n//2]-d[(n//2)-1]))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split(' ')))
c = 0
mid = (max(d) + min(d))//2
for i in range(mid//2, mid*2):
a = sum([1 for val in d if val < i])
b = sum([1 for val in d if val >= i])
if a == b:
c += 1
print(c)
|
N = int(eval(input()))
d = list(map(int, input().split(' ')))
d.sort()
print(( d[N//2] - d[N//2 - 1] ))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
cnt = 0
maxd = max(d)
mind = min(d)
for K in range(mind, maxd+1):
if len([i for i in d if i >= K]) == len([i for i in d if i < K]): cnt += 1
print(cnt)
|
N = int(eval(input()))
d = list(map(int, input().split()))
sor_d = sorted(d)
print((sor_d[int(N*0.5)]-sor_d[int(N*0.5)-1]))
|
p02989
|
import sys
input = sys.stdin.readline
inpl = lambda: list(map(int,input().split()))
N = int(eval(input()))
d = sorted(inpl())
if N % 2:
print((0))
else:
print((d[N//2]-d[N//2-1]))
|
print(((lambda N,d:((N+1)%2)*(d[N//2]-d[N//2-1]))(int(eval(input())),sorted(list(map(int,input().split()))))))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
"""
d = [9, 1, 4, 4, 6, 7]
#N = 8
N = 6
#d = [9, 1, 14, 5, 5, 4, 4, 14]
d = [9, 1, 4, 4, 6, 7]
"""
# prob
# [number,value]
prob = []
cnt = 0
for i in d:
prob.append([cnt, i])
cnt += 1
""" print(prob)
print(sorted(prob, key=lambda x: x[1]))
"""
sorted_d = sorted(prob, key=lambda x: x[1])
d_max = sorted_d[N-1][1]
d_min = sorted_d[0][1]
#print(d_min, d_max)
cnt = 0
for i in range(N):
""" print(sorted_d[0:i])
print(sorted_d[i:])
"""
if len(sorted_d[0:i]) == len(sorted_d[i:]):
""" print("True")
print(sorted_d[i][1])
print(sorted_d[i-1][1])
print(sorted_d[i][1] - sorted_d[i-1][1])
"""
cnt += sorted_d[i][1] - sorted_d[i-1][1]
# print("------")
print(cnt)
|
N = int(eval(input()))
d = list(map(int, input().split()))
"""
d = [9, 1, 4, 4, 6, 7]
#N = 8
N = 6
#d = [9, 1, 14, 5, 5, 4, 4, 14]
d = [9, 1, 4, 4, 6, 7]
"""
# prob
# [number,value]
prob = []
cnt = 0
for i in d:
prob.append([cnt, i])
cnt += 1
""" print(prob)
print(sorted(prob, key=lambda x: x[1]))
"""
sorted_d = sorted(prob, key=lambda x: x[1])
#print(d_min, d_max)
cnt = 0
# if len(sorted_d[0:i]) == len(sorted_d[i:]):
cnt += sorted_d[int(N/2)][1] - sorted_d[int(N/2-1)][1]
print(cnt)
|
p02989
|
import sys
import bisect
input = sys.stdin.readline
def main():
n=int(eval(input()))
d = list(map(int,input().split()))
cnt=0
d.sort()
a=d[0]
b=d[n-1]
c=b-a+1
for i in range(c):
index=bisect.bisect_right(d,i+a)
D=d[index:]
lend=len(D)
if(int(n//2)==lend):
cnt+=1
print(cnt)
main()
|
import sys
import bisect
input = sys.stdin.readline
def main():
n=int(eval(input()))
d = list(map(int,input().split()))
cnt=0
d.sort()
a=d[(n//2)-1]
b=d[(n//2)]
ans=b-a
print(ans)
main()
|
p02989
|
k=int(eval(input()))
d=sorted(list(map(int,input().split())))
ans=0
for i in range(d[int(len(d)/2)-1]+1,d[int(len(d)/2)]+1):
ans+=1
print(ans)
|
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
p=a[n//2-1]
q=a[n//2]
print((q-p))
|
p02989
|
n=int(eval(input()))
l=[int(s) for s in input().split()]
cnt=0
mx=max(l)
for i in range(1,mx+1):
k=i
arc=0
abc=0
for j in range(len(l)):
if l[j]>=k:
arc+=1
else:
abc+=1
if arc==abc:
cnt+=1
print(cnt)
|
n=int(eval(input()))
l=[int(s) for s in input().split()]
cnt=0
l.sort()
print((l[n//2]-l[n//2-1]))
|
p02989
|
N = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
if d[N//2-1] == d[N//2]:
print((0))
else:
print((d[N//2]-d[N//2-1]))
|
N = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[N//2]-d[N//2-1]))
|
p02989
|
N = int(eval(input()))
D = [int(i) for i in input().split(" ")]
count = 0
maxd = max(D)
for i in range(maxd+1):
ARC = []
ABC = []
for j in D:
if i < j:
ARC.append(j)
else:
ABC.append(j)
if len(ARC) == len(ABC):
count+=1
print(count)
|
N = int(eval(input()))
D = [int(i) for i in input().split(" ")]
D.sort()
print((D[int(N/2)]-D[int(N/2)-1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
c = 0
k = 1
d.sort()
for i in range(1,max(d)+1):
ab = [j for j in d if i <= j]
ar = [j for j in d if i > j]
#print(ab,ar)
if(len(ab)==len(ar)):
c = c + 1
ab = 0
ar = 0
print(c)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[int(n/2)] - d[int(n/2)-1]))
|
p02989
|
#ABC132 C
N = int(eval(input()))
D = list(map(int,input().split()))
count = 0
for K in range(max(D) + 1):
A = []
B = []
for i in range(N):
if D[i] >= K:
A.append(D[i])
else:
B.append(D[i])
if len(A) == len(B):
count += 1
print(count)
|
#ABC132 C
N = int(eval(input()))
D = list(map(int,input().split()))
D.sort()
A = list(range(D[int(N/2)-1]+1,D[int(N/2)]+1))
print((len(A)))
|
p02989
|
N = int(eval(input()))
D = sorted([int(i) for i in input().split()])
maxK = D[N // 2]
minK = D[N // 2 - 1]
print((maxK - minK))
|
n = int(eval(input()))
D = sorted([int(i) for i in input().split()])
if n % 2 == 1:
print((0))
else:
m = n // 2
print((D[m] - D[m - 1]))
|
p02989
|
# -*- coding: utf-8 -*-
n = int(eval(input()))
d = [int(i) for i in input().split()]
d.sort()
ans = d[n // 2] - d[n // 2 - 1]
print((max(ans, 0)))
|
# -*- coding: utf-8 -*-
n = int(eval(input()))
d = [int(i) for i in input().split()]
d.sort()
k = d[n // 2] - d[n // 2 - 1]
print(k)
|
p02989
|
# -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
D =[int(i) for i in input().split()]
count = 0
D.sort()
D.reverse()
#print(D)
for j in range(100000):
if j > D[0]:
break
for i in range(N):
if D[i] < j:
if i == (N/2):
count+=1
else:
break
print(count)
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
D =[int(i) for i in input().split()]
#count = 0
D.sort()
D.reverse()
center = D[int(N/2)]
print((D[int((N/2))-1]-center))
if __name__ == '__main__':
main()
|
p02989
|
from sys import stdin
import itertools
n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
li.sort()
key = n//2
print((li[key:][0]-li[:key][-1]))
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[n//2]-d[n//2-1]))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
c = 0
c_R = 0
c_B = 0
d_min = min(d)
d_max = max(d)
for K in range(d_min,d_max+1):
c_R = 0
c_B = 0
for i in range(N):
if K <= d[i] :
c_R = c_R + 1
else:
c_B = c_B + 1
if c_R == c_B:
c = c + 1
print(c)
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
K = d[N//2]
J = d[N//2 - 1]
if K == J :
print((0))
else:
print((K - J))
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
ans = 0
k_m = max(d)
for i in range(1, k_m+1):
abc = []
arc = []
arc = [j for j in d if j >= i]
abc = [k for k in d if k < i]
if len(arc) == len(abc):
ans += 1
print(ans)
|
n = int(eval(input()))
d = sorted(list(map(int,input().split())))
print((d[n//2] - d[n//2-1]))
|
p02989
|
from collections import deque
S = input().rstrip('\r\n')
S_list = deque(S)
Q = int(eval(input()))
for _ in range(Q):
query = input().rstrip('\r\n')
t, f, c = '', '', ''
if len(query) == 1:
t = query
else:
t, f, c = query.split(' ')
if t == '1':
S_list.reverse()
else:
if f == '1':
S_list.appendleft(c)
else:
S_list.append(c)
print((''.join(S_list)))
|
from collections import deque
S = input().rstrip('\r\n')
S_list = deque(S)
is_reverse = False
Q = int(eval(input()))
for _ in range(Q):
query = input().rstrip('\r\n')
t, f, c = '', '', ''
if len(query) == 1:
t = query
else:
t, f, c = query.split(' ')
if t == '1':
is_reverse = not is_reverse
else:
if f == '1':
if is_reverse:
S_list.append(c)
else:
S_list.appendleft(c)
else:
if is_reverse:
S_list.appendleft(c)
else:
S_list.append(c)
if is_reverse:
S_list.reverse()
print((''.join(S_list)))
|
p02756
|
from collections import deque
S = input().rstrip('\r\n')
S_list = deque(S)
is_reverse = False
Q = int(eval(input()))
for _ in range(Q):
query = input().rstrip('\r\n')
t, f, c = '', '', ''
if len(query) == 1:
t = query
else:
t, f, c = query.split(' ')
if t == '1':
is_reverse = not is_reverse
else:
if f == '1':
if is_reverse:
S_list.append(c)
else:
S_list.appendleft(c)
else:
if is_reverse:
S_list.appendleft(c)
else:
S_list.append(c)
if is_reverse:
S_list.reverse()
print((''.join(S_list)))
|
import sys
input = sys.stdin.readline
from collections import deque
def main():
S = input().rstrip("\r\n")
Q = int(eval(input()))
d = deque(S)
reverse = False
for _ in range(Q):
q = input().rstrip("\r\n")
if q == "1":
reverse = not reverse
else:
_, f, c = q.split()
if (f == "1" and not reverse) or (f == "2" and reverse):
d.appendleft(c)
else:
d.append(c)
l = list(d)
if reverse:l.reverse()
print(("".join(l)))
if __name__ == "__main__":
main()
|
p02756
|
from collections import deque
d = deque(list(input()))
for _ in range(int(input())):
a = input()
if a[0] == '1':
d.reverse()
elif a[2] == '1':
d.appendleft(a[4])
else:
d.append(a[4])
print(*d, sep='')
|
from collections import deque
d = deque(list(input()))
flag = 1
for _ in range(int(input())):
a = input()
if a[0] == '1':
flag *= -1
elif a[2] == '1' and flag == 1:
d.appendleft(a[4])
elif a[2] == '1' and flag == -1:
d.append(a[4])
elif a[2] == '2' and flag == 1:
d.append(a[4])
else:
d.appendleft(a[4])
if flag == -1:
d.reverse()
print(*d, sep='')
|
p02756
|
from collections import deque
s,q=deque([*input()]),int(input())
for i in range(q):
t=input().split()
if len(t)==1:
s.reverse()
else:
t,f,c=t
if f=='1': s.appendleft(c)
else: s.append(c)
print(*s,sep='')
|
from collections import deque
s,q=deque([*input()]),int(input())
judge=False
for i in range(q):
t=input().split()
if len(t)==1:
judge = not judge
else:
t,f,c=t
if not judge and f=='1': s.appendleft(c)
elif not judge and f=='2': s.append(c)
elif judge and f=='1': s.append(c)
else: s.appendleft(c)
if judge: s.reverse()
print(*s,sep='')
|
p02756
|
import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
s = readline().decode().strip()
q = int(readline())
is_reversed = False
qs = read().decode().split("\n")
left = ""
right = ""
for i in range(q):
query = qs[i].split()
t = int(query[0])
if t == 1:
is_reversed = not is_reversed
elif t == 2:
f = int(query[1])
c = query[2]
if f == 1:
if is_reversed:
right += c
else:
left += c
elif f == 2:
if is_reversed:
left += c
else:
right += c
s = left[::-1] + s + right
if is_reversed:
print((s[::-1]))
else:
print(s)
|
import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
s = readline().decode().strip()
q = int(readline())
is_reversed = False
qs = read().decode().split("\n")
left = []
right = []
for i in range(q):
query = qs[i].split()
t = int(query[0])
if t == 1:
is_reversed = not is_reversed
elif t == 2:
f = int(query[1])
c = query[2]
if f == 1:
if is_reversed:
right.append(c)
else:
left.append(c)
elif f == 2:
if is_reversed:
left.append(c)
else:
right.append(c)
s = "".join(reversed(left)) + s + "".join(right)
if is_reversed:
print((s[::-1]))
else:
print(s)
|
p02756
|
from sys import stdin
def main():
S = stdin.readline().rstrip()
Q = int(eval(input()))
rev = 0
for _ in range(Q):
q = stdin.readline()
if q[0] == "1":
rev = (rev+1)%2
else:
if q[2] == "1":
if rev == 0:
S = "{}{}".format(q[4], S)
else:
S = "{}{}".format(S, q[4])
else:
if rev ==0:
S = "{}{}".format(S, q[4])
else:
S = "{}{}".format(q[4], S)
if rev == 1:
S = S[::-1]
print(S)
main()
|
from sys import stdin
def main():
S = list(stdin.readline().rstrip())
Q = int(eval(input()))
rev = 0
head = []
tail = []
for _ in range(Q):
q = stdin.readline()
if q[0] == "1":
rev = (rev+1)%2
else:
if q[2] == "1":
if rev == 0:
head.append(q[4])
else:
tail.append(q[4])
else:
if rev ==0:
tail.append(q[4])
else:
head.append(q[4])
if rev == 0:
ans = "".join(head[::-1] + S + tail)
else:
ans = "".join(tail[::-1] + S[::-1] + head)
print(ans)
"""
S = stdin.readline().rstrip()
Q = int(input())
rev = 0
for _ in range(Q):
q = stdin.readline()
if q[0] == "1":
rev = (rev+1)%2
else:
if q[2] == "1":
if rev == 0:
S = "{}{}".format(q[4], S)
else:
S = "{}{}".format(S, q[4])
else:
if rev ==0:
S = "{}{}".format(S, q[4])
else:
S = "{}{}".format(q[4], S)
if rev == 1:
print(S[::-1])
else:
print(S)
"""
main()
|
p02756
|
# coding: utf-8
S = input().split()
Q = int(eval(input()))
def pop(left, right, rev, f, c):
left_ = left
if rev == 1:
if f == '1':
left_ = left[::-1]
left_.append(c)
left_ = left_[::-1]
else:
right.append(c)
else:
if f == '1':
right.append(c)
else:
left_ = left[::-1]
left_.append(c)
left_ = left_[::-1]
return left_, right
left, right = [], []
rev = 1
for _ in range(Q):
que = input().split()
if que[0] == '1':
rev *= -1
continue
if que[0] == '2':
left, right = pop(left, right, rev, *que[1:])
print((''.join(left+S+right)[::rev]))
|
# coding: utf-8
S = input().split()
Q = int(eval(input()))
def pop(left, right, rev, f, c):
if rev == 1:
if f == '1':
left.append(c)
else:
right.append(c)
else:
if f == '1':
right.append(c)
else:
left.append(c)
return left, right
left, right = [], []
rev = 1
for _ in range(Q):
que = input().split()
if que[0] == '1':
rev *= -1
continue
if que[0] == '2':
left, right = pop(left, right, rev, *que[1:])
print((''.join(left[::-1]+S+right)[::rev]))
|
p02756
|
def solve(string):
s, q, *qs = string.split("\n")
for _q in qs:
if _q == "1":
s = s[::-1]
continue
_, f, c = _q.split()
s = c + s if f == "1" else s + c
return s
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
|
def solve(string):
s, q, *qs = string.split("\n")
pre = []
post = []
r = False
for _q in qs[::-1]:
if _q == "1":
r = not r
continue
_, f, c = _q.split()
if r and f == "2" or not r and f == "1":
pre.append(c)
else:
post.append(c)
pre, post = "".join(pre), "".join(post[::-1])
return pre + s[::-1] + post if r else pre + s + post
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
|
p02756
|
from collections import deque
def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for _ in range(n)]
s = deque(inp())
q = iinp()
l = deque()
p = 0
o = 1
for i in range(q):
a = inps()
if o == 1 and a[0] == 1:
continue
if a[0] == "2":
if a[1] == "1":
if p == 0:
l.appendleft(a[2])
o += 1
else:
s.appendleft(a[2])
o += 1
else:
if p == 0:
s.append(a[2])
o += 1
else:
l.append(a[2])
o += 1
if a[0] == "1":
if p == 0:
p = 1
else:
p = 0
s.reverse()
l.reverse()
if p == 0:
for i in l:
print(i,end="")
for i in s:
print(i,end="")
print("")
else:
for i in s:
print(i,end="")
for i in l:
print(i,end="")
print("")
|
def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for _ in range(n)]
s = list(inp())
q = iinp()
l = []
p = 0
o = 1
for i in range(q):
a = inps()
if o == 1 and a[0] == 1:
continue
if a[0] == "2":
if a[1] == "1":
if p == 0:
l.append(a[2])
o += 1
else:
s.append(a[2])
o += 1
else:
if p == 0:
s.append(a[2])
o += 1
else:
l.append(a[2])
o += 1
if a[0] == "1":
if p == 0:
p = 1
else:
p = 0
if p == 0:
for i in range(len(l)):
print(l[len(l)-1-i],end="")
for i in s:
print(i,end="")
print("")
else:
for i in range(len(s)):
print(s[len(s)-1-i],end="")
for i in l:
print(i,end="")
print("")
|
p02756
|
import sys
input = sys.stdin.readline
S=list(input()[:-1])
Q=int(input()[:-1])
f=0
for _ in range(Q):
q=input().split()
if int(q[0])==1:
f = (f+1)%2
if int(q[0])==2:
if int(q[1])==1:
if f==0:
SS=[q[2]]
SS.extend(S)
S=SS
else:
S.append(q[2])
else:
if f==0:
S.append(q[2])
else:
SS=[q[2]]
SS.extend(S)
S=SS
if f==0:
print(("".join(S)))
else:
print(("".join(S[::-1])))
|
import sys
input = sys.stdin.readline
S=list(input()[:-1])
Q=int(input()[:-1])
f=0
back=[]
forward=[]
for _ in range(Q):
q=input().split()
if int(q[0])==1:
f = (f+1)%2
if int(q[0])==2:
if int(q[1])==1:
if f==0:
forward.append(q[2])
else:
back.append(q[2])
else:
if f==0:
back.append(q[2])
else:
forward.append(q[2])
if f==0:
print(("".join(forward[::-1]+S+back)))
else:
print(("".join((forward[::-1]+S+back)[::-1])))
|
p02756
|
# D - String Formation
from collections import deque
def main():
S = input().rstrip()
Q = int(eval(input()))
queue = deque(S)
to_beginning, to_end = queue.appendleft, queue.append
is_reversed = 0
for _ in range(Q):
query = input().split()
if query[0] == "1":
is_reversed ^= 1
continue
com, c = query[1], query[2]
if com == "1":
if not is_reversed:
to_beginning(c)
else:
to_end(c)
else:
if not is_reversed:
to_end(c)
else:
to_beginning(c)
ans = "".join(queue) if not is_reversed else "".join(reversed(queue))
print(ans)
if __name__ == "__main__":
main()
|
# D - String Formation
from collections import deque
def main():
S = input().rstrip()
Q = int(eval(input()))
queue = deque(S)
to_beginning, to_end = queue.appendleft, queue.append
is_reversed = False
for _ in range(Q):
query = input().split()
if query[0] == "1":
to_beginning, to_end = to_end, to_beginning
is_reversed = not is_reversed
continue
com, c = query[1], query[2]
if com == "1":
to_beginning(c)
else:
to_end(c)
ans = "".join(queue) if not is_reversed else "".join(reversed(queue))
print(ans)
if __name__ == "__main__":
main()
|
p02756
|
# D - String Formation
from collections import deque
def main():
S = input().rstrip()
Q = int(eval(input()))
queue = deque(S)
is_reversed = 0
for _ in range(Q):
query = input().split()
if query[0] == "1":
is_reversed ^= 1
continue
com, c = query[1], query[2]
if com == "1":
if not is_reversed:
queue.appendleft(c)
else:
queue.append(c)
else:
if not is_reversed:
queue.append(c)
else:
queue.appendleft(c)
ans = "".join(queue) if not is_reversed else "".join(reversed(queue))
print(ans)
if __name__ == "__main__":
main()
|
# D - String Formation
import sys
from collections import deque
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
S = readline().rstrip()
_ = readline()
queries = readlines()
queue = deque(S)
to_beginning, to_end = queue.appendleft, queue.append
is_reversed = 0
for query in queries:
if query[0] == "1":
to_beginning, to_end = to_end, to_beginning
is_reversed ^= 1
continue
com, c = query[2], query[4]
if com == "1":
to_beginning(c)
else:
to_end(c)
ans = "".join(queue) if not is_reversed else "".join(reversed(queue))
print(ans)
if __name__ == "__main__":
main()
|
p02756
|
s = list(input())
n = int(input())
head = []
tail = []
cnt = 0
for _ in range(n):
li = list(input().split())
if li[0] == '1':
head, tail = tail, head
s = s[::-1]
cnt += 1
else:
if li[1] == '1':
head += li[2]
else:
tail += li[2]
ans = head[::-1] + s + tail
print(*ans , sep='')
|
s = list(input())
n = int(input())
head = []
tail = []
cnt = 0
for _ in range(n):
li = list(input().split())
if li[0] == '1':
head, tail = tail, head
cnt += 1
else:
if li[1] == '1':
head += li[2]
else:
tail += li[2]
if cnt % 2 != 0:
s = s[::-1]
ans = head[::-1] + s + tail
print(*ans , sep='')
|
p02756
|
s = list(input())
n = int(input())
head = []
tail = []
cnt = 0
for _ in range(n):
li = list(input().split())
if li[0] == '1':
head, tail = tail, head
cnt += 1
else:
if li[1] == '1':
head += li[2]
else:
tail += li[2]
if cnt % 2 != 0:
s = s[::-1]
ans = head[::-1] + s + tail
print(*ans , sep='')
|
s = list(input())
n = int(input())
head = []
tail = []
cnt = 0
for _ in range(n):
li = list(input().split())
if li[0] == '1':
head, tail = tail, head
cnt += 1
else:
if li[1] == '1':
head.append(li[2])
else:
tail.append(li[2])
if cnt % 2 != 0:
s = s[::-1]
ans = head[::-1] + s + tail
print(*ans , sep='')
|
p02756
|
import sys
input = sys.stdin.readline
s = input().strip('\n')
q = int(input().strip('\n'))
j = ''.join
turn = 0
for _ in range(q):
query = input().strip('\n')
if len(query) == 1:
turn += 1
else:
two, f, c = query.split()
if f == '1':
if turn % 2 == 0:
s = j([c, s])
else:
s = j([s, c])
else:
if turn % 2 == 0:
s = j([s, c])
else:
s = j([c, s])
if turn % 2 == 0:
print(s)
else:
print((s[::-1]))
|
import sys
input = sys.stdin.readline
s = input().strip()
q = int(eval(input()))
query = [list(input().strip().split()) for _ in range(q)]
left = ''
right = ''
t = False
for ls in query:
if len(ls) == 1:
t = not t
else:
two, f, c = ls
if f == '1':
if t:
right += c
else:
left += c
else:
if t:
left += c
else:
right += c
if t:
print((right[::-1] + s[::-1] + left))
else:
print((left[::-1] + s + right))
|
p02756
|
from collections import deque
s = input()
q = int(input())
d = deque(s)
for _ in range(q):
Q = list(input().split())
if Q[0]=='1':
d = deque(reversed(d))
elif Q[0]=='2':
if Q[1]=='1':
d.appendleft(Q[2])
elif Q[1]=='2':
d.append(Q[2])
print(*d, sep='')
|
from collections import deque
s = input()
q = int(input())
d = deque(s)
inv = 0
for _ in range(q):
Q = list(input().split())
if Q[0]=='1':
inv += 1
elif Q[0]=='2':
if Q[1]=='1':
if inv%2==0:
d.appendleft(Q[2])
else:
d.append(Q[2])
elif Q[1]=='2':
if inv%2==0:
d.append(Q[2])
else:
d.appendleft(Q[2])
if inv%2==0:
print(*d, sep='')
else:
print(*deque(reversed(d)), sep='')
|
p02756
|
import sys
input = sys.stdin.readline
def main():
S = input().replace('\n', '')
Q = int(eval(input()))
for _ in range(Q):
query = input().split()
if len(query) == 1:
S = S[::-1]
else:
T, F, C = query
if int(F) == 1:
S = C + S
else:
S = S + C
print(S)
main()
|
import sys
input = sys.stdin.readline
def main():
S = input().replace('\n', '')
Q = int(eval(input()))
flg = 0
head = ""
tail = ""
for _ in range(Q):
query = input().split()
if len(query) == 1:
head, tail = tail, head
flg += 1
else:
T, F, C = query
if int(F) == 1:
head += C
else:
tail += C
if flg % 2:
print((head[::-1] + S[::-1] + tail))
else:
print((head[::-1] + S + tail))
main()
|
p02756
|
import sys
input = sys.stdin.readline
s = input().split()[0]
q = int(eval(input()))
for _ in range(q):
q_i = input().split()
if len(q_i) == 1:
s = s[::-1]
else:
_, f, c = q_i
f = int(f)
if f == 1:
s = c + s
else:
s = s + c
print(s)
|
import sys
input = sys.stdin.readline
s = input().split()[0]
q = int(eval(input()))
left, right = [], []
state = 1
for _ in range(q):
q_i = input().split()
if len(q_i) == 1:
state = (state)%2 + 1
else:
_, f, c = q_i
f = int(f)
if (f+state)%2 == 0:
left += [c]
else:
right += [c]
if state == 1:
print((''.join(left[::-1]) + s + ''.join(right)))
else:
print((''.join(right[::-1]) + s[::-1] + ''.join(left)))
|
p02756
|
#初期入力
import sys
input = sys.stdin.readline
S = input().split()
S=S[0]
Q = int(eval(input()))
FQ_dic =tuple()
rev =0
for i in range(Q):
FQ_dic =tuple(input().split())
if FQ_dic[0] =="1": #逆転する
rev +=1
else: #逆転なし
if FQ_dic[1]=="1": #後ろにつける
if rev %2 ==0:
S = FQ_dic[2] + S
else:
S = S +FQ_dic[2]
else: # #前につける
if rev %2 ==0:
S = S + FQ_dic[2]
else:
S = FQ_dic[2] + S
if rev %2 ==0:
print(S)
else:
print((S[::-1]))
|
#前・左につける変数、後ろ・右につける変数を用意して最後に足す
#前・左は最後にひっくり返す（abc ⇒cba)
#初期入力
import sys
input = sys.stdin.readline
S = input()
S=S.strip("\n")
Q = int(input())
FQ_dic={}
for i in range(Q):
FQ_dic[i] =input().split()
rev =0
front =""
back =""
for i in range(Q):
# print(S)
if FQ_dic[i][0] =="1": #逆転する
rev +=1
else: #逆転なし
if FQ_dic[i][1]=="1": #前=左につける
if rev %2 ==0:
front += FQ_dic[i][2]
else:
back += FQ_dic[i][2]
else: # #後ろ=右につける
if rev %2 ==0:
back += FQ_dic[i][2]
else:
front += FQ_dic[i][2]
front =front[::-1]
S =front + S + back
if rev %2 ==0:
print(*S,sep="")
else:
print(*S[::-1],sep="")
|
p02756
|
import sys
input = sys.stdin.readline
S = input().strip()
Q = int(eval(input()))
reverse = False
for _ in range(Q):
s = input().strip()
if s.startswith("1"):
reverse = not reverse
else:
_, f, c = s.split()
if f == "1":
if reverse:
S = S + c
else:
S = c + S
else:
if reverse:
S = c + S
else:
S = S + c
if reverse:
print((S[::-1]))
else:
print(S)
|
import sys
input = sys.stdin.readline
S = input().strip()
Q = int(eval(input()))
reverse = False
before = ""
after = ""
for _ in range(Q):
s = input().strip()
if s[0] == "1":
reverse = not reverse
else:
_, f, c = s.split()
if f == "1":
if reverse:
after = after + c
else:
before = c + before
else:
if reverse:
before = c + before
else:
after = after + c
if reverse:
print((after[::-1] + S[::-1] + before[::-1]))
else:
print((before + S + after))
|
p02756
|
import sys
input = sys.stdin.readline
def sol():
s=input().rstrip()
q=int(eval(input()))
x=0
for i in range(q):
l=tuple([i for i in input().split()])
if l[0]=="1":
x=(x+1)%2
elif l[1]=="1":
if x==0: s=l[2]+s
else: s=s+l[2]
elif l[1]=="2":
if x==0: s=s+l[2]
else: s=l[2]+s
print((s if x==0 else s[::-1]))
if __name__=="__main__":
sol()
|
import sys
input = sys.stdin.readline
def sol():
s=input().rstrip()
q=int(eval(input()))
x=0
a,b="",""
for i in range(q):
l=tuple([i for i in input().split()])
if l[0]=="1":
x=(x+1)%2
elif l[1]=="1":
if x==0: a=l[2]+a
else: b=b+l[2]
elif l[1]=="2":
if x==0: b=b+l[2]
else: a=l[2]+a
s=a+s+b
print((s if x==0 else s[::-1]))
if __name__=="__main__":
sol()
|
p02756
|
from collections import deque
s = deque(input())
q = int(input())
for i in range(q):
t = input()
if len(t) == 1:
s.reverse()
else:
if t[2] == "1":
s.appendleft(t[4])
else:
s.append(t[4])
print(*s, sep="")
|
from collections import deque
s = deque(input())
q = int(input())
rev = 0
for i in range(q):
t = input()
if rev == 0:
if len(t) == 1:
rev = 1
else:
if t[2] == "1":
s.appendleft(t[4])
else:
s.append(t[4])
else:
if len(t) == 1:
rev = 0
else:
if t[2] == "1":
s.append(t[4])
else:
s.appendleft(t[4])
if rev == 1:
s.reverse()
print(*s, sep="")
|
p02756
|
#!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
s = input().strip()
q = int(eval(input()))
state = 1
swap = [0, 2, 1]
for _ in range(q):
x = input().strip()
if x == '1':
state *= -1
else:
_, f, c = x.split(' ')
f = int(f)
if state == -1:
f = swap[int(f)]
if f == 1:
s = c + s
else:
s += c
if state == -1:
s = s[::-1]
print(s)
pass
if __name__=='__main__':
main()
|
#!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
s = input().strip()
q = int(eval(input()))
state = 1
swap = [0, 2, 1]
ss = []
es = []
for _ in range(q):
x = input().strip()
if x == '1':
state *= -1
else:
_, f, c = x.split(' ')
f = int(f)
if state == -1:
f = swap[int(f)]
if f == 1:
ss.append(c)
else:
es.append(c)
s = ''.join(ss[::-1]) + s + ''.join(es)
if state == -1:
s = s[::-1]
print(s)
if __name__=='__main__':
main()
|
p02756
|
'''
∧_,,∧ 究極奥義「WAがACになーれ！！」
（`・ω・)つ━☆・*。
⊂ ノ ・゜+.
し’´Ｊ *・
'''
s=input()
a=[]
b=[]
now=1
q=int(input())
for i in range(q):
x=list(input().split())
if x[0]=="1":
now*=-1
else:
if now==1 and x[1]=="2" or now==-1 and x[1]=="1":
b.append(x[2])
else:
a.append(x[2])
if now==-1:
ans=b[::-1]+list(s[::-1])+a
print(*ans,sep="")
else:
ans=a[::-1]+list(s)+b
print(*ans,sep="")
|
s=input()
a=[]
b=[]
now=True
q=int(input())
for i in range(q):
x=list(input().split())
if x[0]=="1":
now=not now
else:
if now and x[1]=="2" or not now and x[1]=="1":
b.append(x[2])
else:
a.append(x[2])
if now:
ans=a[::-1]+list(s)+b
else:
ans=b[::-1]+list(s[::-1])+a
print(*ans,sep="")
|
p02756
|
from collections import deque
s = list(input())
q = int(input())
ans = deque(s)
for i in range(q):
arr = list(map(str, input().split()))
if arr[0] == '1':
ans.reverse()
else:
if arr[1] == '1':
ans.appendleft(arr[2])
else:
ans.append(arr[2])
print(*ans, sep='')
|
from collections import deque
s = list(input())
q = int(input())
ans = deque(s)
cnt = 0
for i in range(q):
arr = list(map(str, input().split()))
if arr[0] == '1':
cnt += 1
cnt %= 2
else:
if (arr[1] == '1' and cnt == 0) or (arr[1] == '2' and cnt == 1):
ans.appendleft(arr[2])
else:
ans.append(arr[2])
if cnt == 0:
print(*ans, sep='')
else:
ans.reverse()
print(*ans, sep='')
|
p02756
|
from collections import deque
s = deque(input())
q = int(input())
l = list(list(input().split()) for _ in range(q))
for i in l:
if len(i)==1:
s.reverse()
else:
a,f,c = i
if f=="1":
s.appendleft(c)
else:
s.append(c)
print(*s,sep="")
|
from collections import deque
s = deque(input())
q = int(input())
l = list(list(input().split()) for _ in range(q))
t = 0
for i in l:
if len(i)==1:
t += 1
else:
a,f,c = i
if (f=="1" and t%2==0) or (f=="2" and t%2==1) :
s.appendleft(c)
else:
s.append(c)
if t%2==1:
s.reverse()
print(*s,sep="")
|
p02756
|
from collections import deque
import sys
input=sys.stdin.readline
moji=deque([])
s=input().rstrip()
for i in range(len(s)):
moji.append(ord(s[i]))
q=int(eval(input()))
rev=0
for _ in range(q):
qw=input().split()
if qw[0]=="1":
rev+=1
else:
f=qw[1]
c=qw[2]
if f=="1":
if rev%2==0:
moji.appendleft(ord(c))
else:
moji.append(ord(c))
else:
if rev%2==0:
moji.append(ord(c))
else:
moji.appendleft(ord(c))
ans=""
alph="abcdefghijklmnopqrstuvwxyz"
for i in range(len(moji)):
ans+=alph[moji[i]-97]
if rev%2==0:
print(ans)
else:
print((ans[::-1]))
|
alph="abcdefghijklmnopqrstuvwxyz"
from collections import deque
import sys
input=sys.stdin.readline
moji=deque([])
s=input().rstrip()
for i in range(len(s)):
for j in range(26):
if s[i]==alph[j]:
moji.append(j)
break
q=int(eval(input()))
rev=0
for _ in range(q):
qw=input().split()
if qw[0]=="1":
rev+=1
else:
f=qw[1]
c=qw[2]
for j in range(26):
if c==alph[j]:
x=j
break
if f=="1":
if rev%2==0:
moji.appendleft(x)
else:
moji.append(x)
else:
if rev%2==0:
moji.append(x)
else:
moji.appendleft(x)
ans=""
r=[]
for i in range(len(moji)):
r.append(moji.popleft())
for i in range(len(r)):
ans+=alph[r[i]]
if rev%2==0:
print(ans)
else:
print((ans[::-1]))
|
p02756
|
import sys
import collections
import itertools
def resolve(in_):
one = ord(b'1')
two = ord(b'2')
# print(f'{one=} {two=}')
S = in_.readline().strip()
q = collections.deque(S)
# print(f'{S=} {q=}')
reverse_flag = 0
Q = int(in_.readline())
for query in itertools.islice(in_, Q):
T = query[0]
if T == one:
reverse_flag ^= 1
# q.reverse()
elif T == two:
if reverse_flag:
q.reverse()
reverse_flag = 0
F = query[2]
C = query[4]
if F == one:
q.appendleft(C)
elif F == two:
q.append(C)
else:
if reverse_flag:
q.reverse()
reverse_flag = 0
return bytes(q)
def main():
answer = resolve(sys.stdin.buffer)
print((answer.decode('ascii')))
if __name__ == '__main__':
main()
|
import sys
import collections
import itertools
def resolve(in_):
one = ord(b'1')
two = ord(b'2')
# print(f'{one=} {two=}')
S = in_.readline().strip()
q = collections.deque(S)
# print(f'{S=} {q=}')
reverse_flag = False
Q = int(in_.readline())
for query in itertools.islice(in_, Q):
T = query[0]
if T == one:
reverse_flag ^= True
# q.reverse()
elif T == two:
F = query[2]
C = query[4]
if (F == one) ^ reverse_flag:
q.appendleft(C)
else:
q.append(C)
else:
if reverse_flag:
q.reverse()
reverse_flag = 0
return bytes(q)
def main():
answer = resolve(sys.stdin.buffer)
print((answer.decode('ascii')))
if __name__ == '__main__':
main()
|
p02756
|
S = input()
Q = int(input())
reverse = False
for _ in range(Q):
cmd = input().split()
if cmd[0] == "1":
reverse = not reverse
else:
top = (cmd[1] == "1") ^ reverse
S = cmd[2] + S if top else S + cmd[2]
print(S[::-1]) if reverse else print(S)
|
S = input()
Q = int(input())
head, tail = "", ""
reverse = False
for _ in range(Q):
cmd = input().split()
if cmd[0] == "1":
reverse = not reverse
else:
top = (cmd[1] == "1") ^ reverse
if top:
head += cmd[2]
else:
tail += cmd[2]
print(tail[::-1] + S[::-1] + head) if reverse else print(head[::-1] + S + tail)
|
p02756
|
from collections import deque
revFlag = False
s = deque(input())
q = int(input())
for i in range(q):
a,b,c, *_ = input().split() + [None, None]
if(a == '1'):
revFlag = not revFlag
else:
if(revFlag):
s.reverse()
revFlag = False
if(b == '1'):
s.appendleft(c)
else:
s.append(c)
if(revFlag):
s.reverse()
print(*s, sep='')
|
from collections import deque
revFlag = False
s = deque(input())
q = int(input())
for i in range(q):
a,b,c, *_ = input().split() + [None, None]
if(a == '1'):
revFlag = not revFlag
else:
b = int(b)
if(revFlag):
b = (int(b)%2)+1
if(b == 1):
s.appendleft(c)
else:
s.append(c)
#print(_,*s, sep="")
if(revFlag):
s.reverse()
print(*s, sep='')
|
p02756
|
from sys import stdin
s = list(stdin.readline().rstrip())
q = int(stdin.readline().rstrip())
t = []
for i in range(q):
t.append([x for x in stdin.readline().rstrip().split()])
r = 0
for i in range(q):
if int(t[i][0]) == 1:
if r == 1:
r = 0
else:
r = 1
else:
if (int(t[i][1]) + r) % 2 == 0:
s.append(t[i][2])
else:
s.insert(0,t[i][2])
if r == 1:
s = list(reversed(s))
s = ''.join(s)
print(s)
|
from sys import stdin
s = list(stdin.readline().rstrip())
q = int(stdin.readline().rstrip())
t = []
k = []
for i in range(q):
t.append([x for x in stdin.readline().rstrip().split()])
r = 0
for i in range(q):
if int(t[i][0]) == 1:
if r == 1:
r = 0
else:
r = 1
else:
if (int(t[i][1]) + r) % 2 == 0:
s.append(t[i][2])
else:
k.append(t[i][2])
k = list(reversed(k))
k.extend(s)
if r == 1:
k = list(reversed(k))
k = ''.join(k)
print(k)
|
p02756
|
from collections import deque
def main():
s = input()
q = int(input())
d = deque(s)
is_reversed = False
for _ in range(q):
query = list(input().split())
if query[0] == "1":
if is_reversed:
is_reversed = False
else:
is_reversed = True
elif query[0] == "2":
if query[1] == "1":
if is_reversed:
d.append(query[2])
else:
d.appendleft(query[2])
elif query[1] == "2":
if is_reversed:
d.appendleft(query[2])
else:
d.append(query[2])
if is_reversed:
print(*(list(d)[::-1]), sep="")
else:
print(*list(d), sep="")
if __name__ == "__main__":
main()
|
def main():
s = list(input())
t = []
q = int(input())
for _ in range(q):
query = list(input().split())
if query[0] == "1":
s, t = t, s
elif query[0] == "2":
if query[1] == "1":
t.append(query[2])
elif query[1] == "2":
s.append(query[2])
print(*(t[::-1] + s), sep="")
if __name__ == "__main__":
main()
|
p02756
|
import sys
sys.setrecursionlimit(4100000)
import math
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
def resolve():
S = [x for x in sys.stdin.readline().split()][0] # 文字列 一つ
Q = [int(x) for x in sys.stdin.readline().split()][0] # int 一つ
# N, D = [int(x) for x in sys.stdin.readline().split()] # 複数int
# h_list = [int(x) for x in sys.stdin.readline().split()] # 複数int
# grid = [list(sys.stdin.readline().split()[0]) for _ in range(N)] # 文字列grid
# v_list = [int(sys.stdin.readline().split()[0]) for _ in range(N)]
# grid = [[int(x) for x in sys.stdin.readline().split()]
# for _ in range(N)] # int grid
logger.debug('{}'.format([]))
reverse = False
for _ in range(Q):
q = input().strip()
if q == '1':
reverse = not reverse
else:
t, f, c = q.split(' ')
if (f == '1' and not reverse) or (f == '2' and reverse):
S = ''.join([c, S])
else:
S = ''.join([S, c])
if reverse:
print((S[::-1]))
else:
print(S)
if __name__ == "__main__":
resolve()
# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """a
4
2 1 p
1
2 2 c
1"""
output = """cpa"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """a
6
2 2 a
2 1 b
1
2 2 c
1
1"""
output = """aabc"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """y
1
2 1 x"""
output = """xy"""
self.assertIO(input, output)
|
import sys
sys.setrecursionlimit(4100000)
import math
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
from collections import deque
def resolve():
S = [x for x in sys.stdin.readline().split()][0] # 文字列 一つ
Q = [int(x) for x in sys.stdin.readline().split()][0] # int 一つ
# N, D = [int(x) for x in sys.stdin.readline().split()] # 複数int
# h_list = [int(x) for x in sys.stdin.readline().split()] # 複数int
# grid = [list(sys.stdin.readline().split()[0]) for _ in range(N)] # 文字列grid
# v_list = [int(sys.stdin.readline().split()[0]) for _ in range(N)]
# grid = [[int(x) for x in sys.stdin.readline().split()]
# for _ in range(N)] # int grid
logger.debug('{}'.format([]))
reverse = False
s_list = deque(S)
for _ in range(Q):
q = input().strip()
if q == '1':
reverse = not reverse
else:
t, f, c = q.split(' ')
if (f == '1' and not reverse) or (f == '2' and reverse):
s_list.appendleft(c)
else:
s_list.append(c)
if reverse:
print((''.join(list(s_list)[::-1])))
else:
print((''.join(list(s_list))))
if __name__ == "__main__":
resolve()
# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """a
4
2 1 p
1
2 2 c
1"""
output = """cpa"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """a
6
2 2 a
2 1 b
1
2 2 c
1
1"""
output = """aabc"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """y
1
2 1 x"""
output = """xy"""
self.assertIO(input, output)
|
p02756
|
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import deque
def main():
S_ = S()
S_que = deque(S_)
Q = I()
for i in range(Q):
q = LS()
if int(q[0]) == 1:
S_que.reverse()
elif int(q[0]) == 2:
if int(q[1]) == 1:
S_que.appendleft(q[2])
else:
S_que.append(q[2])
print((''.join(map(str, S_que))))
if __name__ == "__main__":
main()
|
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import deque
def main():
S_ = S()
S_que = deque(S_)
Q = I()
cnt = 0
for i in range(Q):
q = LS()
if int(q[0]) == 1:
cnt += 1
elif int(q[0]) == 2:
if int(q[1]) == 1:
if cnt % 2 == 0:
S_que.appendleft(q[2])
else:
S_que.append(q[2])
else:
if cnt % 2 == 1:
S_que.appendleft(q[2])
else:
S_que.append(q[2])
if cnt % 2 == 1:
S_que.reverse()
print((''.join(map(str, S_que))))
if __name__ == "__main__":
main()
|
p02756
|
#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
a, b = map(int, input().split())
A.append(a)
B.append(b)'''
def main():
import sys
input = sys.stdin.readline
s = input().rstrip("\n")
q = int(eval(input()))
han = 0
qq=[input().split() for i in range(q)]
for que in qq:
if len(s) == 1 and que[0] == "1":
continue
if que[0] == "1":
han += 1
#print(han, s, que)
else:
if han % 2 == 0: # 反転なし
if que[1] == "1":
s = que[2]+s
else:
s += que[2]
else: # あり
if que[1] == "1":
s +=que[2]
else:
s = que[2]+s
#print(han, s, que)
if han % 2 == 0:
print(s)
else:
print((s[::-1]))
if __name__ == '__main__':
main()
|
#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
a, b = map(int, input().split())
A.append(a)
B.append(b)'''
def main():
import sys
input = sys.stdin.readline
s = input().rstrip("\n")
q = int(eval(input()))
qq = [input().split() for i in range(q)]
cnt=0
r=""
l=""
#print(qq)
for que in qq:
if que[0] == "1":
#print("a")
r,l=l,r
cnt+=1
#print(r,l,cnt)
else:
if que[1] == "1":
l+=que[2]
else:
r+=que[2]
#print(r,l, que)
#print(r,l)
if cnt%2==0:
print((l[::-1]+s+r))
else:
print((l[::-1]+s[::-1]+r))
if __name__ == '__main__':
main()
|
p02756
|
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def LSI(): return list(map(int, list(sys.stdin.readline().rstrip())))
def LSI2(N): return [list(map(int, list(sys.stdin.readline().rstrip()))) for i in range(N)]
def S(): return sys.stdin.readline().rstrip()
def LS(): return sys.stdin.readline().split()
def LS2(N): return [sys.stdin.readline().split() for i in range(N)]
def FILL(i,h): return [i for j in range(h)]
def FILL2(i,h,w): return [FILL(i,w) for j in range(h)]
def FILL3(i,h,w,d): return [FILL2(i,w,d) for j in range(h)]
def FILL4(i,h,w,d,d2): return [FILL3(i,w,d,d2) for j in range(h)]
def sisha(num,digit): return Decimal(str(num)).quantize(Decimal(digit),rounding=ROUND_HALF_UP)
#'0.01'や'1E1'などで指定、整数に戻すならintをかます
MOD = 998244353
INF = float("inf")
sys.setrecursionlimit(10**6+10)
input = sys.stdin.readline
S = S()
S = [S[i] for i in range(len(S))]
Q = I()
rev = False
for i in range(Q):
q = LS()
if q[0] == '1':
rev = not rev
continue
if (q[1] == '1') ^ rev:
S = [q[2]]+S
else:
S = S+[q[2]]
if rev:
ans = ''.join(S[::-1])
else:
ans = ''.join(S)
print(ans)
|
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def LSI(): return list(map(int, list(sys.stdin.readline().rstrip())))
def LSI2(N): return [list(map(int, list(sys.stdin.readline().rstrip()))) for i in range(N)]
def S(): return sys.stdin.readline().rstrip()
def LS(): return sys.stdin.readline().split()
def LS2(N): return [sys.stdin.readline().split() for i in range(N)]
def FILL(i,h): return [i for j in range(h)]
def FILL2(i,h,w): return [FILL(i,w) for j in range(h)]
def FILL3(i,h,w,d): return [FILL2(i,w,d) for j in range(h)]
def FILL4(i,h,w,d,d2): return [FILL3(i,w,d,d2) for j in range(h)]
def sisha(num,digit): return Decimal(str(num)).quantize(Decimal(digit),rounding=ROUND_HALF_UP)
#'0.01'や'1E1'などで指定、整数に戻すならintをかます
MOD = 998244353
INF = float("inf")
sys.setrecursionlimit(10**6+10)
input = sys.stdin.readline
S = S()
S = [S[i] for i in range(len(S))]
QS= deque(S)
S = QS
Q = I()
rev = False
for i in range(Q):
q = LS()
if q[0] == '1':
rev = not rev
continue
if (q[1] == '1') ^ rev:
S.appendleft(q[2])
else:
S.append(q[2])
if rev:
ans = ''.join(reversed(S))
else:
ans = ''.join(S)
print(ans)
|
p02756
|
from sys import stdin
S = (stdin.readline().rstrip())
Q = int(stdin.readline().rstrip())
cnt = 0
ccnt = 0
s = ["@"]
for i in range(Q):
data = [(x) for x in stdin.readline().rstrip().split()]
if data[0] == "2":
ccnt = 0
if data[1] == "1":
if cnt % 2 == 0:
#s = "".join([data[2],s])
s.insert(0,data[2])
else:
#s = "".join([s,data[2]])
s.append(data[2])
else:
if cnt % 2 == 0:
#s = "".join([s,data[2]])
s.append(data[2])
else:
#s = "".join([data[2],s])
s.insert(0,data[2])
else:
cnt += 1
s = "".join(s)
if cnt % 2 != 0:
s = s[::-1]
if cnt % 2 != 0:
S = S[::-1]
ans = s.replace("@",S)
print(ans)
|
from sys import stdin
S = (stdin.readline().rstrip())
Q = int(stdin.readline().rstrip())
cnt = 0
ccnt = 0
s = "@"
for i in range(Q):
data = [(x) for x in stdin.readline().rstrip().split()]
if data[0] == "2":
ccnt = data[2]
if data[1] == "1":
if cnt % 2 == 0:
s = "".join([ccnt,s])
else:
s = "".join([s,ccnt])
else:
if cnt % 2 == 0:
s = "".join([s,ccnt])
else:
s = "".join([ccnt,s])
else:
cnt += 1
if cnt % 2 != 0:
s = s[::-1]
if cnt % 2 != 0:
S = S[::-1]
ans = s.replace("@",S)
print(ans)
|
p02756
|
from sys import stdin
s = str(stdin.readline().rstrip())
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに
q= int(stdin.readline().rstrip())
hanten = 0
for i in range(q):
l = list(map(str, stdin.readline().rstrip().split()))
if int(l[0]) == 1:
hanten += 1
else:
if int(l[1])==1:
if hanten%2 == 0:
s = l[2]+s
else:
s = s+l[2]
else:
if hanten%2==0:
s = s+l[2]
else:
s = l[2]+s
if hanten%2==0:
print(s)
else:
print((s[::-1]))
|
from sys import stdin
s = str(stdin.readline().rstrip())
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに
q= int(stdin.readline().rstrip())
hanten = 0
t=""
u=""
for i in range(q):
l = list(map(str, stdin.readline().rstrip().split()))
if int(l[0]) == 1:
t,u = u,t
hanten ^= 1
else:
if int(l[1])==1:
t+=l[2]
else:
u+=l[2]
if hanten==0:
print((t[::-1]+s+u))
else:
print((t[::-1]+s[::-1]+u))
|
p02756
|
S = input()
N = int(input())
direct = 0
for i in range(N):
X = input().split()
if len(X) == 1:
direct = 1 - direct
else:
if (X[1] == "1" and direct == 0) or (X[1] == "2" and direct == 1):
S = X[2] + S
else:
S += X[2]
print(S) if direct == 0 else print(S[::-1])
|
S = input()
f = ""
N = int(input())
direct = 0
for i in range(N):
X = input().split()
if len(X) == 1:
direct = 1 - direct
else:
if (X[1] == "1" and direct == 0) or (X[1] == "2" and direct == 1):
f += X[2]
else:
S += X[2]
print(f[::-1]+S) if direct == 0 else print(S[::-1]+f)
|
p02756
|
from collections import deque
d = deque()
S = input()
d.append(S)
N = int(input())
direct = 0
for i in range(N):
X = input().split()
if len(X) == 1:
direct = 1 - direct
else:
if (X[1] == "1" and direct == 0) or (X[1] == "2" and direct == 1):
d.appendleft(X[2])
else:
d.append(X[2])
S = "".join(list(d))
print(S) if direct == 0 else print(S[::-1])
|
from collections import deque
d = deque()
S = input()
d.append(S)
N = int(input())
direct = 1
for i in range(N):
X = input().split()
if len(X) == 1:
direct *= -1
else:
if (X[1] == "1" and direct == 1) or (X[1] == "2" and direct == -1):
d.appendleft(X[2])
else:
d.append(X[2])
S = "".join(list(d))
print(S) if direct == 1 else print(S[::-1])
|
p02756
|
s = list(input().strip())
q = int(input().strip())
queries = []
one_count = 0
one_counts = []
for i in range(q):
inp = input().split()
queries.append(inp)
if inp[0] == "1":
one_count += 1
one_counts.append(one_count)
one_counts = list([(one_count - x) for x in one_counts])
if one_count % 2 == 1:
s = s[::-1]
pre = []
suf = []
for i in range(q):
if queries[i][0] == "1":
continue
elif queries[i][0] == "2":
if queries[i][1] == "1":
if one_counts[i] % 2 == 0:
pre.insert(0, queries[i][2])
else:
suf.append(queries[i][2])
elif queries[i][1] == "2":
if one_counts[i] % 2 == 0:
suf.append(queries[i][2])
else:
pre.insert(0, queries[i][2])
print(("".join(pre + s + suf)))
|
s = list(input().strip())
q = int(input().strip())
queries = []
one_count = 0
one_counts = []
for i in range(q):
inp = input().split()
queries.append(inp)
if inp[0] == "1":
one_count += 1
one_counts.append(one_count)
one_counts = list([(one_count - x) for x in one_counts])
if one_count % 2 == 1:
s = s[::-1]
pre = []
suf = []
for i in range(q):
if queries[i][0] == "1":
continue
elif queries[i][0] == "2":
if queries[i][1] == "1":
if one_counts[i] % 2 == 0:
pre.append(queries[i][2])
else:
suf.append(queries[i][2])
elif queries[i][1] == "2":
if one_counts[i] % 2 == 0:
suf.append(queries[i][2])
else:
pre.append(queries[i][2])
print(("".join(pre[::-1] + s + suf)))
|
p02756
|
import sys
def ep(*params):
print(*params,file=sys.stderr)
l = ''
r = ''
S = input().rstrip()
Q = int(input())
mode = 0
for _ in range(Q):
ope = list(input().split())
if ope[0] == '1':
mode = (mode + 1)%2
else:
op = (int(ope[1]) + mode)%2
if op == 1:
l += ope[2]
else:
r += ope[2]
print(mode,l[::-1],S,r,sep=":",file=sys.stderr)
if mode == 0:
print(l[::-1],S,r,sep="")
else:
print(r[::-1],S[::-1],l,sep="")
|
import sys
def ep(*params):
print(*params,file=sys.stderr)
l = ''
r = ''
S = input().rstrip()
Q = int(input())
mode = 0
for _ in range(Q):
ope = list(input().split())
if ope[0] == '1':
mode = (mode + 1)%2
else:
op = (int(ope[1]) + mode)%2
if op == 1:
l += ope[2]
else:
r += ope[2]
#print(mode,l[::-1],S,r,sep=":",file=sys.stderr)
if mode == 0:
print(l[::-1],S,r,sep="")
else:
print(r[::-1],S[::-1],l,sep="")
|
p02756
|
S=__import__('collections').deque(input())
for _ in range(int(input())):
T=input()
if T<'2':S.reverse()
else:(S.appendleft if T[2]<'2'else S.append)(T[4])
print(*S,sep='')
|
S,f=__import__('collections').deque(input()),0
for _ in range(int(input())):
T=input()
if T<'2':f=1-f
else:(S.appendleft if (T[2]<'2')^f else S.append)(T[4])
if f:S.reverse()
print(*S,sep='')
|
p02756
|
s = input()
n = int(input())
rev = 0
for i in range(n):
q = input().split()
if q[0] == '1':
rev = (rev + 1) % 2
else:
head = int(q[1]) % 2
if head ^ rev:
s = q[2] + s
else:
s += q[2]
print(s[::-1]) if rev else print(s)
|
s = input()
n = int(input())
rev = 0
sh = ''
for i in range(n):
q = input().split()
if q[0] == '1':
rev = (rev + 1) % 2
else:
head = int(q[1]) % 2
if head ^ rev:
sh += q[2]
# print('sh', sh)
else:
s += q[2]
# print('s', s)
ans = sh[::-1] + s
print(ans[::-1]) if rev else print(ans)
|
p02756
|
import sys
from collections import deque
S=input()
Q=eval(input())
Query=[ sys.stdin.readline().split() for _ in range(Q) ]
s1=deque()
s2=deque()
judge={}
judge["front"]="s1"
judge["end"]="s2"
cnt=0
for x in Query:
if x[0]=="1":
n=x[0]
cnt+=1
elif x[0]=="2":
n,f,c=x[0],x[1],x[2]
if n=="1":
judge["front"],judge["end"]=judge["end"],judge["front"]
elif n=="2":
if f=="1":
if judge["front"]=="s1":
s1.appendleft(c)
elif judge["front"]=="s2":
s2.append(c)
elif f=="2":
if judge["end"]=="s1":
s1.appendleft(c)
if judge["end"]=="s2":
s2.append(c)
str1=""
for x in s1:
str1+=x
str2=""
for x in s2:
str2+=x
if judge["front"]=="s1" and judge["end"]=="s2":
print(str1+S+str2)
elif judge["front"]=="s2" and judge["end"]=="s1":
print(str2[::-1]+S[::-1]+str1[::-1])
|
# -*- coding: utf-8 -*-
import sys
from collections import deque
S=sys.stdin.readline().strip()
Q=int(sys.stdin.readline().strip())
cnt=0 #反転した回数
deq1=deque()
deq2=deque()
for _ in range(Q):
t=sys.stdin.readline().split()
if t[0]=="1": #反転
cnt+=1 #反転回数をカウント
elif t[0]=="2": #文字列挿入
qtype,front_or_back,c=t[0],int(t[1]),t[2]
if cnt%2==0: #反転回数が偶数の場合
if front_or_back==1: #前に足す
deq1.appendleft(c)
elif front_or_back==2: #後ろに足す
deq2.append(c)
else: #反転回数が奇数の場合
if front_or_back==1: #前に足す
deq2.append(c) #反転しているので、deq2が前に来ている
elif front_or_back==2: #後ろに足す
deq1.appendleft(c) #反転しているので、deq1が前に来ている
s_deq1=""
for x in deq1:
s_deq1+=x
s_deq2=""
for x in deq2:
s_deq2+=x
if cnt%2==0: #反転回数が偶数の場合
print(s_deq1+S+s_deq2)
else: #反転回数が奇数の場合
print(s_deq2[::-1]+S[::-1]+s_deq1[::-1])
|
p02756
|
from collections import deque
S=input()
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
ans=deque(S)
for i,q in enumerate(query):
if len(q)==1:
ans.reverse()
else:
_,f,c=q
if f=='1':
ans.appendleft(c)
else:
ans.append(c)
print(*ans,sep='')
|
from collections import deque
S=input()
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
ans=deque(S)
reverse=False
for i,q in enumerate(query):
if len(q)==1:
reverse=not reverse
else:
_,f,c=q
if (f=='2') ^ reverse:
ans.append(c)
else:
ans.appendleft(c)
if reverse:
print(*reversed(ans),sep='')
else:
print(*ans,sep='')
|
p02756
|
from collections import deque
S=input()
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
ans=deque(S)
reverse=False
for i,q in enumerate(query):
if len(q)==1:
reverse=not reverse
else:
_,f,c=q
if (f=='2') ^ reverse:
ans.append(c)
else:
ans.appendleft(c)
if reverse:
print(*reversed(ans),sep='')
else:
print(*ans,sep='')
|
from collections import deque
S=input()
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
d=deque(S)
reverse=False
for q in query:
if len(q)==1:
reverse=not reverse
else:
_,f,c=q
if f=='1':
d.append(c) if reverse else d.appendleft(c)
else:
d.appendleft(c) if reverse else d.append(c)
print(*reversed(d),sep='') if reverse else print(*d,sep='')
|
p02756
|
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
a, *ret = sys.stdin.readline().rstrip()
ret.insert(0, a)
Q = int(sys.stdin.readline().rstrip())
for q in range(Q):
line = sys.stdin.readline().split()
if line[0] == '1':
ret.reverse()
elif line[0] == '2' and line[1] == '1':
ret.insert(0, line[2])
else:
ret.append(line[2])
print(("".join(ret)))
if __name__ == '__main__':
main()
|
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
ret = sys.stdin.readline().rstrip()
Q = int(sys.stdin.readline().rstrip())
m = ""
u = ""
r = 0
for q in range(Q):
line = sys.stdin.readline().split()
if line[0] == '1':
m, u = u, m
r ^= 1
elif line[0] == '2' and line[1] == '1':
m += line[2]
else:
u += line[2]
if r == 0:
print((m[::-1] + ret[::1] + u))
else:
print((m[::-1] + ret[::-1] + u))
if __name__ == '__main__':
main()
|
p02756
|
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
def show(*inp, end='\n'):
if show_flg:
print(*inp, end=end)
YNL = {False: 'No', True: 'Yes'}
YNU = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False
# show_flg = True
def main():
st = S()
Q = I()
queries = []
# print(st[0])
s = [st[i] for i in range(len(st))]
for i in range(Q):
queries.append(list(MS()))
op = True
for i in range(Q):
query = queries[i]
if len(query) == 1:
op = not op
else:
if (query[1] == '1' and op is True) or (query[1] == '2' and op is False):
s.insert(0, query[2])
elif (query[1] == '1' and op is False) or (query[1] == '2' and op is True):
s.append(query[2])
else:
exit(-1)
return
if op is True:
print(''.join(s))
else:
print(''.join(s[::-1]))
if __name__ == '__main__':
main()
|
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
def show(*inp, end='\n'):
if show_flg:
print(*inp, end=end)
YNL = {False: 'No', True: 'Yes'}
YNU = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False
# show_flg = True
def main():
st = S()
Q = I()
queries = []
# print(st[0])
# s = [st[i] for i in range(len(st))]
s = deque()
for i in range(len(st)):
s.append(st[i])
for i in range(Q):
queries.append(list(MS()))
op = True
for i in range(Q):
query = queries[i]
if len(query) == 1:
op = not op
else:
if (query[1] == '1' and op is True) or (query[1] == '2' and op is False):
s.appendleft(query[2])
elif (query[1] == '1' and op is False) or (query[1] == '2' and op is True):
s.append(query[2])
else:
exit(-1)
return
# print(op)
if op is True:
print(''.join(s))
else:
n = []
while len(s):
n.append(s.pop())
print(''.join(n))
if __name__ == '__main__':
main()
|
p02756
|
from collections import deque
S = deque(list(input().strip()))
Q = int(eval(input()))
cnt = 0
for _ in range(Q):
q = list(input().split())
if int(q[0])==1:
cnt += 1
else:
if cnt%2==0:
if int(q[1])==1:
S.appendleft(q[2])
else:
S.append(q[2])
else:
if int(q[1])==1:
S.append(q[2])
else:
S.appendleft(q[2])
if cnt%2==0:
print(("".join(S)))
else:
x=""
for i in range(len(S)-1,-1,-1):
x += S[i]
print(x)
|
from collections import deque
S = deque(list(input().strip()))
Q = int(eval(input()))
cnt = 0
for _ in range(Q):
q = list(input().split())
if int(q[0])==1:
cnt += 1
else:
if cnt%2==0:
if int(q[1])==1:
S.appendleft(q[2])
else:
S.append(q[2])
else:
if int(q[1])==1:
S.append(q[2])
else:
S.appendleft(q[2])
if cnt%2==0:
print(("".join(S)))
else:
S.reverse()
print(("".join(S)))
|
p02756
|
from collections import deque
S = deque(list(input().strip()))
Q = int(eval(input()))
cnt = 0
for i in range(Q):
q = list(input().split())
if len(q)==1:
cnt += 1
else:
F = int(q[1])
C = q[2]
if cnt%2==0:
if F==1:
S.appendleft(C)
else:
S.append(C)
else:
if F==1:
S.append(C)
else:
S.appendleft(C)
if cnt%2==0:
print(("".join(S)))
else:
S = list(S)[::-1]
print(("".join(S)))
|
from collections import deque
S = deque(list(input().strip()))
Q = int(eval(input()))
P = 0
for _ in range(Q):
q = list(input().split())
if q[0]=="1":
P += 1
P = P%2
else:
c = q[2]
if q[1]=="1":
if P==0:
S.appendleft(c)
else:
S.append(c)
else:
if P==0:
S.append(c)
else:
S.appendleft(c)
if P==1:
S = list(S)
S = S[::-1]
print(("".join(S)))
|
p02756
|
from collections import deque
S = deque(list(input().strip()))
Q = int(eval(input()))
P = 0
for _ in range(Q):
q = list(input().split())
if q[0]=="1":
P += 1
P = P%2
else:
c = q[2]
if q[1]=="1":
if P==0:
S.appendleft(c)
else:
S.append(c)
else:
if P==0:
S.append(c)
else:
S.appendleft(c)
if P==1:
S = list(S)
S = S[::-1]
print(("".join(S)))
|
S = input().strip()
Q = int(eval(input()))
ind = 1
x = []
y = []
for i in range(Q):
q = list(input().split())
if len(q)==1:
ind = ind*(-1)
else:
if q[1]=="1":
if ind>0:
x.append(q[2])
else:
y.append(q[2])
else:
if ind>0:
y.append(q[2])
else:
x.append(q[2])
if ind>0:
x = x[::-1]
S = "".join(x)+S+"".join(y)
else:
S = S[::-1]
y = y[::-1]
S = "".join(y)+S+"".join(x)
print(S)
|
p02756
|
import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import deque
def resolve():
S = input()
Q = int(input())
Query = [input().split() for _ in range(Q)]
S_deque = deque()
for s in S:
S_deque.append(s)
for q in Query:
if q[0]=='1':
S_deque.reverse()
elif q[0]=='2':
if q[1]=='1':
S_deque.appendleft(q[2])
elif q[1]=='2':
S_deque.append(q[2])
print(*S_deque, sep='')
if __name__ == '__main__':
resolve()
|
import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import deque
def resolve():
S = input()
Q = int(input())
Query = [input().split() for _ in range(Q)]
S_deque = deque()
for s in S:
S_deque.append(s)
is_reversed = False
for q in Query:
if q[0]=='1':
is_reversed = not is_reversed
elif q[0]=='2':
if (not is_reversed and q[1]=='1') or (is_reversed and q[1]=='2'):
S_deque.appendleft(q[2])
else:
S_deque.append(q[2])
if is_reversed:
S_deque.reverse()
print(*S_deque, sep='')
if __name__ == '__main__':
resolve()
|
p02756
|
from collections import deque
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(eval(input()))
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
if f:
f = False
else:
f = True
else:
f_i = int(q[1])
if f_i == 1:
if f:
ans.appendleft(q[2])
else:
ans.append(q[2])
else:
if f:
ans.append(q[2])
else:
ans.appendleft(q[2])
ans = list(ans)
if f:
print(("".join(ans)))
else:
print(("".join(ans[::-1])))
|
from collections import deque
import sys
input = sys.stdin.readline
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(eval(input()))
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
f = not f
else:
f_i = int(q[1])
if (f_i == 1) ^ f:
ans.append(q[2])
else:
ans.appendleft(q[2])
ans = "".join(list(ans))
if not f:
ans = ans[::-1]
print(ans)
|
p02756
|
from sys import stdin
from collections import deque
# not AC
# def get_result(data):
# S, Q = data[0][0], int(data[1][0])
# for i in range(Q):
# if data[i+2][0] == '1':
# S = S[::-1]
# else:
# F, C = data[i+2][1], data[i+2][2]
# if F == '1':
# S = C + S
# else:
# S = S + C
# return S
def get_result(data):
S, Q = data[0][0], int(data[1][0])
# 文字列と反転状況を別で判断する
ans = deque(S)
cnt = 0
for i in range(Q):
if data[i+2][0] == '1':
cnt += 1
else:
F, C = data[i+2][1], data[i+2][2]
if F == '1':
if cnt % 2 == 0:
ans.appendleft(C)
else:
ans.append(C)
else:
if cnt % 2 == 0:
ans.append(C)
else:
ans.appendleft(C)
if cnt % 2 == 1:
ans = ''.join(reversed(ans))
else:
ans = ''.join(ans)
return ans
if __name__ == '__main__':
raw_data = [val.rstrip('\n') for val in stdin.readlines()]
data = [list(map(str, val.split(' '))) for val in raw_data]
result = get_result(data)
print(result)
|
from sys import stdin
from collections import deque
# not AC
# def get_result(data):
# S, Q = data[0][0], int(data[1][0])
# for i in range(Q):
# if data[i+2][0] == '1':
# S = S[::-1]
# else:
# F, C = data[i+2][1], data[i+2][2]
# if F == '1':
# S = C + S
# else:
# S = S + C
# return S
def get_result(data):
S, Q = data[0][0], int(data[1][0])
# 文字列と反転状況を別で判断する
ans = deque(S)
cnt = 0
for i in range(Q):
if data[i+2][0] == '1':
cnt += 1
else:
F, C = data[i+2][1], data[i+2][2]
if F == '1':
if cnt % 2 == 0:
# 前に追加
ans.appendleft(C)
else:
ans.append(C)
else:
if cnt % 2 == 0:
ans.append(C)
else:
ans.appendleft(C)
ans = ''.join(ans)
if cnt % 2 == 1:
ans = ans[::-1]
return ans
if __name__ == '__main__':
raw_data = [val.rstrip('\n') for val in stdin.readlines()]
data = [list(map(str, val.split(' '))) for val in raw_data]
result = get_result(data)
print(result)
|
p02756
|
import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log
from collections import Counter, defaultdict
from operator import itemgetter
INF = float('inf'); MOD = 10**9+7
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(MI())
def LIR(n): return [LI() for i in range(n)]
def S(): return input().rstrip()
def LIR(n): return [S().split() for i in range(n)]
def main():
s = S()
Q = I()
Qu = LIR(Q)
mode = 0; left = ''; right = ''
for que in Qu:
if que[0] == '1': mode = (mode+1)%2
else:
if mode:
if que[1] == '1': s = ''.join([s, que[2]])
else: s = ''.join([que[2], s])
else:
if que[1] == '1': s = ''.join([que[2], s])
else: s = ''.join([s, que[2]])
if mode: print((s[::-1]))
else: print(s)
if __name__ == '__main__':
main()
|
import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log
from collections import Counter, defaultdict, deque
from operator import itemgetter
INF = float('inf'); MOD = 10**9+7
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(MI())
def LIR(n): return [LI() for i in range(n)]
def S(): return input().rstrip()
def LIR(n): return [S().split() for i in range(n)]
def main():
s = S(); Q = I()
mode = 2
d = deque(s)
for i in range(Q):
query = S()
if query[0] == "1": mode = 3 - mode
else:
t, f, c = list(map(str, query.split()))
if (int(f) + mode)% 2 == 0: d.append(c)
else: d.appendleft(c)
if mode == 2: print((''.join(d)))
else: print((''.join(list(d)[::-1])))
if __name__ == '__main__':
main()
|
p02756
|
import sys
from collections import deque
s = list(sys.stdin.readline().rstrip())
q = int(sys.stdin.readline())
s = deque(s)
for _ in range(q):
query = sys.stdin.readline().split()
if len(query) == 1:
s.reverse()
elif query[1] == '1':
s.appendleft(query[2])
else:
s.append(query[2])
print((''.join(s)))
|
import sys
from collections import deque
s = list(sys.stdin.readline().rstrip())
q = int(sys.stdin.readline())
head = 0
s = deque(s)
for _ in range(q):
query = sys.stdin.readline().split()
if len(query) == 1:
head = 1 if head == 0 else 0
elif (query[1] == '1' and head == 1) or (query[1] == '2' and head == 0):
s.append(query[2])
else:
s.appendleft(query[2])
if head == 1:
s.reverse()
print((''.join(s)))
|
p02756
|
s,_,*q=open(0)
a=['','']
p=1
for q in q:
p^=q[0]<'2'
a[(q<'2 2')^p]+=q[-2]*(q[0]>'1')
print((a[p^1][::-1]+s[:-1][::p or-1]+a[p]))
|
s,_,*q=open(0)
a=['','']
p=1
for q in q:
p^=q<'2'
a[(q<'2 2')^p]+=q[-2]*(q>'2')
print((a[p^1][::-1]+s[:-1][::p or-1]+a[p]))
|
p02756
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.