input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
X, K, D = [int(a) for a in list(input().split())]
X = abs(X)
for i in range(X//D):
X -= D
K -= 1
if K == 0:
print((abs(X)))
exit()
if K % 2 == 0:
print(X)
else:
print((abs(X-D)))
|
X, K, D = [int(a) for a in list(input().split())]
X = abs(X)
q = X//D
r = X%D
if q >= K:
print((X - D*K))
exit()
rem = K - q
if rem % 2 == 0:
print(r)
else:
print((abs(D-r)))
|
p02584
|
X, K, D = list(map(int, input().split()))
for i in range(K):
if (abs(X) > D):
X = abs(X) - D
else:
if ((K - i) % 2 == 0):
break
else:
X = X - D
break
print((abs(X)))
|
X, K, D = list(map(int, input().split()))
syou = abs(X) // D
if (K > syou):
K = K - syou
if ((K % 2) == 0):
print((abs(abs(X) - D * syou)))
else:
print((abs(abs(X)-D*(syou+1))))
else:
print((abs(abs(X)-D*K)))
|
p02584
|
# -*- coding: utf-8 -*-
x,k,d=list(map(int,input().split()))
m=abs(x)
n=0
for i in range(k):
if x<0:
x+=d
else:
x-=d
if abs(x)<m:
m=abs(x)
else:
n=k-i
break
if n%2==0:
print(m)
else:
print((abs(x)))
|
# -*- coding: utf-8 -*-
x,k,d=list(map(int,input().split()))
m=abs(x)
n=m//d
j=k-n
if j>0:
if x<0:
if j%2==0:
x+=d*n
else:
x+=d*(n+1)
else:
if j%2==0:
x-=d*n
else:
x-=d*(n+1)
else:
if x<0:
x+=d*k
else:
x-=d*k
print((abs(x)))
|
p02584
|
X,K,D=list(map(int,input().split()))
i=0
count=0
if X<0:
if X+K*D<=0:
print((abs(X+K*D)))
count+=1
else:
L=X+i*D
while L<=0:
i+=1
L=X+i*D
if abs(L)>=abs(X+(i+1)*D):
i+=1
L=abs(X+i*D)
else:
if X-K*D>=0:
print((abs(X-K*D)))
count+=1
else:
L=X-i*D
while L>=0:
i+=1
L=X-i*D
if abs(L)>=abs(X-(i-1)*D):
i-=1
L=abs(X-i*D)
if count==0:
kaisuu=K-i
if kaisuu%2==0:
print((abs(L)))
else:
a=abs(L+D)
b=abs(L-D)
if a<=b:
print(a)
else:
print(b)
|
X,K,D=list(map(int,input().split()))
X=abs(X)
count=0
if X-K*D>=0:
print((X-K*D))
else:
s=int(X/D)
kaisuu=K-s
if kaisuu%2==0:
print((abs(X-s*D)))
else:
print((abs(X-(s+1)*D)))
|
p02584
|
x,k,d = list(map(int, input().split()))
x_min = abs(x)
for i in range(k):
if x < 0:
x += d
if abs(x) < x_min:
x_min = abs(x)
else:#xが0以上
if (k - i - 1) % 2 == 1:
break
else:
x_min = d - x_min
break
else:
x -= d
if abs(x) < x_min:
x_min = abs(x)
else:#xが負
if (k - i - 1) % 2 == 1:
break
else:
x_min = d - x_min
break
print(x_min)
|
x,k,d = list(map(int, input().split()))
if x < 0:
x = -x
x_min = x
if x//d >= k:
x_min -= k * d
else:
x_min -= x//d * d
k -= x//d
if k % 2 == 1:
x_min = abs(x_min - d)
print(x_min)
#xが更新されてる！！
|
p02584
|
x, k, d = list(map(int, input().split()))
if abs(x)-d*k>=0:
print((abs(x)-d*k))
exit()
num = 0
while k>0:
s = abs(x)
s = s-d
if abs(s)>=abs(x):
break
x = abs(s)
k -= 1
if k == 0:
print((abs(s)))
exit()
if k%2 == 0:
print((abs(x)))
else:
print((abs(s)))
|
x, k, d = list(map(int, input().split()))
n = abs(x)//d
if n>=k:
print((abs(x)-d*k))
else:
if (k-n)%2 == 0:
print((abs(abs(x)-d*n)))
else:
print((abs(abs(x)-d*(n+1))))
|
p02584
|
x,k,d=list(map(int,input().split()))
m=0
p=0
eo=k
ans=x
for i in range(1,k+1):
m,p=abs(ans-d),abs(ans+d)
ans=min(m,p)
if ans<=d:
eo=i
break
if (k-eo)%2==0 and eo<k:
print(ans)
elif (k-eo)%2==1 and eo<k:
print((abs(ans-d)))
else:
print(ans)
|
x,k,d=list(map(int,input().split()))
if abs(x)-k*d>=0:
print((abs(x)-k*d))
else:
xx,kk=abs(x)-d*(abs(x)//d),k-(abs(x)//d)
if kk%2==0:
print((abs(xx)))
else:
print((abs(xx-d)))
|
p02584
|
import os
import sys
from io import BytesIO, IOBase
def main():
x,k,d = list(map(int,input().split()))
t = x//d
if t<=k and x<0:
x+=t*d
k-=t
elif t<=k and x>0:
x-=t*d
k-=t
elif t>k and x<0:
x+=k*d
k-=k
elif t>k and x>0:
x-=k*d
k-=k
while k:
if x<0:
if x+d<0:
x+=d
elif abs(x+d)<=abs(x) and (k-1)%2 == 0:
print((abs(x+d)))
break
elif abs(x+d)<=abs(x) and (k-1)%2 != 0:
print((abs(x)))
break
elif abs(x+d)>=abs(x) and (k)%2 == 0:
print((abs(x)))
break
elif abs(x+d)>=abs(x) and (k)%2 != 0:
print((abs(x+d)))
break
else:
if x-d>0:
x-=d
elif abs(x-d)<=abs(x) and (k-1)%2 == 0:
print((abs(x-d)))
break
elif abs(x-d)<=abs(x) and (k-1)%2 != 0:
print((abs(x)))
break
elif abs(x-d)>=abs(x) and (k)%2 == 0:
print((abs(x)))
break
elif abs(x-d)>=abs(x) and (k)%2 != 0:
print((abs(x-d)))
break
k-=1
else:
print((abs(x)))
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
import collections
if __name__=='__main__':
main()
##
##
|
import os
import sys
from io import BytesIO, IOBase
def main():
x,k,d = list(map(int,input().split()))
t = abs(x)//d
if t<=k and x<0:
x+=t*d
k-=t
elif t<=k and x>0:
x-=t*d
k-=t
elif t>k and x<0:
x+=k*d
k-=k
elif t>k and x>0:
x-=k*d
k-=k
while k:
if x<0:
if x+d<0:
x+=d
elif abs(x+d)<=abs(x) and (k-1)%2 == 0:
print((abs(x+d)))
break
elif abs(x+d)<=abs(x) and (k-1)%2 != 0:
print((abs(x)))
break
elif abs(x+d)>=abs(x) and (k)%2 == 0:
print((abs(x)))
break
elif abs(x+d)>=abs(x) and (k)%2 != 0:
print((abs(x+d)))
break
else:
if x-d>0:
x-=d
elif abs(x-d)<=abs(x) and (k-1)%2 == 0:
print((abs(x-d)))
break
elif abs(x-d)<=abs(x) and (k-1)%2 != 0:
print((abs(x)))
break
elif abs(x-d)>=abs(x) and (k)%2 == 0:
print((abs(x)))
break
elif abs(x-d)>=abs(x) and (k)%2 != 0:
print((abs(x-d)))
break
k-=1
else:
print((abs(x)))
# region fastio
##
##BUFSIZE = 8192
##
##
##class FastIO(IOBase):
## newlines = 0
##
## def __init__(self, file):
## self._fd = file.fileno()
## self.buffer = BytesIO()
## self.writable = "x" in file.mode or "r" not in file.mode
## self.write = self.buffer.write if self.writable else None
##
## def read(self):
## while True:
## b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
## if not b:
## break
## ptr = self.buffer.tell()
## self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
## self.newlines = 0
## return self.buffer.read()
##
## def readline(self):
## while self.newlines == 0:
## b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
## self.newlines = b.count(b"\n") + (not b)
## ptr = self.buffer.tell()
## self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
## self.newlines -= 1
## return self.buffer.readline()
##
## def flush(self):
## if self.writable:
## os.write(self._fd, self.buffer.getvalue())
## self.buffer.truncate(0), self.buffer.seek(0)
##
##
##class IOWrapper(IOBase):
## def __init__(self, file):
## self.buffer = FastIO(file)
## self.flush = self.buffer.flush
## self.writable = self.buffer.writable
## self.write = lambda s: self.buffer.write(s.encode("ascii"))
## self.read = lambda: self.buffer.read().decode("ascii")
## self.readline = lambda: self.buffer.readline().decode("ascii")
##
##
##sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
##input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
import collections
if __name__=='__main__':
main()
##
##
|
p02584
|
N, K = list(map(int ,input().split(' ')))
P = list(map(int ,input().split(' ')))
P_set = [ P[i:i+K] for i in range(0, len(P)) if len(P[i:i+K])==K]
E = []
for dices in P_set:
E.append(sum([sum([i for i in range(1,dice+1)]) / float(dice) for dice in dices]))
print(('{:.12f}'.format(max(E))))
|
N, K = list(map(int ,input().split(' ')))
P = list(map(int ,input().split(' ')))
dct = {}
for i in range(0, len(P)):
if len(P[i:i+K])==K:
p_k = P[i:i+K]
dct[sum(p_k)] = p_k
E = sum([sum([i for i in range(1,dice+1)]) / dice for dice in dct[max(dct)]])
print(('{:.12f}'.format(E)))
|
p02780
|
N, K = list(map(int ,input().split(' ')))
P = list(map(int ,input().split(' ')))
dct = {}
for i in range(0, len(P)):
if len(P[i:i+K])==K:
p_k = P[i:i+K]
dct[sum(p_k)] = p_k
E = sum([sum([i for i in range(1,dice+1)]) / dice for dice in dct[max(dct)]])
print(('{:.12f}'.format(E)))
|
N, K = list(map(int ,input().split(' ')))
P = list(map(int ,input().split(' ')))
max_k = 0
max_v = []
for i in range(0, len(P)):
if len(P[i:i+K])==K:
p_k = P[i:i+K]
if max_k<=sum(p_k):
max_k=sum(p_k)
max_v=p_k
E = sum([sum([i for i in range(1,dice+1)]) / dice for dice in max_v])
print(('{:.12f}'.format(E)))
|
p02780
|
import math
n,k = input().split()
p = input().split()
n = int(n)
k = int(k)
ex =0
ext = []
ext2 = []
for f in range(n):
xs = list(range(1,int(p[f])+1))
xs = sum(xs)*1/int(p[f])
ext.append(xs)
ext2.append(ext[0])
for i in range(1,n):
ext2.append(ext2[i-1]+ext[i])
ex = ext2[k-1]
for j in range(1,n-k+1):
ext3 =ext2[j+k-1]-ext2[j-1]
if ext3 > ex: ex = ext3
print(('{:.12f}'.format(ex)))
|
import math
n,k = input().split()
p = input().split()
n = int(n)
k = int(k)
#p = [int(s) for s in p]
#print(p)
ex =0
ext = []
ext2 = []
for f in range(n):
pi = int(p[f])
xs =(pi+1)/2
ext.append(xs)
ext2.append(ext[0])
for i in range(1,n):
ext2.append(ext2[i-1]+ext[i])
ex = ext2[k-1]
for j in range(1,n-k+1):
ext3 =ext2[j+k-1]-ext2[j-1]
if ext3 > ex: ex = ext3
print(('{:.12f}'.format(ex)))
|
p02780
|
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
pos = 0
saidai = 0
for i in range(N-K+1):
temp = sum(list([(x+1)/2 for x in p[i:i+K]]))
if saidai < temp:
saidai = temp
print(('{:.12f}'.format(saidai)))
|
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
now = sum(p[:K])
saidai = now
for i in range(K, N):
now -= p[i-K]
now += p[i]
if now > saidai:
saidai = now
print(('{:.12f}'.format((saidai + K)/2)))
|
p02780
|
import queue
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
for i in range(len(p)):
p[i] = p[i] + 1
queue = queue.Queue()
currentSum = 0
maxSum = 0
for i in range(len(p)):
currentSum = currentSum + p[i]
queue.put(p[i])
if i >= K:
currentSum = currentSum - queue.get()
if i >= K - 1:
maxSum = max(maxSum, currentSum)
print(("{:.12f}".format(maxSum / 2)))
|
import queue
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
queue = queue.Queue()
currentSum = 0
maxSum = 0
for i in range(len(p)):
currentSum = currentSum + p[i] + 1
queue.put(p[i] + 1)
if i >= K:
currentSum = currentSum - queue.get()
if i >= K - 1:
maxSum = max(maxSum, currentSum)
print(("{:.12f}".format(maxSum / 2)))
|
p02780
|
import queue
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
queue = queue.Queue()
currentSum = 0
maxSum = 0
for i in range(len(p)):
currentSum = currentSum + p[i] + 1
queue.put(p[i] + 1)
if i >= K:
currentSum = currentSum - queue.get()
if i >= K - 1:
maxSum = max(maxSum, currentSum)
print(("{:.12f}".format(maxSum / 2)))
|
from collections import deque
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
queue = deque()
currentSum = 0
maxSum = 0
for i in range(len(p)):
currentSum = currentSum + p[i] + 1
queue.append(p[i] + 1)
if i >= K:
currentSum = currentSum - queue.popleft()
if i >= K - 1:
maxSum = max(maxSum, currentSum)
print(("{:.12f}".format(maxSum / 2)))
|
p02780
|
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
max = 0
for i in range(N-K+1):
tmp = p[i]
# print("i:" + str(i))
for j in range(i+1,i+K):
tmp += p[j]
# print(tmp)
if(max < tmp):
max = tmp
maxStartIndex = i
ans = 0
for i in range(maxStartIndex, maxStartIndex+K):
sum = p[i] * (p[i]+1) / 2
ans += sum/p[i]
print(('{:.12f}'.format(ans)))
# 1 2 3
# 3 2 1
# n, n-1, n-2
# n(n + 1)/2
|
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
p_sum = [0]
max = 0
for i in range(len(p)):
p_sum.append(p_sum[i] + (p[i]+1)/2)
for i in range(K,N+1):
sum = p_sum[i] - p_sum[i-K]
if(max < sum):
max = sum
# for i in range(N-K+1):
# tmp = p[i]
# # print("i:" + str(i))
# for j in range(i+1,i+K):
# tmp += p[j]
# # print(tmp)
# if(max < tmp):
# max = tmp
# maxStartIndex = i
# ans = 0
# for i in range(maxStartIndex, maxStartIndex+K):
# sum = p[i] * (p[i]+1) / 2
# ans += sum/p[i]
print(('{:.12f}'.format(max)))
# 1 2 3
# 3 2 1
# n, n-1, n-2
# n(n + 1)/2
|
p02780
|
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
ki = [0]*1001
for i in range(1, 1001):
ki[i] = ki[i-1]+i
pp = []
for pa in p:
pp.append(ki[pa]/pa)
ans = 0
for i in range(n-k+1):
ans = max(ans, sum(pp[i:i+k]))
print(("{0:.12f}".format(ans)))
|
import itertools
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
ki = [0]*1001
for i in range(1, 1001):
ki[i] = ki[i-1]+i
pp = []
for pa in p:
pp.append(ki[pa]/pa)
# print(pp)
ppp = [0] + list(itertools.accumulate(pp))
# print(ppp)
ans = 0
for i in range(n-k+1):
# print(ppp[i+k]-ppp[i])
ans = max(ans, ppp[i+k]-ppp[i])
print(("{0:.12f}".format(ans)))
|
p02780
|
import sys
import math
from collections import deque
from collections import defaultdict
def main():
n, k = list(map(int,sys.stdin.readline().split()))
p = list(map(int,sys.stdin.readline().split()))
sum_max = 0
max_idx = 0
for i in range(n - k + 1):
max_tmp = 0
for j in range(k):
max_tmp += p[i+j]
if sum_max < max_tmp:
max_idx = i
sum_max = max_tmp
#print(max_idx)
ans = 0
for i in range(max_idx, max_idx + k):
ans += ((p[i] * (p[i] + 1)) / 2) / p[i]
print(("{:.12f}".format(ans)))
return 0
if __name__ == "__main__":
main()
|
import sys
import math
from collections import deque
from collections import defaultdict
def main():
n, k = list(map(int,sys.stdin.readline().split()))
p = list(map(int,sys.stdin.readline().split()))
sum_l = [0] * (n - k + 1)
for i in range(k):
sum_l[0] += p[i]
for i in range(1,n - k + 1):
sum_l[i] = sum_l[i - 1] - p[i - 1] + p[i + k - 1]
#print(sum_l)
max_idx = sum_l.index(max(sum_l))
#print(max_idx)
ans = 0
for i in range(max_idx, max_idx + k):
ans += ((p[i] * (p[i] + 1)) / 2) / p[i]
print(("{:.12f}".format(ans)))
return 0
if __name__ == "__main__":
main()
|
p02780
|
N,K = list(map(int,input().split()))
p = list(map(int,input().split()))
expectation=[]
E = []
#期待値
for t in p:
value = 0
for x in range(t+1):
value += x/t
E.append(value)
for t in range(N-(K-1)):
value = 0
for i in range(K):
value += E[t+i]
expectation.append(value)
output = sorted(expectation,reverse=True)
print((format(output[0],'.12f')))
|
N,K = list(map(int,input().split()))
p = list(map(int,input().split()))
E = []
value=0
#期待値の計算,累積和の計算
for P_i in p:
value += (1+P_i)/2
E.append(value)
flag = E[K-1]
#隣接するK項の計算
for k in range(K,N):
S = E[k] - E[k-K]
if flag < S:
flag = S
print((format(flag,'.12f')))
|
p02780
|
import math
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
INDEX = -1
MA = 0
for i in range((N - K + 1)//2):
M = 0
L = 0
for j in range(K):
M += P[i + j]
L += P[-1-i-j]
# print(L)
if M > MA:
MA = M
INDEX = i
if L > MA:
MA = L
INDEX = N-K-i
ans = 0
for i in range(K):
ans += P[i+INDEX] * (P[i+INDEX]+1) / (2*P[i+INDEX])
print(("{:.12f}".format(ans)))
|
import math
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
INDEX = 0
total = 0
for i in range(K):
total += P[i]
tmp = total
for i in range(N - K):
tmp = tmp - P[i] + P[i + K]
if tmp > total:
total = tmp
INDEX = i+1
# MA = 0
# for i in range(N - K + 1):
# M = 0
# for j in range(K):
# M += P[i + j]
# if M > MA:
# MA = M
# INDEX = i
ans = 0
for i in range(K):
ans += P[i+INDEX] * (P[i+INDEX]+1) / (2*P[i+INDEX])
print(("{:.12f}".format(ans)))
|
p02780
|
#python3
def f(x):
return (x+1)/2
def main():
n, k = list(map(int, input().split()))
fp = [f(int(i)) for i in input().split()]
n = len(fp)
v = sum(fp[0:k])
i = 0
ans = v
while i+k <= n-1:
v = v-fp[i]+fp[i+k]
ans = max(ans, v)
i+=1
a = "{0:.12f}".format(ans)
print(a)
main()
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def E(x):
return (x*(x+1)//2)/x
def main():
N, K = list(map(int, readline().split()))
e = [E(int(i)) for i in readline().split()]
s = [0.]
for i in range(N):
s.append(s[i]+e[i])
ans = 0.
for i in range(N-K+1):
ans = max(s[K+i]-s[i], ans)
print(('{:.12f}'.format(ans)))
if __name__ == '__main__':
main()
|
p02780
|
N,K = list(map(int,input().split()))
p = list(map(int,input().split()))
def exp(n):
if n % 2 == 0:
s = (n+1)*n/2
else:
s = (n+1)*(n-1)/2+(n+1)/2
ans = s / n
return ans
M = 0
for i in range(N-K+1):
S = 0
for j in range(K):
S += exp(p[i+j])
if M < S:
M = S
print(('{:.12f}'.format(M)))
|
N,K = list(map(int,input().split()))
p = list(map(int,input().split()))
def exp(n):
if n % 2 == 0:
s = (n+1)*n/2
else:
s = (n+1)*(n-1)/2+(n+1)/2
ans = s / n
return ans
q = []
for i in range(N):
q.append(exp(p[i]))
#print(q)
S = sum([q[i] for i in range(K)])
M = S
#print(M)
for i in range(N-K):
S = S - q[i] + q[K+i]
#print(S)
if S > M:
M = S
print(('{:.12f}'.format(M)))
|
p02780
|
import sys
input = sys.stdin.readline
"""
後ろから、到達不可能距離の集合を見ていきたい。
集合を持つと厳しいが、最小値だけ持っておけばよい。
"""
N,dist = list(map(int,input().split()))
D = [int(x) for x in input().split()]
# 各ターンの出発位置
start_dist = [dist]
for d in D:
x = start_dist[-1]
y = min(abs(x - d), x)
start_dist.append(y)
ng_dist = [None] * (N+1)
ng_dist[N] = 1
for i,d in enumerate(D[::-1]):
x = ng_dist[N-i]
y = x if x <= d//2 else x + d
ng_dist[N-i-1] = y
eval(input())
Q = [int(x) for x in input().split()]
answer = ['YES' if ng_dist[d] <= start_dist[d-1] else 'NO' for d in Q]
print(('\n'.join(answer)))
|
import sys
input = sys.stdin.readline
"""
後ろから、到達不可能距離の集合を見ていきたい。
集合を持つと厳しいが、最小値だけ持っておけばよい。
"""
N,dist = list(map(int,input().split()))
D = [int(x) for x in input().split()]
# 各ターンの出発位置
start_dist = [dist]
for d in D:
x = start_dist[-1]
y = x-d if x > d else d - x
start_dist.append(x if x < y else y)
ng_dist = [None] * (N+1)
ng_dist[N] = 1
for i,d in enumerate(D[::-1]):
x = ng_dist[N-i]
y = x if x <= d//2 else x + d
ng_dist[N-i-1] = y
eval(input())
Q = [int(x) for x in input().split()]
answer = ['YES' if ng_dist[d] <= start_dist[d-1] else 'NO' for d in Q]
print(('\n'.join(answer)))
|
p03743
|
N, D = list(map( int, input().split() ))
d = list( map( int, input().split() ) )
Q = int( eval(input()) )
q = list( map( int, input().split() ) )
dis = [ 0 for i in range( N + 1 ) ]
dis[ 0 ] = D
for i in range( N ):
dis[ i + 1 ] = min( dis[ i ], abs( dis[ i ] - d[ i ] ) )
dp = [ 0 for i in range( N + 1 ) ]
dp[ N ] = 1
for i in range( N - 1, -1, -1 ):
if dp[ i + 1 ] <= d[ i ] // 2:
dp[ i ] = dp[ i + 1 ]
else:
dp[ i ] = dp[ i + 1 ] + d[ i ]
for qi in range( Q ):
print(( [ "NO", "YES" ][ dis[ q[ qi ] - 1 ] >= dp[ q[ qi ] ] ] ))
|
N, D = list(map( int, input().split() ))
d = list( map( int, input().split() ) )
Q = int( eval(input()) )
q = list( [int( x ) - 1 for x in input().split()] )
dis = [ 0 for i in range( N + 1 ) ]
dis[ 0 ] = D
for i in range( N ):
dis[ i + 1 ] = min( dis[ i ], abs( dis[ i ] - d[ i ] ) )
dp = [ 0 for i in range( N + 1 ) ]
dp[ N ] = 1
for i in range( N - 1, -1, -1 ):
if dp[ i + 1 ] <= d[ i ] // 2:
dp[ i ] = dp[ i + 1 ]
else:
dp[ i ] = dp[ i + 1 ] + d[ i ]
for qi in range( Q ):
print(( [ "NO", "YES" ][ dis[ q[ qi ] ] >= dp[ q[ qi ] + 1 ] ] ))
|
p03743
|
n, D = list(map(int, input().split()))
x = list(map(int, input().split()))
Q = int(eval(input()))
q = list(map(int, input().split()))
ind = [D]
for i in range(n):
ind.append(min(ind[-1], abs(ind[-1] - x[i])))
#print(ind)
l = [1]
for i in range(n-1, -1, -1):
if x[i] < 2*l[-1]:
l.append(x[i] + l[-1])
else:
l.append(l[-1])
l = l[::-1]
for i in range(Q):
if l[q[i]] <= ind[q[i]-1]:
print("YES")
else:
print("NO")
|
n, D = list(map(int, input().split()))
x = list(map(int, input().split()))
Q = int(eval(input()))
q = list(map(int, input().split()))
ind = [D]
for i in range(n):
ind.append(min(ind[-1], abs(ind[-1] - x[i])))
l = [1]
for i in range(n-1, -1, -1):
if x[i] < 2*l[-1]:
l.append(x[i] + l[-1])
else:
l.append(l[-1])
l = l[::-1]
for i in range(Q):
if l[q[i]] <= ind[q[i]-1]:
print("YES")
else:
print("NO")
|
p03743
|
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
S = sr()
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
day = day[::-1]
i = day.index(S)
print((i+1))
|
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
S = sr()
days = 'SUN,MON,TUE,WED,THU,FRI,SAT'.split(',')
day_to_x = {x: 7 - i for i, x in enumerate(days)}
print((day_to_x[S]))
|
p02847
|
import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
d = collections.defaultdict(int)
d["SUN"] = 7
d["MON"] = 6
d["TUE"] = 5
d["WED"] = 4
d["THU"] = 3
d["FRI"] = 2
d["SAT"] = 1
print((d[str(readline().rstrip().decode('utf-8'))]))
if __name__ == '__main__':
solve()
|
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
d = {v: 7 - i for i, v in enumerate("SUN,MON,TUE,WED,THU,FRI,SAT".split(","))}
print((d[str(readline().rstrip().decode('utf-8'))]))
if __name__ == '__main__':
solve()
|
p02847
|
from sys import stdin
def b(input_string):
_s = input_string
s_length = len(_s)
s = []
for i in range(s_length):
s.append(_s[i])
#print(_s)
#print(s)
count = 0
flag = True
while flag and len(s) >= 2:
flag = False
for i in range(s_length):
if i < len(s)-1:
if s[i] != s[i+1]:
s.pop(i)
#print(s)
s.pop(i)
#print(s)
count += 2
flag = True
break
return count
def main():
input_line = stdin.readline().rstrip()
answer = b(input_line)
print(answer)
if __name__ == '__main__':
main()
|
from sys import stdin
def b(input_string):
_s = input_string
s_length = len(_s)
s = []
for i in range(s_length):
s.append(_s[i])
count = 0
i = 0
while(i < len(s)-1):
#print(s)
#print(i)
if s[i] != s[i+1]:
s.pop(i)
s.pop(i)
count += 2
if i != 0:
i -= 1
else:
i += 1
return count
def main():
input_line = stdin.readline().rstrip()
answer = b(input_line)
print(answer)
if __name__ == '__main__':
main()
|
p03107
|
S = input()
N = len(S)
count = 0
tmp = 1
dst = S
while True:
dst1 = dst.replace('01', '')
dst2 = dst1.replace('10', '')
if len(dst) - len(dst2) <= 0: break
count += len(dst) - len(dst2)
dst = dst2
print(count)
|
S = input()
print((min(S.count('1'), S.count('0')) * 2))
|
p03107
|
S=input().strip()
N=len(S)
q = [S]
while q:
s = q.pop()
p = ''
v = 0
for i,c in enumerate(s):
if (p == '0' and c == '1') or (p == '1' and c == '0'):
q.append(s[:i-1]+s[i+1:])
v += 1
p = c
if v == 0:
print((N-len(s)))
break
|
S=input().strip()
N=len(S)
a=[0 if x == '0' else 1 for x in S]
while True:
v = 0
p = -1
b = []
for i in a:
if p >= 0:
if p == 0 or p == 1:
if i == 0 or i == 1:
if p != i:
p = -1
v += 1
continue
b.append(p)
p = i
if p >= 0:
b.append(p)
if v == 0:
print((N - len(a)))
break
a = b
|
p03107
|
S = input()
S = str(S)
counter = 0
while True:
killer = 0
killer += int(S.count('10'))
S = S.replace('10','')
killer += int(S.count('01'))
S = S.replace('01','')
counter += int(killer)
if killer == 0:
break
print(counter * 2)
|
S = input()
S = str(S)
S_1 = int(S.count('1'))
S_0 = int(S.count('0'))
if S_1 > S_0:
print(S_0 * 2)
else:
print(S_1 * 2)
|
p03107
|
def compute():
from sys import stdin
S = stdin.readline().strip()
wew = []
for x in S:
if len(wew)>0 and wew[-1]!=x:
wew.pop()
else:
wew.append(x)
print((len(S) - len(wew)))
if __name__ == "__main__":
compute()
|
def compute():
from sys import stdin
S = stdin.readline().strip()
l = len(S)
x = S.count("1")
y = min(x, l-x)
print((y<<1))
if __name__ == "__main__":
compute()
|
p03107
|
S=input()
A=[s for s in S]
while True:
A_new=[]
i=0
while i<len(A):
if i<len(A)-1:
if A[i]!=A[i+1]:
i+=2
else:
A_new.append(A[i])
i+=1
else:
A_new.append(A[i])
i+=1
if A==A_new:
break
else:
A=A_new[:]
print(len(S)-len(A))
|
S=input()
A=[]
Ans=0
for i in range(len(S)):
if len(A)>0:
if A[-1]!=S[i]:
A.pop()
Ans+=2
else:
A.append(S[i])
else:
A.append(S[i])
print(Ans)
|
p03107
|
#!/usr/bin/env python3
import sys
def solve(S: str):
n = len(S)
while True:
l = len(S)
for i in range(len(S) - 1):
if S[i] != S[i + 1]:
S = S[:i] + S[i + 2:]
break
if l == len(S):
break
print((n - len(S)))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = str(next(tokens)) # type: int
solve(S)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
def solve(S: str):
n = len(S)
while True:
l = len(S)
i = 0
while True:
if i >= len(S) - 1:
break
if S[i] != S[i + 1]:
S = S[:i] + S[i + 2:]
i = max(i - 1, 0)
else:
i += 1
if l == len(S):
break
print((n - len(S)))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = str(next(tokens)) # type: int
solve(S)
if __name__ == '__main__':
main()
|
p03107
|
import re
bit_string = input()
replaced_count = 0
replaced_string = bit_string
while re.search('01|10', replaced_string):
replaced_string, tmp_count = re.subn('01|10', '', replaced_string)
replaced_count += tmp_count
print((replaced_count * 2))
|
bit_string = input()
count_zero = bit_string.count('0')
count_one = bit_string.count('1')
print((min(count_zero, count_one) * 2))
|
p03107
|
#!/usr/bin/env python3
import sys
def solve(S: str):
nS = len(S)
pS = ""
while pS != S:
pS = S
S = S.replace("01", "")
S = S.replace("10", "")
print((nS - len(S)))
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = next(tokens) # type: str
solve(S)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
def solve(S: str):
print((min(S.count("0"), S.count("1")) * 2))
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = next(tokens) # type: str
solve(S)
if __name__ == '__main__':
main()
|
p03107
|
S = input();
cnt = 0;
while True:
for i in range(len(S)):
tmp = S.replace('01', '', 1);
if S != tmp:
cnt += 2;
S = tmp;
break;
tmp = S.replace('10', '', 1);
if S != tmp:
cnt += 2;
S = tmp;
break;
if len(set(S)) <= 1:
break;
print(cnt);
|
S = input();
S1 = S.count('1');
S0 = S.count('0');
if S1 > S0:
print(S0 * 2);
else:
print(S1 * 2);
|
p03107
|
import sys
import re
s = sys.stdin.read().strip()
n = len(s)
while len(re.findall("10|01", s)) > 0:
s = re.sub("10|01", "", s)
print((n - len(s)))
|
import sys
s = sys.stdin.read().strip()
n = len(s)
print((2 * min(s.count("0"), s.count("1"))))
|
p03107
|
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]
s, = read_line(str)
s = [int(c) for c in s]
c = 0
while True:
i = 0
while i < len(s) - 1:
if s[i] != s[i + 1]:
s[i] = s[i + 1] = -1
i += 2
c += 2
i += 1
s = [c for c in s if c >= 0]
l = len([c for c in s if c == 0])
if l == 0 or l == len(s):
break
print(c)
|
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]
s, = read_line(str)
s = [int(c) for c in s]
c = 0
ss = 0
for i in range(0, len(s)):
if s[i] == 1:
if ss < 0:
c += 2
ss += 1
else:
if ss > 0:
c += 2
ss -= 1
print(c)
|
p03107
|
import sys
input = sys.stdin.readline
S=list(input().strip())
flag=True
cnt=0
i=0
f=[]
if len(S) != 1:
while flag:
if S[i] != S[i+1]:
f.append(i)
f.append(i+1)
i+=2
else:
i+=1
if i>=len(S)-1:
cnt+=len(f)
f.reverse()
for k in f:
S.pop(k)
f=[]
if '1' not in S or '0' not in S:
break
i=0
print(cnt)
|
import sys
input = sys.stdin.readline
S=list(input().strip())
zero=S.count('0')
one=S.count('1')
print((min(zero,one)*2))
|
p03107
|
def remove01Pair(R):
for i in range(len(R) - 1):
#print(i)
if R[i:i + 2] == '01':
R = R[:i] + R[i + 2:]
#print(R)
return R
flag[0] = 1
return R
def remove10Pair(R):
for i in range(len(R) - 1):
#print(i)
if R[i:i + 2] == '10':
R = R[:i] + R[i + 2:]
#print(R)
return R
flag[0] = 1
return R
N = input().strip()
#print(N)
length = len(N)
#print(length)
flag = []
flag.append(0)
while flag[0] == 0:
N = remove01Pair(N)
#print(N)
#time.sleep(1)
flag[0] = 0
while flag[0] == 0:
N = remove10Pair(N)
#print(N)
#time.sleep(1)
#print()
#print(len(N))
print((length - len(N)))
|
N = input().strip()
#print(N)
length = len(N)
#print(length)
totalZeros = 0
totalOnes = 0
for i in N:
if i == '0':
totalZeros += 1
else:
totalOnes += 1
if totalOnes < totalZeros:
answer = totalOnes * 2
else:
answer = totalZeros * 2
print(answer)
|
p03107
|
import sys
input = sys.stdin.readline
import re
def print_ans(S):
"""Test Case
>>> print_ans("0011")
4
>>> print_ans("11011010001011")
12
>>> print_ans("0")
0
"""
flg = True
ans = 0
while flg:
tmp = re.sub(r"01|10", "", S)
if len(tmp) == len(S):
flg = False
break
else:
ans += len(S) - len(tmp)
S = tmp
print(ans)
if __name__ == '__main__':
S = input().rstrip()
print_ans(S)
|
import sys
input = sys.stdin.readline
import re
def print_ans(S):
"""Test Case
>>> print_ans("0011")
4
>>> print_ans("11011010001011")
12
>>> print_ans("0")
0
"""
flg = True
ans = 0
# while flg:
# tmp = re.sub(r"01|10", "", S)
# if len(tmp) == len(S):
# flg = False
# break
# else:
# ans += len(S) - len(tmp)
# S = tmp
# print(ans)
list_0 = []
list_1 = []
for s in S:
if s =="0":
list_0.append(s)
else:
list_1.append(s)
print((min(len(list_0), len(list_1)) * 2))
if __name__ == '__main__':
S = input().rstrip()
print_ans(S)
|
p03107
|
# -*- coding: utf-8 -*-
S = input().strip()
#-----
cnt=0
while (S.count("01") != 0) or (S.count("10") != 0):
cnt += S.count("01")
S = S.replace("01", "")
cnt += S.count("10")
S = S.replace("10", "")
print((cnt*2))
|
# -*- coding: utf-8 -*-
S = input().strip()
#-----
num_red = S.count("0")
num_blue = len(S) - num_red
print(( min(num_red,num_blue) * 2 ))
|
p03107
|
# -*- coding: utf-8 -*-
def main():
s = input().split(" ")
sl = list(s[0])
prev = -1
n = 0
while True:
# print(str(sl))
if len(sl) < 1:
break
kita = False
for i, c in enumerate(sl):
if i == 0 and prev != -1:
break
if (prev == 0 and c == '1') or (prev == 1 and c == '0'):
kita = True
# print("remove", i, prev, c)
del sl[i]
del sl[i-1]
n += 2
prev = -1
break
else:
kita = True
prev = int(c)
if not kita:
break
print(n)
main()
|
# -*- coding: utf-8 -*-
def main():
s = input().split(" ")
sl = list(s[0])
prev = -1
n = 0
i = 0
while True:
if len(sl) <= i:
break
if (prev == 0 and sl[i] == '1') or (prev == 1 and sl[i] == '0'):
# print(str(sl))
# print("remove", i, prev, sl[i])
del sl[i]
del sl[i-1]
n += 2
if i-2 < 0:
prev = -1
i = 0
else:
prev = int(sl[i-2])
i = i-1
else:
prev = int(sl[i])
i += 1
print(n)
main()
|
p03107
|
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
"""
a,b,c = LI()
print(min(b//a,c))
"""
#B
"""
a,b,k = LI()
i = 1
ans = [1]
while i <= min(a,b):
i += 1
if a%i == 0 and b%i == 0:
ans.append(i)
print(ans[-k])
"""
#C
s = list(map(int,S()))
print((2*min(sum(s),len(s)-sum(s))))
#D
"""
def root(x):
if par[x] == x:
return x
par[x] = root(par[x])
return par[x]
def unite(x,y):
x = root(x)
y = root(y)
if x == y:
ans.append(ans[-1])
return
sx = s[x]
sy = s[y]
if rank[x] < rank[y]:
par[x] = y
s[y] += sx
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
s[x] += sy
ans.append(ans[-1]+sx*sy)
n,m = LI()
v = LIR(m)
v = v[::-1]
par = [i for i in range(n)]
rank = [0 for i in range(n)]
s = [1 for i in range(n)]
ans = [0]
k = n*(n-1)//2
v.pop(-1)
for a,b in v:
if ans[0] == k:
ans.append(k)
continue
a -= 1
b -= 1
unite(a,b)
for i in ans[::-1]:
print(k-i)
"""
#E
"""
n,a,b = LI()
s = input()
ans = 0
i = 0
while i < n:
j = i+1
if s[i:j] in s[:i]:
while s[i:j] in s[:i]:
j += 1
if j >= n-1:break
ans += min(b,a*(j-i))
else:
ans += a*(j-i)
i = j
print(ans)
"""
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
|
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LS()
return l
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
s = S()
c = s.count("0")
print((2*min(c,len(s)-c)))
return
#B
def B():
return
#C
def C():
return
#D
def D():
return
#E
def E():
return
#F
def F():
return
#G
def G():
return
#H
def H():
return
#I
def I_():
return
#J
def J():
return
#Solve
if __name__ == "__main__":
A()
|
p03107
|
import sys
def solve():
input = sys.stdin.readline
zero, one = 0, 0
s = input().strip("\n")
for i in range(len(s)):
if s[i] == "0": zero += 1
else: one += 1
print((2 * min(zero, one)))
return 0
if __name__ == "__main__":
solve()
|
import sys
def solve():
input = sys.stdin.readline
S = input().strip("\n")
zero, one = 0, 0
for i in range(len(S)):
if S[i] == "0": zero += 1
else: one += 1
print((2 * min(zero, one)))
return 0
if __name__ == "__main__":
solve()
|
p03107
|
S = input().strip()
N = len(S)
k = 0
for i in range(N):
if S[i]=="0":
k += 1
m = min(k,N-k)
print((2*m))
|
S = input().strip()
N = len(S)
cnt = 0
for i in range(N):
if S[i]=="1":
cnt += 1
print((min(cnt,N-cnt)*2))
|
p03107
|
S = input().strip()
N = len(S)
cnt = 0
for i in range(N):
if S[i]=="1":
cnt += 1
print((min(cnt,N-cnt)*2))
|
S = input().strip()
cnt0 = 0
cnt1 = 0
for i in range(len(S)):
if S[i]=="0":
cnt0 += 1
else:
cnt1 += 1
print((min(cnt0,cnt1)*2))
|
p03107
|
import sys
fin = sys.stdin.readline
import copy
ob = list(fin())
for i in range(len(ob)-1):
if ob[i]=="0" and ob[i+1]=="1":
ob[i]="1"
ob[i+1]="0"
n = len(ob)
while True:
ob_sub = copy.copy(ob)
j=0
for i in range(len(ob)-1):
if ob[i]=="1" and ob[i+1]=="0":
ob_sub[i],ob_sub[i+1] = "#","#"
j+=2
for i in range(j):
ob_sub.remove("#")
if ob_sub == ob:
break
else:
ob = ob_sub
while True:
ob_sub = copy.copy(ob)
j=0
for i in range(len(ob)-1):
if ob[i]=="0" and ob[i+1]=="1":
ob_sub[i],ob_sub[i+1] = "#","#"
j+=2
for i in range(j):
ob_sub.remove("#")
if ob_sub == ob:
break
else:
ob = ob_sub
print((n-len(ob)))
|
import sys
fin = sys.stdin.readline
ob = list(fin())
print((min(ob.count("0"), ob.count("1"))*2))
|
p03107
|
s=input().count;print((min(s('0'),s('1'))*2))
|
print((min(list(map(input().count,'01')))*2))
|
p03107
|
# デバッグ用
GBN_DEBUG = False
GBN_DEBUG = True
def dprn(s, i):
if GBN_DEBUG: print(", " + s + " = " + str(i), end = "")
def dprns(s):
if GBN_DEBUG: print(", " + s, end = "")
def dprni(i):
if GBN_DEBUG: print(i, end=" ")
def endl():
if GBN_DEBUG: print('')
def puts(s): print(s)
#本体ここから
S = input()
#N = int(input())
#S, T = input().split()
#N, M = map(int, input().split())
#W = [input() for _ in range(N)]
#A = A = list(map(int, input().split()))
slen = len(S)
zero = 0
one = 0
for i in range(slen):
if S[i] == '0':
zero += 1
else:
one += 1
if (zero > one):
print(one * 2)
else:
print(zero * 2)
|
# デバッグ用
GBN_DEBUG = False
GBN_DEBUG = True
def dprn(s, i):
if GBN_DEBUG: print(", " + s + " = " + str(i), end = "")
def dprns(s):
if GBN_DEBUG: print(", " + s, end = "")
def dprni(i):
if GBN_DEBUG: print(i, end=" ")
def endl():
if GBN_DEBUG: print('')
def puts(s): print(s)
#本体ここから
S = input()
#N = int(input())
#S, T = input().split()
#N, M = map(int, input().split())
#W = [input() for _ in range(N)]
#A = list(map(int, input().split()))
zero = S.count('0')
one = S.count('1')
ans = min(zero, one) * 2
print(ans)
|
p03107
|
import sys
s = str(sys.stdin.readline())
o = len(s)
for i in range(1000000000000):
p1 = s.find("01")
p2 = s.find("10")
if p1 == -1 and p2 == -1:
break
elif p1 == -1:
i = p2
elif p2 == -1:
i = p1
else:
i = p1 if p1 < p2 else p2
s = s[:i] + s[i + 2:]
print((o - len(s)))
|
import sys
s = str(sys.stdin.readline())
c0 = s.count('0')
c1 = s.count('1')
r = c0 if c0 < c1 else c1
print((r*2))
|
p03107
|
l = input().split()
s = l[0]
def get_removals(s):
ret = []
for i in range(len(s) - 1):
if int(s[i]) + int(s[i + 1]) == 1:
ret.append(i)
return ret
def remove(s, index):
if index == 0:
return s[2:]
if index == (len(s) - 1):
return s[:index-1]
return s[0:index] + s[index + 2:]
num_removals = []
ones = 0
zeros = 0
for num in s:
if num == '0':
ones += 1
if num == '1':
zeros += 1
max_candidate = min(ones, zeros) * 2
def process(s, count):
removals = get_removals(s)
if len(removals) == 0:
num_removals.append(count)
if count == max_candidate:
print(max_candidate)
exit()
return
count += 2
max_remove = 0
ss = []
for removal in removals:
s1 = remove(s, removal)
ss.append(s1)
num_removes = len(get_removals(s1))
if max_remove < num_removes:
max_remove = num_removes
for s1 in set(ss):
if len(get_removals(s1)) == max_remove:
process(s1, count)
process(s, 0)
print((max(num_removals)))
|
l = input().split()
s = l[0]
def get_removals(s):
ret = []
for i in range(len(s) - 1):
if int(s[i]) + int(s[i + 1]) == 1:
ret.append(i)
return ret
def remove(s, index):
if index == 0:
return s[2:]
if index == (len(s) - 1):
return s[:index-1]
return s[0:index] + s[index + 2:]
num_removals = []
ones = 0
zeros = 0
for num in s:
if num == '0':
ones += 1
if num == '1':
zeros += 1
max_candidate = min(ones, zeros) * 2
def process(s, count):
removals = get_removals(s)
if len(removals) == 0:
num_removals.append(count)
if count == max_candidate:
print(max_candidate)
exit()
return
count += 2
max_remove = 0
ss = []
for removal in removals:
s1 = remove(s, removal)
ss.append(s1)
num_removes = len(get_removals(s1))
if max_remove < num_removes:
max_remove = num_removes
for s1 in set(ss):
if len(get_removals(s1)) == max_remove:
process(s1, count)
# process(s, 0)
print(max_candidate)
|
p03107
|
import copy
s = input().split()[0]
def get_kouho_list(box_list):
kouho_list = []
for i, color in enumerate(box_list[:-1]):
if box_list[i] != box_list[i+1]:
kouho_list.append((i, i+1))
return kouho_list
def tansaku(now_box_list, koremade_step):
kouho_list = get_kouho_list(now_box_list)
for kouho in kouho_list:
next_box_list = copy.copy(now_box_list)
del next_box_list[kouho[0]:kouho[1]+1]
tansaku(next_box_list, koremade_step + 1)
global max_step
if koremade_step > max_step:
max_step = koremade_step
return
max_step = 0
tansaku(list(s), 0)
print((max_step * 2))
|
import collections
s = input().split()[0]
counter = collections.Counter(list(s))
c_0 = counter['0']
c_1 = counter['1']
step = min(c_0, c_1)
print((step * 2))
|
p03107
|
from sys import stdin
import re
S = stdin.readline().rstrip()
before_S = S
while(True):
#after_S = S.replace("01", "").replace("10", "")
after_S = re.sub("(01)+|(10)+", "", S)
if len(after_S) != len(S):
S = after_S
else:
break
print((len(before_S) - len(S)))
|
from sys import stdin
S = stdin.readline().rstrip()
stack = []
count = 0
for s in S:
# スタックが空なら
if not stack:
stack.append(s)
# スタックの一番上がsでなければ
elif stack[-1] != s:
stack.pop()
count += 2
else:
stack.append(s)
print(count)
|
p03107
|
from itertools import chain
def f(s):
l = s.split('01')
for i in range(len(l)):
l[i] = l[i].split('10')
l = list(chain.from_iterable(l))
return l
s = input().rstrip()
count = 0
while True:
l = f(s)
if len(l) == 1:
break
count += (len(l) - 1) * 2
s = ''.join(l)
print(count)
|
s = input().rstrip()
print((2 * min(s.count('0'), s.count('1'))))
|
p03107
|
#!usr/bin/env python3
import sys
class Die:
def __init__(self, pips):
self.pips = pips
def move_die(self, direction):
tmp = int()
if direction == 'N':
tmp = self.pips[0]
self.pips[0] = self.pips[1]
self.pips[1] = self.pips[5]
self.pips[5] = self.pips[4]
self.pips[4] = tmp
del tmp
elif direction == 'S':
tmp = self.pips[0]
self.pips[0] = self.pips[4]
self.pips[4] = self.pips[5]
self.pips[5] = self.pips[1]
self.pips[1] = tmp
del tmp
elif direction == 'E':
tmp = self.pips[0]
self.pips[0] = self.pips[3]
self.pips[3] = self.pips[5]
self.pips[5] = self.pips[2]
self.pips[2] = tmp
del tmp
elif direction == 'W':
tmp = self.pips[0]
self.pips[0] = self.pips[2]
self.pips[2] = self.pips[5]
self.pips[5] = self.pips[3]
self.pips[3] = tmp
del tmp
def spin_die_clockwise(self):
tmp = self.pips[1]
self.pips[1] = self.pips[2]
self.pips[2] = self.pips[4]
self.pips[4] = self.pips[3]
self.pips[3] = tmp
del tmp
def get_upside(self):
return self.pips[0]
def get_frontside(self):
return self.pips[1]
def get_rightside(self):
return self.pips[2]
def init_die():
pips = [int(pip) for pip in sys.stdin.readline().strip('\n').split()]
die = Die(pips)
return die
def roll_die(die):
directions = list(sys.stdin.readline().strip('\n'))
for direction in directions:
die.move_die(direction)
return die
def main():
die = init_die()
q = int(sys.stdin.readline().strip('\n'))
for question in range(q):
q_pips = [int(pip) for pip in sys.stdin.readline().strip('\n').split()]
if q_pips[0] == die.pips[0]:
pass
elif q_pips[0] == die.pips[1]:
die.move_die('N')
elif q_pips[0] == die.pips[2]:
die.move_die('W')
elif q_pips[0] == die.pips[3]:
die.move_die('E')
elif q_pips[0] == die.pips[4]:
die.move_die('S')
elif q_pips[0] == die.pips[5]:
die.move_die('N')
die.move_die('N')
while die.get_frontside() != q_pips[1]:
die.spin_die_clockwise()
print((die.get_rightside()))
if __name__ == '__main__':
main()
|
#!usr/bin/env python3
import sys
class Die:
def __init__(self, pips):
self.pips = pips
def move_die(self, direction):
if direction == 'N':
tmp = self.pips[0]
self.pips[0] = self.pips[1]
self.pips[1] = self.pips[5]
self.pips[5] = self.pips[4]
self.pips[4] = tmp
del tmp
elif direction == 'S':
tmp = self.pips[0]
self.pips[0] = self.pips[4]
self.pips[4] = self.pips[5]
self.pips[5] = self.pips[1]
self.pips[1] = tmp
del tmp
elif direction == 'E':
tmp = self.pips[0]
self.pips[0] = self.pips[3]
self.pips[3] = self.pips[5]
self.pips[5] = self.pips[2]
self.pips[2] = tmp
del tmp
elif direction == 'W':
tmp = self.pips[0]
self.pips[0] = self.pips[2]
self.pips[2] = self.pips[5]
self.pips[5] = self.pips[3]
self.pips[3] = tmp
del tmp
def spin_die_clockwise(self):
tmp = self.pips[1]
self.pips[1] = self.pips[2]
self.pips[2] = self.pips[4]
self.pips[4] = self.pips[3]
self.pips[3] = tmp
del tmp
def get_upside(self):
return self.pips[0]
def get_frontside(self):
return self.pips[1]
def get_rightside(self):
return self.pips[2]
def init_die():
pips = [int(pip) for pip in sys.stdin.readline().strip('\n').split()]
die = Die(pips)
return die
def roll_die(die):
directions = list(sys.stdin.readline().strip('\n'))
for direction in directions:
die.move_die(direction)
return die
def main():
die = init_die()
q = int(sys.stdin.readline().strip('\n'))
for question in range(q):
q_pips = [int(pip) for pip in sys.stdin.readline().strip('\n').split()]
if q_pips[0] == die.pips[0]:
pass
elif q_pips[0] == die.pips[1]:
die.move_die('N')
elif q_pips[0] == die.pips[2]:
die.move_die('W')
elif q_pips[0] == die.pips[3]:
die.move_die('E')
elif q_pips[0] == die.pips[4]:
die.move_die('S')
elif q_pips[0] == die.pips[5]:
die.move_die('N')
die.move_die('N')
while die.get_frontside() != q_pips[1]:
die.spin_die_clockwise()
print((die.get_rightside()))
if __name__ == '__main__':
main()
|
p02384
|
class Dice:
def __init__(self, labels):
self.labels = labels
def east(self):
self.labels[1], self.labels[2], self.labels[3], self.labels[4] = self.labels[3], self.labels[1], self.labels[4], self.labels[2]
def west(self):
self.labels[1], self.labels[2], self.labels[3], self.labels[4] = self.labels[2], self.labels[4], self.labels[1], self.labels[3]
def north(self):
self.labels[0], self.labels[1], self.labels[4], self.labels[5] = self.labels[1], self.labels[5], self.labels[0], self.labels[4]
def south(self):
self.labels[0], self.labels[1], self.labels[4], self.labels[5] = self.labels[4], self.labels[0], self.labels[5], self.labels[1]
def clockwise(self):
self.labels[1], self.labels[2], self.labels[4], self.labels[3] = self.labels[2], self.labels[4], self.labels[3], self.labels[1]
dice = Dice(list(map(int, input().split())))
for n in range(int(eval(input()))):
top, foward = list(map(int, input().split()))
south_cnt = 0
while True:
if foward == dice.labels[1] and top == dice.labels[0]:
break
if foward == dice.labels[1]:
dice.east()
elif top == dice.labels[0]:
dice.clockwise()
else:
if south_cnt == 3:
dice.east()
else:
dice.south()
south_cnt += 1
print((dice.labels[2]))
|
class Dice:
def __init__(self, labels):
self.labels = labels
def east(self):
self.labels[0], self.labels[2], self.labels[5], self.labels[3] = self.labels[3], self.labels[0], self.labels[2], self.labels[5]
def west(self):
self.labels[0], self.labels[2], self.labels[5], self.labels[3] = self.labels[2], self.labels[5], self.labels[3], self.labels[0]
def north(self):
self.labels[0], self.labels[1], self.labels[5], self.labels[4] = self.labels[1], self.labels[5], self.labels[4], self.labels[0]
def south(self):
self.labels[0], self.labels[1], self.labels[5], self.labels[4] = self.labels[4], self.labels[0], self.labels[1], self.labels[5]
dice = Dice(list(map(int, input().split())))
for n in range(int(eval(input()))):
top, foward = list(map(int, input().split()))
south_cnt = 0
while True:
#print(dice.labels[0], dice.labels[1], dice.labels[2], dice.labels[4], dice.labels[3])
if foward == dice.labels[1] and top == dice.labels[0]:
break
if foward == dice.labels[1]:
dice.east()
elif top == dice.labels[0]:
dice.south()
dice.east()
dice.north()
else:
if south_cnt == 3:
dice.east()
else:
dice.south()
south_cnt += 1
print((dice.labels[2]))
|
p02384
|
class Dice:
def __init__(self):
self.up = 1
self.under = 6
self.N = 5
self.W = 4
self.E = 3
self.S = 2
def roll(self, d):#d => direction
if d == "N":
tmp = self.up
self.up = self.S
self.S = self.under
self.under = self.N
self.N = tmp
elif d == "W":
tmp = self.up
self.up = self.E
self.E = self.under
self.under = self.W
self.W = tmp
elif d == "E":
tmp = self.up
self.up = self.W
self.W = self.under
self.under = self.E
self.E = tmp
elif d == "S":
tmp = self.up
self.up = self.N
self.N = self.under
self.under = self.S
self.S = tmp
def getUpward(self):
return self.up
def setRoll(self,up,under,N,W,E,S):
self.up = up
self.under = under
self.N = N
self.W = W
self.E = E
self.S = S
def rotate(self):#crockwise
tmp = self.S
self.S = self.E
self.E = self.N
self.N = self.W
self.W = tmp
def getE(self, up, S):
'''
:param up:num
:param S: num
:return: num
'''
count = 0
while True:
if self.up == up:
break
if count != 3:
self.roll("N")
else:
self.roll("E")
while True:
if self.S == S:
break
self.rotate()
return self.E
myd = Dice()
myd.up, myd.S, myd.E, myd.W, myd.N, myd.under = list(map(int,input().split()))
n = int(eval(input()))
for i in range(n):
up, S = list(map(int,input().split()))
print((myd.getE(up,S)))
|
class Dice:
def __init__(self):
self.up = 1
self.under = 6
self.N = 5
self.W = 4
self.E = 3
self.S = 2
def roll(self, d):#d => direction
if d == "N":
tmp = self.up
self.up = self.S
self.S = self.under
self.under = self.N
self.N = tmp
elif d == "W":
tmp = self.up
self.up = self.E
self.E = self.under
self.under = self.W
self.W = tmp
elif d == "E":
tmp = self.up
self.up = self.W
self.W = self.under
self.under = self.E
self.E = tmp
elif d == "S":
tmp = self.up
self.up = self.N
self.N = self.under
self.under = self.S
self.S = tmp
def getUpward(self):
return self.up
def setRoll(self,up,under,N,W,E,S):
self.up = up
self.under = under
self.N = N
self.W = W
self.E = E
self.S = S
def rotate(self):#crockwise
tmp = self.S
self.S = self.E
self.E = self.N
self.N = self.W
self.W = tmp
def getE(self, up, S):
'''
:param up:num
:param S: num
:return: num
'''
count = 0
while True:
if self.up == up:
break
if count != 3:
self.roll("N")
count += 1
else:
self.roll("E")
while True:
if self.S == S:
break
self.rotate()
return self.E
myd = Dice()
myd.up, myd.S, myd.E, myd.W, myd.N, myd.under = list(map(int,input().split()))
n = int(eval(input()))
for i in range(n):
up, S = list(map(int,input().split()))
print((myd.getE(up,S)))
|
p02384
|
class Dice:
def __init__(self):
# 初期値がない場合
# 上, 南、東、西、北、下にそれぞれ1, 2, 3, 4, 5, 6がくる想定
self.t = 1
self.s = 2
self.e = 3
self.w = 4
self.n = 5
self.b = 6
self.rotway = {"S": 0, "N": 1, "E": 2, "W": 3}
def __init__(self, t, s, e, w, n, b):
# 初期値が指定される場合
self.t = t
self.s = s
self.e = e
self.w = w
self.n = n
self.b = b
self.rotway = {"S": 0, "N": 1, "E": 2, "W": 3}
def rot(self, way):
if way == 0:
self.t, self.s, self.e, self.w, self.n, self.b = self.n, self.t, self.e, self.w, self.b, self.s
elif way == 1:
self.t, self.s, self.e, self.w, self.n, self.b = self.s, self.b, self.e, self.w, self.t, self.n
elif way == 2:
self.t, self.s, self.e, self.w, self.n, self.b = self.w, self.s, self.t, self.b, self.n, self.e
elif way == 3:
self.t, self.s, self.e, self.w, self.n, self.b = self.e, self.s, self.b, self.t, self.n, self.w
def main():
import random
t,s,e,w,n,b = list(map(int, input().split()))
dice2 = Dice(t,s,e,w,n,b)
q = int(eval(input()))
for _ in range(q):
top, front = list(map(int, input().split()))
while True:
if dice2.t == top and dice2.s == front:
break
else:
seed = random.randint(0, 3)
dice2.rot(seed)
print((dice2.e))
if __name__ == '__main__':
main()
|
rot_set = [
(1,2,4,3,1), #0
(0,3,5,2,0), #1
(0,1,5,4,0), #2
(0,4,5,1,0), #3
(0,2,5,3,0), #4
(1,3,4,2,1) #5
]
dice_int = list(map(int, input().split()))
q = int(eval(input()))
right_face = []
for _ in range(q):
a, b = list(map(int, input().split()))
a_idx = dice_int.index(a)
b_idx = dice_int.index(b)
for i in range(6):
for j in range(4):
if (a_idx, b_idx) == (rot_set[i][j], rot_set[i][j+1]):
right_face.append(dice_int[i])
for i in range(q):
print((right_face[i]))
|
p02384
|
from sys import stdin
from copy import deepcopy
import queue
class Dice:
def __init__(self, nums):
self.labels = [None] + [ nums[i] for i in range(6) ]
self.pos = {
"E" : 3,
"W" : 4,
"S" : 2,
"N" : 5,
"T" : 1,
"B" : 6
}
def rolled(dice, queries):
d = deepcopy(dice)
for q in queries:
if q == "E":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["W"], d.pos["T"], d.pos["E"], d.pos["B"]
elif q == "W":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["E"], d.pos["B"], d.pos["W"], d.pos["T"]
elif q == "S":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["N"], d.pos["T"], d.pos["S"], d.pos["B"]
elif q == "N":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["S"], d.pos["B"], d.pos["N"], d.pos["T"]
else:
return d
nums = [int(x) for x in stdin.readline().rstrip().split()]
q = int(stdin.readline().rstrip())
dice = Dice(nums)
# TとSに対応するクエリを記憶し, resをすぐに呼び出せるようにする
memo = [[False] * 7 for i in range(7)]
memo[dice.pos["T"]][dice.pos["S"]] = ""
# クエリとさいころの東面を記憶
res = { "" : dice.labels[dice.pos["E"]] }
# BFSで探索, 解を求めたらreturn Trueで抜け出す
# diceの中身をいじってはならない
def solve(T, S):
que = queue.Queue()
que.put(dice)
sol_q = ["E", "N", "S", "W"]
while not que.empty():
d = que.get()
if d.pos["T"] == T and d.pos["S"] == S:
break
else:
for i in sol_q:
d_next = Dice.rolled(d, i)
que.put(d_next)
memo[d_next.pos["T"]][d_next.pos["S"]] = memo[d.pos["T"]][d.pos["S"]] + i
res[memo[d_next.pos["T"]][d_next.pos["S"]]] = d_next.labels[d_next.pos["E"]]
else:
return memo[T][S]
for i in range(q):
ts = [int(x) for x in stdin.readline().rstrip().split()]
T = dice.labels.index(ts[0])
S = dice.labels.index(ts[1])
if solve(T, S) != False:
print((res[memo[T][S]]))
|
from sys import stdin
from copy import deepcopy
import queue
class Dice:
def __init__(self, nums):
self.labels = [None] + [ nums[i] for i in range(6) ]
self.pos = {
"E" : 3,
"W" : 4,
"S" : 2,
"N" : 5,
"T" : 1,
"B" : 6
}
def rolled(dice, queries):
d = deepcopy(dice)
for q in queries:
if q == "E":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["W"], d.pos["T"], d.pos["E"], d.pos["B"]
elif q == "W":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["E"], d.pos["B"], d.pos["W"], d.pos["T"]
elif q == "S":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["N"], d.pos["T"], d.pos["S"], d.pos["B"]
elif q == "N":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["S"], d.pos["B"], d.pos["N"], d.pos["T"]
else:
return d
nums = [int(x) for x in stdin.readline().rstrip().split()]
q = int(stdin.readline().rstrip())
dice = Dice(nums)
# TとSに対応するクエリを記憶し, resをすぐに呼び出せるようにする
memo = [[False] * 7 for i in range(7)]
memo[dice.pos["T"]][dice.pos["S"]] = ""
# クエリとさいころの東面を記憶
res = { "" : dice.labels[dice.pos["E"]] }
# BFSで探索, 解を求めたらreturn Trueで抜け出す
# diceの中身をいじってはならない
def solve(T, S):
if isinstance(memo[T][S], str):
return memo[T][S]
que = queue.Queue()
que.put(dice)
sol_q = ["E", "N", "S", "W"]
while not que.empty():
d = que.get()
if d.pos["T"] == T and d.pos["S"] == S:
break
else:
for i in sol_q:
d_next = Dice.rolled(d, i)
que.put(d_next)
memo[d_next.pos["T"]][d_next.pos["S"]] = memo[d.pos["T"]][d.pos["S"]] + i
res[memo[d_next.pos["T"]][d_next.pos["S"]]] = d_next.labels[d_next.pos["E"]]
else:
return memo[T][S]
for i in range(q):
ts = [int(x) for x in stdin.readline().rstrip().split()]
T = dice.labels.index(ts[0])
S = dice.labels.index(ts[1])
if solve(T, S) != False:
print((res[memo[T][S]]))
|
p02384
|
# coding: utf-8
# ?????????????????¨????????????
class Dice(object):
def __init__(self):
# ????????¶???
self.dice = (2, 5), (3, 4), (1, 6) # x, y, z
self.ax = [[0, False], [1, False], [2, False]]
self.axmap = [0, 1, 2]
self.mm = {"N": (0, 2), "S": (2, 0), "E": (1, 2), "W": (2, 1), "R": (0, 1), "L": (1, 0)}
def rotate(self, dir):
def rot(k, r):
t = self.axmap[r]
self.axmap[k], self.axmap[r] = t, self.axmap[k]
self.ax[t][1] = not self.ax[t][1]
rot(*self.mm[dir])
def front(self): return self.value(0, True)
def rear(self): return self.value(0, False)
def right(self): return self.value(1, True)
def left(self): return self.value(1, False)
def top(self): return self.value(2, True)
def bottom(self): return self.value(2, False)
def value(self, ax, d):
a = self.ax[self.axmap[ax]]
return self.dice[a[0]][a[1] if d else not a[1]]
if __name__=="__main__":
dice = Dice()
labels = input().split()
q = int(eval(input()))
def tf(p, f, d):
for _ in range(4):
if p==f(): break
dice.rotate(d)
for _ in range(q):
a, b = input().split()
p = labels.index(a) + 1
f = dice.top
tf(p, f, "N")
tf(p, f, "E")
p = labels.index(b) + 1
f = dice.front
tf(p, f, "R")
print((labels[dice.right()-1]))
|
# coding: utf-8
# ?????????????????¨????????????
class Dice(object):
def __init__(self):
# ????????¶???
self.dice = (2, 5), (3, 4), (1, 6) # x, y, z
self.ax = [[0, False], [1, False], [2, False]]
self.axmap = [0, 1, 2]
self.mm = {"N": (0, 2), "S": (2, 0), "E": (1, 2), "W": (2, 1), "R": (0, 1), "L": (1, 0)}
def rotate(self, dir):
def rot(k, r):
t = self.axmap[r]
self.axmap[k], self.axmap[r] = t, self.axmap[k]
self.ax[t][1] = not self.ax[t][1]
rot(*self.mm[dir])
def front(self): return self.value(0, True)
def rear(self): return self.value(0, False)
def right(self): return self.value(1, True)
def left(self): return self.value(1, False)
def top(self): return self.value(2, True)
def bottom(self): return self.value(2, False)
def value(self, ax, d):
a = self.ax[self.axmap[ax]]
return self.dice[a[0]][a[1] if d else not a[1]]
if __name__=="__main__":
dice = Dice()
labels = input().split()
q = int(eval(input()))
def tf(p, f, d):
for _ in range(4):
if p==f(): break
dice.rotate(d)
for _ in range(q):
a, b = input().split()
p = labels.index(a) + 1
f = dice.top
tf(p, f, "N")
if p!=f(): tf(p, f, "E")
p = labels.index(b) + 1
f = dice.front
tf(p, f, "R")
print((labels[dice.right()-1]))
|
p02384
|
# 2019-11-17 20:44:23(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np
def main():
s, t = sys.stdin.read().split()
count = 0
for i in range(3):
if s[i] == t[i]:
count += 1
print(count)
if __name__ == "__main__":
main()
|
import sys
s, t = sys.stdin.read().split()
def main():
cnt = 0
for i in range(3):
if s[i] == t[i]:
cnt += 1
return cnt
if __name__ == '__main__':
ans = main()
print(ans)
|
p02921
|
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return list(map(fn, readline().split()))
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
s = gete()
t = gete()
ans = 0
for i in range(len(s)):
if s[i] == t[i]:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return list(map(fn, readline().split()))
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
s = gete()
t = gete()
ans = 0
for i in range(3):
if s[i] == t[i]: ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p02921
|
import queue
nv, ne = map(int, input().split(' '))
in_degrees = [[] for _ in range(nv)]
q = queue.Queue()
o = []
for _ in range(ne):
s, t = map(int, input().split(' '))
in_degrees[t].append(s)
for i in range(nv):
if len(in_degrees[i]) == 0: q.put(i)
while not q.empty():
v = q.get()
o.append(v)
for i in range(nv):
if v in in_degrees[i]:
in_degrees[i].remove(v)
if len(in_degrees[i]) == 0: q.put(i)
[print(v) for v in o]
|
import queue
nv, ne = map(int, input().split(' '))
in_degs = [0] * nv
q = queue.Queue()
outs = {}
o = []
for _ in range(ne):
s, t = map(int, input().split(' '))
if s in outs: outs[s].append(t)
else: outs[s] = [t]
in_degs[t] += 1
for i in range(nv):
if in_degs[i] == 0: q.put(i)
while not q.empty():
v = q.get()
o.append(v)
if v in outs:
for out in outs[v]:
in_degs[out] -= 1
if in_degs[out] == 0: q.put(out)
[print(v) for v in o]
|
p02370
|
import queue
nv, ne = map(int, input().split(' '))
in_degs = [0] * nv
q = queue.Queue()
outs = {}
o = []
for _ in range(ne):
s, t = map(int, input().split(' '))
if s in outs: outs[s].append(t)
else: outs[s] = [t]
in_degs[t] += 1
for i in range(nv):
if in_degs[i] == 0: q.put(i)
while not q.empty():
v = q.get()
o.append(v)
if v in outs:
for out in outs[v]:
in_degs[out] -= 1
if in_degs[out] == 0: q.put(out)
[print(v) for v in o]
|
nv, ne = map(int, input().split(' '))
in_degs = [0] * nv
q = []
outs = {}
o = []
for _ in range(ne):
s, t = map(int, input().split(' '))
if s in outs: outs[s].append(t)
else: outs[s] = [t]
in_degs[t] += 1
for i in range(nv):
if in_degs[i] == 0: q.append(i)
while len(q) > 0:
v = q.pop(0)
o.append(v)
if v in outs:
for out in outs[v]:
in_degs[out] -= 1
if in_degs[out] == 0: q.append(out)
[print(v) for v in o]
|
p02370
|
nv, ne = map(int, input().split(' '))
in_degs = [0] * nv
q = []
outs = {}
o = []
for _ in range(ne):
s, t = map(int, input().split(' '))
if s in outs: outs[s].append(t)
else: outs[s] = [t]
in_degs[t] += 1
for i in range(nv):
if in_degs[i] == 0: q.append(i)
while len(q) > 0:
v = q.pop(0)
o.append(v)
if v in outs:
for out in outs[v]:
in_degs[out] -= 1
if in_degs[out] == 0: q.append(out)
[print(v) for v in o]
|
nv, ne = map(int, input().split(' '))
in_degs = [0] * nv
q = []
outs = {}
o = []
for _ in range(ne):
s, t = map(int, input().split(' '))
if s in outs: outs[s].append(t)
else: outs[s] = [t]
in_degs[t] += 1
for i in range(nv):
if in_degs[i] == 0: q.append(i)
while q:
v = q.pop(0)
o.append(v)
if v in outs:
for out in outs[v]:
in_degs[out] -= 1
if in_degs[out] == 0: q.append(out)
[print(v) for v in o]
|
p02370
|
def bfs(s):
que = [s]
used[s] = True
while que:
u = que.pop(0)
ans.append(u)
for v in G[u]:
indeg[v] -= 1
if indeg[v] == 0 and not used[v]:
used[v] = True
que.append(v)
def tsort():
for u in range(V):
if indeg[u] == 0 and not used[u]:
bfs(u)
V, E = list(map(int, input().split()))
indeg = [0] * V
used = [False] * V
G = [[] for i in range(V)]
ans = []
for i in range(E):
s, t = list(map(int, input().split()))
indeg[t] += 1
G[s].append(t)
tsort()
for i in ans:
print(i)
|
def tsort(G):
def bfs(s):
que = [s]
used[s] = True
while que:
u = que.pop(0)
res.append(u)
for v in G[u]:
indeg[v] -= 1
if indeg[v] == 0 and not used[v]:
used[v] = True
que.append(v)
indeg = [0] * V
used = [False] * V
res = []
for u in range(V):
for v in G[u]:
indeg[v] += 1
for u in range(V):
if indeg[u] == 0 and not used[u]:
bfs(u)
return res
V, E = list(map(int, input().split()))
G = [[] for i in range(V)]
for i in range(E):
s, t = list(map(int, input().split()))
G[s].append(t)
ans = tsort(G)
for i in ans:
print(i)
|
p02370
|
#!/usr/bin/env python3
# ????????????????????°???????????°????????????????????\??????????????¢?????´???????????¨??????????§???????
import array
import collections
class TopologicalSortError(Exception):
pass
def topological_sort(num_vs, adj_vs):
in_deg = array.array("L", (0 for _ in range(num_vs)))
for dests in adj_vs:
for dest in dests:
in_deg[dest] += 1
visited = array.array("B", (False for _ in range(num_vs)))
sorted_vs = array.array("L")
for s in range(num_vs):
if in_deg[s] == 0 and not visited[s]:
q = collections.deque()
q.append(s)
visited[s] = True
while q:
u = q.popleft()
sorted_vs.append(u)
for v in adj_vs[u]:
in_deg[v] -= 1
if in_deg[v] == 0 and not visited[v]:
visited[v] = True
q.append(v)
if all(x == 0 for x in in_deg):
return sorted_vs
else:
raise TopologicalSortError("The graph has a cycle")
def main():
v, e = list(map(int, input().split()))
adj_vs = [set() for _ in range(v)]
for _ in range(e):
s, t = list(map(int, input().split()))
adj_vs[s].add(t)
for u in topological_sort(v, adj_vs):
print(u)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import array
import heapq
def topological_sort(num_vs, adj_vs):
""" Performs topological sorting of the given DAG.
This function computes the lexicographically least
topological order of the given DAG.
:param num_vs int: The number of vertices.
:param adj_vs list: The adjacency list.
:return: The lexicographically least topological order.
:rtype: :obj:`array.array`
:raises TopologicalSortError: if the given graph is not a DAG
"""
in_deg = array.array("L", (0 for _ in range(num_vs)))
for dests in adj_vs:
for dest in dests:
in_deg[dest] += 1
sorted_vs = array.array("L")
pq = []
for s in range(num_vs):
if in_deg[s] == 0:
heapq.heappush(pq, s)
while pq:
u = heapq.heappop(pq)
sorted_vs.append(u)
for v in adj_vs[u]:
in_deg[v] -= 1
if in_deg[v] == 0:
heapq.heappush(pq, v)
if all(x == 0 for x in in_deg):
return sorted_vs
else:
raise TopologicalSortError("The graph has a cycle")
def main():
v, e = list(map(int, input().split()))
adj_vs = [set() for _ in range(v)]
for _ in range(e):
s, t = list(map(int, input().split()))
adj_vs[s].add(t)
for u in topological_sort(v, adj_vs):
print(u)
if __name__ == '__main__':
main()
|
p02370
|
#!/usr/bin/env python3
import itertools
def main():
N = int(eval(input()))
F = [list(map(int,input().split())) for _ in range(N)]
P = [list(map(int,input().split())) for _ in range(N)]
bit_list = list(itertools.product([0, 1], repeat=10))
bit_list.pop(0)
answer = -10**9-1
for b in bit_list:
profit = 0
for i in range(N):
a = 0 ## 一致してる営業時間の数
for j in range(10):
if b[j]==1 and F[i][j]==1:
a+=1
profit+=P[i][a]
answer = max(answer,profit)
print(answer)
return
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import itertools
def main():
N = int(eval(input()))
F = [int(input().replace(' ',''),2) for _ in range(N)]
P = [list(map(int,input().split())) for _ in range(N)]
answer = -float('inf')
for bit in range(1,1<<10):
tmp_profit = 0
for i in range(N):
count = format(bit&F[i],'b').count("1")
tmp_profit += P[i][count]
answer = max(answer,tmp_profit)
print(answer)
return
if __name__ == '__main__':
main()
|
p03503
|
#from collections import Counter
N=int(eval(input()))
F=list(list(map(int,input().split())) for i in range(N))
P=list(list(map(int,input().split())) for i in range(N))
ans=-(1<<40)
for bit in range(1,1<<10):
tmp = 0
for i in range(N):
c=0
for j in range(10):
if bit&(1<<j) and F[i][j]:
c+=1
tmp+=P[i][c]
ans = max(ans,tmp)
print(ans)
|
#from collections import Counter
N=int(eval(input()))
F=list(int(input().replace(" ",""),2) for i in range(N))
P=list(list(map(int,input().split())) for i in range(N))
ans=-(1<<40)
for bit in range(1,1<<10):
tmp = 0
for i in range(N):
tmp+=P[i][bin(bit&F[i]).count('1')]
ans = max(ans,tmp)
print(ans)
|
p03503
|
N=int(eval(input()))
H=['']*N
W=['']*N
x=[]
for i in range(N):
H[i]=list(map(int,input().split()))
for j in range(N):
W[j]=list(map(int,input().split()))
for k in range(1,1024):
t=[]
for ii in range(10):
if k&(1<<ii):
t+=[1]
else:
t+=[0]
ans=0
for jj in range(N):
s=0
for kk in range(10):
s+=H[jj][kk]*t[kk]
ans+=W[jj][s]
x.append(ans)
print((max(x)))
|
N=int(eval(input()))
ans=-10**9
s=["".join(list(input().split())) for i in range(N)]
t=[list(map(int,input().split())) for i in range(N)]
for j in range(1,1024):
q=0
for i in range(len(s)):
q+=t[i][(bin(int(s[i],2)&j)).count("1")]
ans=max(ans,q)
print(ans)
|
p03503
|
# 写経
n = int(eval(input()))
lst_F = [list(map(int, input().split())) for _ in range(n)]
lst_P = [list(map(int, input().split())) for _ in range(n)]
ans = -float("INF")
for b in range(1, 2**10):
tmp = 0
for i in range(n):
c = 0
for k in range(10):
if b&(1<<k) and lst_F[i][k]:
c += 1
tmp += lst_P[i][c]
ans = max(tmp, ans)
print(ans)
|
N = int(eval(input()))
lst_F = [list(map(int, input().split())) for _ in range(N)]
lst_P = [list(map(int, input().split())) for _ in range(N)]
n_timetable = 10
lst_joisino = [None] * n_timetable
def score(src, F, P):
cnt = 0
for i, j in zip(src, F):
if i == j == 1:
cnt += 1
return P[cnt]
def dfs(pos):
if pos == n_timetable:
ret = 0
for i in range(N):
if lst_joisino == [0] * n_timetable:
return -float("INF")
p = score(lst_joisino, lst_F[i], lst_P[i])
ret += p
return ret
lst_joisino[pos] = 0
ret0 = dfs(pos + 1)
lst_joisino[pos] = 1
ret1 = dfs(pos + 1)
return max(ret0, ret1)
print((dfs(0)))
|
p03503
|
import sys
input=sys.stdin.readline
def main():
N = int(eval(input()))
F = []
for _ in range(N):
F.append(list(map(int, input().split())))
P = []
for _ in range(N):
P.append(list(map(int, input().split())))
ans = -10**7*N
for i in range(1, 1<<10):
tmp = 0
for s,f in enumerate(F):
c = 0
for j in range(10):
if (i>>j)&1&f[j]:
c += 1
tmp += P[s][c]
ans = max(ans, tmp)
print(ans)
if __name__ == '__main__':
main()
|
import sys
input=sys.stdin.readline
def main():
N = int(eval(input()))
F = [int(input().replace(" ", ""), 2) for _ in range(N)]
P = [list(map(int, input().split())) for _ in range(N)]
ans = -10**7*N
for i in range(1, 1<<10):
tmp = 0
for j,f in enumerate(F):
c = bin(i&f).count("1")
tmp += P[j][c]
ans = max(ans, tmp)
print(ans)
if __name__ == '__main__':
main()
|
p03503
|
# ABC080C - Shopping Street
import sys
input = sys.stdin.readline
from itertools import product
def main():
N = int(eval(input()))
F = tuple(tuple(map(int, input().split())) for _ in range(N))
P = tuple(tuple(map(int, input().split())) for _ in range(N))
ans = []
for b in tuple(product((0, 1), repeat=10))[1:]:
cnt = 0
for f, p in zip(F, P):
opening = sum(b[i] == 1 and b[i] == f[i] for i in range(10))
cnt += p[opening]
ans += [cnt]
print((max(ans)))
if __name__ == "__main__":
main()
|
# ABC080C - Shopping Street
import sys
input = sys.stdin.readline
from itertools import product
def main():
N = int(eval(input()))
F = tuple(tuple(map(int, input().split())) for _ in range(N))
P = tuple(tuple(map(int, input().split())) for _ in range(N))
ans = []
for b in tuple(product((0, 1), repeat=10))[1:]:
cnt = 0
for f, p in zip(F, P):
opening = sum(i & j for i, j in zip(b, f))
cnt += p[opening]
ans += [cnt]
print((max(ans)))
if __name__ == "__main__":
main()
|
p03503
|
# ABC080C - Shopping Street
import sys
input = sys.stdin.readline
from itertools import product
def main():
N = int(eval(input()))
F = tuple(tuple(map(int, input().split())) for _ in range(N))
P = tuple(tuple(map(int, input().split())) for _ in range(N))
ans = []
for b in product((0, 1), repeat=10):
if 1 not in b:
continue
cnt = 0
for f, p in zip(F, P):
opening = sum(i & j for i, j in zip(b, f))
cnt += p[opening]
ans += [cnt]
print((max(ans)))
if __name__ == "__main__":
main()
|
# ABC080C - Shopping Street
import sys
input = sys.stdin.readline
from itertools import product
def main():
N = int(eval(input()))
F = tuple(int(input().replace(" ", ""), 2) for _ in range(N))
P = tuple(tuple(map(int, input().split())) for _ in range(N))
ans = []
for i in range(1, 2 ** 10):
cnt = sum(p[bin(i & f).count("1")] for f, p in zip(F, P))
ans += [cnt]
print((max(ans)))
if __name__ == "__main__":
main()
|
p03503
|
from sys import stdin
def main():
#入力
readline=stdin.readline
N=int(readline())
F=[]
for i in range(N):
f=list(map(int,readline().split()))
F.append(f)
P=[]
for i in range(N):
p=list(map(int,readline().split()))
P.append(p)
max_res=-float("inf")
for i in range(1<<10):
if i==0:
continue
else:
output=[]
for j in range(10):
if(i>>j)&1:
output.append(j)
oc=[0]*10 #open or close
for j in output:
oc[j]=1
res=0
for j in range(N):
c=0
for k in range(10):
if oc[k]==1 and F[j][k]==1:
c+=1
res+=P[j][c]
max_res=max(res,max_res)
print(max_res)
if __name__=="__main__":
main()
|
from sys import stdin
def main():
#入力
readline=stdin.readline
N=int(readline())
F=[]
for i in range(N):
f=int("".join(readline().strip().split(" ")),2)
F.append(f)
P=[]
for i in range(N):
p=list(map(int,readline().split()))
P.append(p)
max_res=float("-inf")
for output in range(1,1<<10):
res=0
for j in range(N):
c=bin(output&F[j]).count("1")
res+=P[j][c]
max_res=max(res,max_res)
print(max_res)
if __name__=="__main__":
main()
|
p03503
|
n = int(eval(input()))
f = [list(map(int,input().split())) for i in range(n)]
p = [list(map(int,input().split())) for i in range(n)]
ans = -10**12
for i in range(1,1024):
#print("i=",i)
temp = 0
for j in range(n): #j = 0,1,2,..,n-1で店番号
fi = f[j]
ci = sum([1 for k in range(10) if (i>>k)&1==1 and fi[9-k]==1])
temp += p[j][ci]
#print(temp)
ans = max(ans,temp)
print(ans)
|
n = int(eval(input()))
f = [int(input().replace(" ",""),2) for i in range(n)] #数にしてしまう
p = [list(map(int,input().split())) for i in range(n)]
ans = -10**12
for i in range(1,1024):
#print("i=",i)
temp = 0
for j in range(n): #j = 0,1,2,..,n-1で店番号
fi = f[j]
ci = bin(fi&i).count("1") #bin()は2進法表記のstrになる。
#print("ci=",ci)
temp += p[j][ci]
#print(temp)
#print(temp)
ans = max(ans,temp)
print(ans)
|
p03503
|
f=lambda:[list(map(int,input().split())) for _ in range(n)]
n=int(eval(input()))
llf,llp=f(),f()
a=-10**9
import itertools as it
for t in it.product([0,1],repeat=10):
if sum(t):
lc=[sum(t[i]*lf[i] for i in range(10)) for lf in llf]
a=max(a,sum(llp[i][lc[i]] for i in range(n)))
print(a)
|
I=input;R=range;n=int(I())
lf=[int(I()[::2],2) for _ in R(n)]
lp=[list(map(int,I().split())) for _ in R(n)]
print((max(sum(p[bin(i&f).count('1')] for f,p in zip(lf,lp)) for i in R(1,1024))))
|
p03503
|
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import defaultdict, deque, Counter
from sys import exit
import heapq
import math
import copy
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7
N = getN()
F = []
for i in range(N):
# 各数字をstrに変換
f = list(map(str, input().split()))
# join
falta = ''.join(f)
# 二進数に変換
F.append(int(falta, 2))
P = []
for i in range(N):
p = getList()
P.append(p)
ans = -10 ** 24
# 状態を生成
# 0000000000はダメ（必ず店は開く）
for bit in range(1, 1 << 10):
sum = 0
# 各お店と照合
for i in range(N):
open = F[i] & bit
# 二進数表記でのフラグの数をカウント
index = str(bin(open)).count('1')
sum += P[i][index]
ans = max(ans, sum)
print(ans)
|
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import defaultdict, deque, Counter
from sys import exit
import heapq
import math
import copy
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7
N = getN()
F = []
for i in range(N):
# 各数字をstrに変換
f = list(map(str, input().split()))
# join
falta = ''.join(f)
# 二進数に変換
F.append(int(falta, 2))
P = []
for i in range(N):
p = getList()
P.append(p)
# -10 ** 7ぐらいだとばか小さい数にならずWA
# ばかでかい数、ばか小さい数にするときは思いっきりばかでかく、小さくしよう
ans = -10 ** 24
# bit全探索するため状態を生成
# 0000000000はダメ（必ず店は開く）
for bit in range(1, 1 << 10):
sum = 0
# 各お店と照合
for i in range(N):
open = F[i] & bit
# 二進数表記でのフラグの数をカウント
index = str(bin(open)).count('1')
sum += P[i][index]
ans = max(ans, sum)
print(ans)
|
p03503
|
n = int(eval(input()))
arr = [list(map(int, input().split())) for i in range(n)]
arm = [list(map(int, input().split())) for j in range(n)]
ans = -9999999999
for item in range(1, 1024):
fund = 0
for i in range(n):
cou = 0
for x in range(10):
if (item >> x) % 2 == 1 and arr[i][x] == 1:
cou += 1
fund += arm[i][cou]
ans = max(ans, fund)
print(ans)
|
def solve():
n = int(eval(input()))
oc = [list(map(int, input().split())) for _ in range(n)]
prof = [list(map(int, input().split())) for _ in range(n)]
ans = -9999999999
for a in range(1, 1 << 10):
res = 0
for i in range(n):
cnt = 0
for x in range(10):
if (a >> x) % 2 == 1 and oc[i][x] == 1:
cnt += 1
res += prof[i][cnt]
ans = max(ans, res)
print(ans)
solve()
|
p03503
|
#!/usr/bin/env python3
#ABC80 C
from operator import itemgetter
import collections
n = int(eval(input()))
f = [list(map(int,input().split())) for _ in range(n)]
p = [list(map(int,input().split())) for _ in range(n)]
ma = -float('inf')
for i in range(1,2**10):
b = [0]*10
s = 0
sum = 0
for j in range(10):
if (i>>j) & 1:
b[j] = 1
for j in range(n):
for k in range(10):
if f[j][k] & b[k]:
s += 1
sum += p[j][s]
s = 0
ma = max(ma,sum)
print(ma)
|
#!/usr/bin/env python3
#ABC80 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
f = [LI() for _ in range(n)]
p = [LI() for _ in range(n)]
ans = -inf
for i in range(1,2**10):
b = [0]*10
for j in range(10):
if (i >> j) & 1:
b[j] = 1
tmp = 0
for i in range(n):
cnt = 0
for j in range(10):
if b[j] == 1 and f[i][j] == 1:
cnt += 1
tmp += p[i][cnt]
ans = max(ans,tmp)
print(ans)
|
p03503
|
n=int(eval(input()))
S=[list(map(str,input().split())) for _ in range(n)]
C=[list(map(int,input().split())) for _ in range(n)]
A=[]
for i in range(1,2**10):
ans=0
X=format(i,'b').zfill(10)
for j in range(n):
cnt=0
for k in range(10):
if S[j][k]=='1' and X[k]=='1':
cnt+=1
ans+=C[j][cnt]
A.append(ans)
print((max(A)))
|
n=int(eval(input()))
S=[int(input().replace(' ',''),2) for _ in range(n)]
C=[list(map(int,input().split())) for _ in range(n)]
A=[]
for i in range(1,2**10):
ans=0
for j in range(n):
cnt=bin(S[j]&i).count('1')
ans+=C[j][cnt]
A.append(ans)
print((max(A)))
|
p03503
|
import sys
import itertools
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# bit を使ってci を管理する
def toBit(n):
return bin(eval('0b' + str(n)))
def main():
n = int(sys.stdin.readline().rstrip())
schedule = [toBit(''.join(str(x) for x in sys.stdin.readline().split())) for _ in range(n)]
profit_table = [[int(x) for x in sys.stdin.readline().split()] for _ in range(n)]
maximum_profit = -10**10
for open_pattern in itertools.product('01', repeat=10):
open_pattern = toBit(''.join(open_pattern))
if open_pattern == '0b0':
continue
profit = 0
for i in range(n):
checked = schedule[i]
number_of_periods = bin(eval(checked) & eval(open_pattern)).count('1')
profit += profit_table[i][number_of_periods]
maximum_profit = max(maximum_profit, profit)
print(maximum_profit)
if __name__ == "__main__":
# execute only if run as a script
main()
|
import sys
import itertools
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# bit を使ってci を管理する
def toBit(n):
return eval('0b' + n)
def main():
n = int(sys.stdin.readline().rstrip())
schedule = [toBit(''.join(str(x) for x in sys.stdin.readline().split())) for _ in range(n)]
profit_table = [[int(x) for x in sys.stdin.readline().split()] for _ in range(n)]
maximum_profit = -10**10
for open_pattern in itertools.product('01', repeat=10):
open_pattern = toBit(''.join(open_pattern))
if open_pattern == 0:
continue
profit = 0
for i in range(n):
checked = schedule[i]
number_of_periods = bin(checked & open_pattern).count('1')
profit += profit_table[i][number_of_periods]
maximum_profit = max(maximum_profit, profit)
print(maximum_profit)
if __name__ == "__main__":
# execute only if run as a script
main()
|
p03503
|
N = int(eval(input()))
F = [list(map(int,input().split())) for i in range(N)]
P = [list(map(int,input().split())) for i in range(N)]
ans = -(10**7) * 10 * 100
for i in range(1,2**10):
counter = [0]*N #店iとjoisinoのかぶっている数
tmp = 0 #
for j in range(10):
if (i>>j) & 1:
for k in range(N):
if F[k][j] ==1:
counter[k] += 1
for l in range(N):
tmp += P[l][counter[l]]
#tmp += P[k][counter[k]]
ans = max(tmp,ans)
print(ans)
|
n = int(eval(input()))
bits = []
for i in range(n):
bit = int(input().replace(" ", ""), 2)
bits.append(bit)
p = [[int(item) for item in input().split()] for _ in range(n)]
ans = - 10**9
for i in range(1,2**10):
val = 0
for j,mise in enumerate(p):
val += mise[bin(i & bits[j]).count("1")]
ans = max(ans, val)
print(ans)
|
p03503
|
N=int(eval(input()))
M=[[0 for i in range(2**10)] for j in range(N)]
K=[0]*(2**10)
F=[list(map(int,input().split())) for _ in range(N)]
P=[list(map(int,input().split())) for _ in range(N)]
for i in range(2**10):
for j in range(10):
for k in range(N):
if (i>>9-j)&1 and F[k][j]:
#print(i,j)
M[k][i]+=1
for i in range(2**10):
for k in range(N):
K[i]+=P[k][M[k][i]]
print((max(K[1:])))
|
N = int(eval(input()))
F = [list(map(int, input().split())) for _ in range(N)]
P = [list(map(int, input().split())) for _ in range(N)]
answer = []
for i in range(1, 2 ** 10):
tmp = 0
for j in range(N):
cnt = 0
for k in range(10):
if (i >> k) & 1 and F[j][k]:
cnt += 1
tmp += P[j][cnt]
answer.append(tmp)
print((max(answer)))
|
p03503
|
N = int(eval(input()))
F = [list(map(int, input().split())) for _ in range(N)]
P = [list(map(int, input().split())) for _ in range(N)]
result = -float('inf')
for i in range(1, 1024):
t = 0
for j in range(N):
c = 0
for k in range(10):
c += (i >> k & 1) & F[j][k]
t += P[j][c]
result = max(result, t)
print(result)
|
# ビット全探索
from itertools import product
N = int(eval(input()))
F = [list(map(int, input().split())) for _ in range(N)]
P = [list(map(int, input().split())) for _ in range(N)]
result = -float('inf')
for i in product([True, False], repeat=10):
if i.count(False) == 10:
continue
t = 0
for j in range(N):
t += P[j][sum(1 & F[j][k] for k in range(10) if i[k])]
result = max(result, t)
print(result)
|
p03503
|
N = int(eval(input()))
F = [list(map(int, input().split())) for i in range(N)]
P = [list(map(int, input().split())) for i in range(N)]
ans = -10 ** 10
for b in range(1, 2 ** 10):
bin_str = format(b, '010b')
p = 0
for i in range(N):
c = 0
for j in range(10):
c += F[i][j] * int(bin_str[j])
p += P[i][c]
ans = max(ans, p)
print(ans)
|
N = int(eval(input()))
F = [list(map(int, input().split())) for i in range(N)]
P = [list(map(int, input().split())) for i in range(N)]
ans = -10 ** 10
def calc(b):
p = 0
for i in range(N):
c = 0
for j in range(10):
c += F[i][j] * b[j]
p += P[i][c]
return p
def dfs(b):
global ans
if len(b) == 10:
if max(b) == 0:
return
ans = max(ans, calc(b))
return
dfs(b + [0])
dfs(b + [1])
dfs([0])
dfs([1])
print(ans)
|
p03503
|
N = int(eval(input()))
F = [[0 for _ in range(10)] for _ in range(N)]
P = [[0 for _ in range(10)] for _ in range(N)]
for i in range(N) :
F[i] = list(map(int, input().split()))
for i in range(N) :
P[i] = list(map(int, input().split()))
ans = -float('inf')
for mask in range(1, 2**10) :
profit = 0
for shop in range(N) :
count = 0
for time in range(10) :
if (mask & (1 << time) != 0) and F[shop][time] == 1 :
count += 1
profit += P[shop][count]
ans = max(ans, profit)
print(ans)
|
N = int(eval(input()))
F = []
for _ in range(N):
mask = 0
for f in map(int, input().split()):
mask <<= 1
mask |= f
F.append(mask)
P = [list(map(int, input().split())) for _ in range(N)]
def calc(state):
ret = 0
for f, ps in zip(F, P):
f &= state
cnt = 0
while f > 0:
cnt += f % 2
f //= 2
ret += ps[cnt]
return ret
ans = -10**18
for state in range(1, 1 << 10):
ans = max(ans, calc(state))
print(ans)
|
p03503
|
import sys
from itertools import product
input = sys.stdin.readline
N = int(eval(input()))
F = [[int(x) for x in input().split()] for _ in range(N)]
P = [[int(x) for x in input().split()] for _ in range(N)]
ans = float('-inf')
for ptn in product([0, 1], repeat=10):
if sum(ptn) == 0:
continue
res = 0
for i in range(N):
cnt = 0
for j in range(10):
cnt += F[i][j] * ptn[j]
res += P[i][cnt]
ans = max(ans, res)
print(ans)
|
import sys
input = sys.stdin.readline
N = int(eval(input()))
F = [int(input().replace(' ', ''), 2) for _ in range(N)]
P = [[int(x) for x in input().split()] for _ in range(N)]
ans = float('-inf')
for i in range(1, 2**10):
res = 0
for f, p in zip(F, P):
cnt = bin(i & f).count('1')
res += p[cnt]
ans = max(ans, res)
print(ans)
|
p03503
|
from operator import mul
n = int(eval(input()))
cof = [1 << x for x in range(10)]
fs = [sum(map(mul, list(map(int, input().split())), cof)) for _ in range(n)]
ps = [list(map(int, input().split())) for _ in range(n)]
ans = float('-inf')
for g in range(1, 1024):
ans = max(ans, sum(p[bin(f & g).count('1')] for f, p in zip(fs, ps)))
print(ans)
|
N=int(eval(input()))
F=[int(input().replace(' ',''),2) for i in range(N)]
P=[list(map(int,input().split())) for i in range(N)]
print((max(sum([p[bin(f&i).count('1')] for f,p in zip(F,P)]) for i in range(1,2**10))))
|
p03503
|
n = int(eval(input()))
F = []
# for _ in range(n):
# f = list(map(int, input().split()))
# # print(f)
# F.append([\
# [f[0],f[1]],\
# [f[2],f[3]],\
# [f[4],f[5]],\
# [f[6],f[7]],\
# [f[8],f[9]]\
# ])
for _ in range(n):
f = list(map(int, input().split()))
F.append(f)
# print(*F,sep='\n')
P = []
for _ in range(n):
p = list(map(int, input().split()))
P.append(p)
# print(*P,sep='\n')
def c(i, open_my_shop):
ret = 0
for j in range(10):
if open_my_shop>>j & 1: #open my shop
if F[i][j]: # open your shop
ret += 1
return ret
ans = -10*10000000*10
# for i in range(1, 1<<10): # [0~1,1~1] 10bit
# s = 0
# for j in range(10): # open time zone
# if i>>j & 1: # my shop (j+1) open
# for k in range(n): # your shop
# ck = c(k, i)
# s += P[k][ck]
# ans = max(ans ,s)
for i in range(1, 1<<10): # [0~1,1~1] 10bit
s = 0
for j in range(n): # your shop
cj = c(j, i)
s += P[j][cj]
ans = max(ans ,s)
print(ans)
|
n = int(eval(input()))
F = [[*list(map(int, input().split()))] for _ in range(n)]
P = [[*list(map(int, input().split()))] for _ in range(n)]
def c(i, open_patern):
ret = 0
for j in range(10):
if open_patern>>j & 1: #open my shop
if F[i][j]: ret += 1 # open your shop
return ret
ans = -10000000*100
for i in range(1, 1<<10): # open pattern 10bit, i:[0~1,1~1]
s = 0
for j in range(n): # your shop
cj = c(j, i)
s += P[j][cj]
ans = max(ans ,s)
print(ans)
|
p03503
|
import sys
input = sys.stdin.readline
from itertools import combinations
def readlines(n):
for _ in range(n):
yield list(map(int,input().split()))
def bene(me, f, p):
a = sum(1 if f[m] == 1 else 0 for m in me)
return p[a]
def main():
n = int(eval(input()))
F = list(readlines(n))
P = list(readlines(n))
for i in range(1, 11):
for comb in combinations(list(range(10)), i):
yield sum(bene(comb, f, p) for f, p in zip(F,P))
print((max(main())))
|
import sys
input = sys.stdin.readline
from itertools import combinations
def readlines(n):
for _ in range(n):
yield list(map(int,input().split()))
def bene(me, f, p):
a = len([0 for m in me if f[m] == 1])
return p[a]
def main():
n = int(eval(input()))
F = list(readlines(n))
P = list(readlines(n))
for i in range(1, 11):
for comb in combinations(list(range(10)), i):
yield sum(bene(comb, f, p) for f, p in zip(F,P))
print((max(main())))
|
p03503
|
n = int(eval(input()))
F = [list(map(int, input().split())) for _ in range(n)]#F[i]は(i+1)番目の店の営業の有無のリスト
P = [list(map(int, input().split())) for _ in range(n)]#P[i]は(i+1)番目の店との同時開店数に応じた利益のリスト
ans = (-1) * 10 ** 9
for i in range(2 ** 10):
if sum(map(int, list(str(i)))) == 0:
continue
cnt_lst = [0 for _ in range(n)]
for d in range(5):
for t in range(2):
dt = 2 * d + t
if i & (2 ** dt) != 0:
for j in range(n):
cnt_lst[j] += F[j][dt]
buf = 0
for j in range(n):
buf += P[j][cnt_lst[j]]
ans = max(buf, ans)
print(ans)
|
def main():
from itertools import combinations
N = int(eval(input()))
F = []
for _ in range(N):
t = 0
for j, b in enumerate(map(int, input().split())):
if b:
t |= (1 << j)
F.append(t)
# F[i]:=店舗iの営業時間情報
P = [list(map(int, input().split())) for _ in range(N)]
# P[i]:=店舗iと営業時間が重なる個数に対する利益
ans = -10 ** 9 - 1
for open_ in range(1, 10 + 1):
for comb in combinations(list(range(10)), r=open_):
t = 0
for j in comb:
t |= (1 << j)
p = 0
for i, f in enumerate(F):
x = bin(t & f).count('1')
p += P[i][x]
ans = max(ans, p)
print(ans)
if __name__ == '__main__':
main()
|
p03503
|
#!/mnt/c/Users/moiki/bash/env/bin/python
# N,M = map(int, input().split())
N = int(eval(input()))
F = [list(map(int, input().split())) for _ in range(N)]
P = [list(map(int, input().split())) for _ in range(N)]
ans = - 10**10
for i in range(1,1<<10):
score = 0
for n in range(N):
f = "".join(map(str,F[n]))
b = "{:010b}".format(i)
c = [int(f[i]) & int(b[i]) for i in range(10)]
cnt = len(list([x for x in c if x]))
score += P[n][cnt]
ans = max(ans, score)
print(ans)
|
N = int(eval(input()))
F = [ int(input().replace(" ", ""), 2) for _ in range(N)]
P = [list(map(int, input().split())) for _ in range(N)]
ans = - 10**10
for i in range(1,1<<10):
ans = max(ans, sum(P[n][bin(i&F[n]).count('1')] for n in range(N)))
print(ans)
|
p03503
|
icase=0
if icase==0:
n=int(eval(input()))
f=[]
for i in range(n):
fi=list(map(int,input().split()))
f.append(fi)
p=[]
for i in range(n):
pi=list(map(int,input().split()))
p.append(pi)
elif icase==1:
n=1
f=[[1, 1, 0, 1, 0, 0, 0, 1, 0, 1]]
p=[[3, 4, 5, 6, 7, 8, 9, -2, -3, 4, -2]]
elif icase==2:
n=2
f=[[1, 1, 1, 1, 1, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 1, 1, 1, 1, 1]]
p=[[0, -2, -2, -2, -2, -2, -1, -1, -1, -1, -1],
[0, -2, -2, -2, -2, -2, -1, -1, -1, -1, -1]]
elif icase==3:
n=3
f=[[1, 1, 1, 1, 1, 1, 0, 0, 1, 1],
[0, 1, 0, 1, 1, 1, 1, 0, 1, 0],
[1, 0, 1, 1, 0, 1, 0, 1, 0, 1]]
p=[[-8, 6, -2, -8, -8, 4, 8, 7, -6, 2, 2],
[-9, 2, 0, 1, 7, -5, 0, -2, -6, 5, 5],
[6, -6, 7, -9, 6, -5, 8, 0, -9, -7, -7]]
import itertools
sumpmax=-10**11
for i in itertools.product([0,1], repeat=10):
r=list(i)
sump=0
if sum(r)!=0:
for jj in range(n):
ci=0
for j in range(10):
ci=ci+r[j]*f[jj][j]
sump=sump+p[jj][ci]
# print(sump,r)
sumpmax=max(sump,sumpmax)
print(sumpmax)
|
import itertools
n=int(eval(input()))
f=[[]]*n
for i in range(n):
fij=list(map(int,input().split()))
# f[i].append(fij)
f[i]=fij
p=[[]]*n
for i in range(n):
pij=list(map(int,input().split()))
p[i]=pij
pmax=-10**11
for a in itertools.product([0,1], repeat=10):
if sum(a)==0:
continue
psum=0
for ni in range(n):
k=0
for i in range(10):
if f[ni][i]==1 and a[i]==1:
k+=1
psum=psum+p[ni][k]
pmax=max(pmax,psum)
print(pmax)
|
p03503
|
# -*- coding: utf-8 -*-
import itertools
N = int(eval(input()))
F = []
for i in range(N):
F.append(list(map(int, input().split())))
P = []
for i in range(N):
P.append(list(map(int, input().split())))
# 重複順列で自分の店の全パターンを出す
me_list = list(itertools.product([0, 1], repeat=10))
# 初期値は利益の最小値
me_p = -1000000000
# 自分の店の全パターンループ
for i in range(len(me_list)):
# 一度も営業しないパターンを除く
if i == 0:
continue
tmp_p = 0
# 他店の数でループ
for j in range(N):
cnt = 0
# 月～金のAMPMループ
for k in range(10):
# 他店との営業重複カウント
if me_list[i][k] == 1 and F[j][k] == 1:
cnt += 1
# 各店舗との重複数に応じた利益を合算していく
tmp_p += P[j][cnt]
# 合算した利益を現状の最高値と比較して置き換えていく
me_p = max(me_p, tmp_p)
print(me_p)
|
# -*- coding: utf-8 -*-
import itertools
N = int(eval(input()))
F = []
for i in range(N):
F.append(list(map(int, input().split())))
P = []
for i in range(N):
P.append(list(map(int, input().split())))
# 重複順列で自分の店の全パターンを出す
me_list = list(itertools.product([0, 1], repeat=10))
# 初期値は利益の最小値
me_p = -float("inf")
# 自分の店の全パターンループ
for i in range(len(me_list)):
# 一度も営業しないパターンを除く
if i == 0:
continue
tmp_p = 0
# 他店の数でループ
for j in range(N):
cnt = 0
# 月～金のAMPMループ
for k in range(10):
# 他店との営業重複カウント
if me_list[i][k] == 1 and F[j][k] == 1:
cnt += 1
# 各店舗との重複数に応じた利益を合算していく
tmp_p += P[j][cnt]
# 合算した利益を現状の最高値と比較して置き換えていく
me_p = max(me_p, tmp_p)
print(me_p)
|
p03503
|
import itertools
mylist = [0, 1]
n = int(input().rstrip())
mise = [list(map(int, input().rstrip().split())) for i in range(n)]
mine = [list(map(int, input().rstrip().split())) for i in range(n)]
maxnum = - float('inf')
for i in itertools.product(mylist, repeat = 10):
if sum(i) == 0:
continue
sell = 0
for j, k in zip(mise, mine):
temp = 0
for l in range(10):
if j[l] == i[l] and j[l] == 1:
temp += 1
sell += k[temp]
maxnum = max(maxnum, sell)
print(maxnum)
|
MAX_TIME = 10
n = int(input().rstrip())
#２進法を
P = [sum(int(i) << MAX_TIME-k-1 for k, i in enumerate(input().rstrip().split())) for j in range(n)]
S = [list(map(int, input().rstrip().split())) for i in range(n)]
#予め2進数をカウントしておく
# 予めビットをカウントしておく
pattern = [sum(i >> j & 1 for j in range(MAX_TIME)) for i in range(2 ** MAX_TIME)]
result = -float('inf')
for i in range(1, 2**MAX_TIME):
temp = 0
for l, j in zip(P, S):
temp += j[pattern[l & i]]
result = max(result, temp)
print(result)
|
p03503
|
N = int(eval(input()))
F = [list(map(int, input().split())) for k in range(N)]
P = [list(map(int, input().split())) for k in range(N)]
B = [format(k,'b').zfill(10) for k in range(1,1024)]
ans = -10**9
for d in B:
t = 0
E = [0 for k in range(N)]
for l in range(N):
for k in range(10):
E[l] += int(d[k])*F[l][k]
for k in range(N):
t += P[k][E[k]]
ans = max(t,ans)
print(ans)
|
N = int(eval(input()))
F = [list(map(int,input().split())) for k in range(N)]
P = [list(map(int,input().split())) for k in range(N)]
ans = -float("inf")
for k in range(2**10):
temp = 0
S = [0 for l in range(N)]
for s in range(N):
for d in range(10):
if (k>>d)&1 == 1:
if F[s][d] == 1:
S[s] += 1
if sum(S) > 0:
for l in range(N):
temp += P[l][S[l]]
ans = max(ans,temp)
print(ans)
|
p03503
|
import itertools
N=eval(input())
F=[]
for i in range(N):
F.append(list(map(int,input().split())))
#print F
P=[]
for i in range(N):
P.append(list(map(int,input().split())))
#print P
l=list(itertools.product(list(range(2)), repeat=10))
#l=[(1, 1, 1, 1, 1, 0, 0, 0, 0, 0),(0, 0, 0, 0, 0, 1, 1, 1, 1, 1),(0, 0, 0, 0, 0, 1, 1, 1, 1, 1)]
l.remove((0, 0, 0, 0, 0, 0, 0, 0, 0, 0))
b=[[] for i in range(2**10-1)]
for ind_i,i in enumerate(l):
for j in F:
#print [min(t) for t in zip(i, j)]
#print sum([min(t) for t in zip(i, j)])
b[ind_i].append(sum([min(t) for t in zip(i, j)]))
#print b
b_sum=0
ans=float("-inf")
for ind_i,i in enumerate(b):
b_sum=0
for ind_j,j in enumerate(i):
#print ind_i, ind_j,j
b_sum+=P[ind_j][j]
#print sum
ans=max(ans,b_sum)
print(ans)
|
# -*- coding: utf-8 -*-
import sys
N=eval(input())
F=[ list(map(int, sys.stdin.readline().split())) for _ in range(N)]
P=[ list(map(int, sys.stdin.readline().split())) for _ in range(N)]
D=[] #各店の状態を10進数で表示
for f in F: #各店の状態を10進数に置き換え
n=0
for i,x in enumerate(f):
if x==1:
n+=2**(9-i)
D.append(n)
def count_one(n):
cnt=0
for i in range(10):
cnt+=n>>i&1
return cnt
ans=float("-inf")
for i in range(1,2**10):
t=0 #temporary
for j,d in enumerate(D):
c=count_one(d&i) #両方の店が営業している時間帯の個数
t+=P[j][c]
ans=max(ans,t)
print(ans)
|
p03503
|
N=int(eval(input()))
F=[int(input().replace(' ',''),2)for _ in[0]*N]
P=[list(map(int,input().split()))for _ in[0]*N]
ans = -float('inf')
for i in range(1,2**10):
sum = 0
for k in range(N):
sum += P[k][bin(F[k]&i).count('1')]
if ans < sum:
ans = sum
print(ans)
|
N=int(eval(input()))
F=[int(input().replace(' ',''),2)for _ in[0]*N]
P=[list(map(int,input().split()))for _ in[0]*N]
print((max(sum([p[bin(f&i).count('1')]for f,p in zip(F,P)])for i in range(1,2**10))))
|
p03503
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.