s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s759129861 | p03747 | u684695949 | 1559183215 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1716 | import bisect
N,L,T= map(int,input().split())
ants = [[],[]]
for i in range(N):
X,W = map(int,input().split())
ants[W-1].append(X)
if len(ants[0]) == N:
for i in range(N):
print(((x+T)%L))
exit()
if len(ants[0]) == 0:
for i in range(N):
print(((x-T)%L))
exit()
ants_final_pos = sorted([((x+T)%L) for x in ants[0]] + [((x-T)%L) for x in ants[1]])
base_idx = ants_final_pos.index(((ants[0][0]+T)%L))
#print(f"debug ants_final_pos = {ants_final_pos}")
#print(f"debug base_idx = {base_idx}")
dist_from_next_near00_cw =[]
dist_from_next_near00_c_cw = []
old_pos = 0
for ccw in sorted([((x - ants[0][0])%L) for x in ants[1]]):
dist_from_next_near00_c_cw.append(ccw - old_pos)
old_pos = ccw
old_pos = 0
for cw in sorted([((ants[0][0] - x)%L) for x in ants[0][1:]]):
dist_from_next_near00_cw.append(cw - old_pos)
old_pos = cw
moved_dist = 0
dist_idx = [dist_from_next_near00_c_cw,dist_from_next_near00_cw]
for i in range(N-1):
rot_dir = i%2
rot_idx = i // 2
if rot_idx >= len(dist_idx[rot_dir]):
break
dist = dist_idx[rot_dir][rot_idx] / 2.0
if moved_dist + dist > L:
break
moved_dist += dist
base_idx -= i * (T // L)
#print(f"debug base_idx = {base_idx}")
moved_dist = 0
for i in range(N-1):
rot_dir = i%2
rot_idx = i // 2
if rot_idx >= len(dist_idx[rot_dir]):
print(f"debug1 i = {i}")
break
dist = dist_idx[rot_dir][rot_idx] / 2.0
if moved_dist + dist > T:
#print(f"debug2 i = {i}")
#print(f"debug2 moved_dist = {moved_dist}")
#print(f"debug2 dist = {dist}")
break
moved_dist += dist
#print(f"debug3 i = {i}")
#print(f"debug i = {i}")
base_idx -= i
#print(f"debug base_idx = {base_idx}")
for i in range(N):
print(ants_final_pos[(base_idx + i) % N])
|
s139825039 | p03747 | u684695949 | 1559183132 | Python | PyPy3 (2.4.0) | py | Runtime Error | 164 | 38384 | 1716 | import bisect
N,L,T= map(int,input().split())
ants = [[],[]]
for i in range(N):
X,W = map(int,input().split())
ants[W-1].append(X)
if len(ants[0]) == N:
for i in range(N):
print(((x+T)%L))
exit()
if len(ants[0]) == 0:
for i in range(N):
print(((x-T)%L))
exit()
ants_final_pos = sorted([((x+T)%L) for x in ants[0]] + [((x-T)%L) for x in ants[1]])
base_idx = ants_final_pos.index(((ants[0][0]+T)%L))
#print(f"debug ants_final_pos = {ants_final_pos}")
#print(f"debug base_idx = {base_idx}")
dist_from_next_near00_cw =[]
dist_from_next_near00_c_cw = []
old_pos = 0
for ccw in sorted([((x - ants[0][0])%L) for x in ants[1]]):
dist_from_next_near00_c_cw.append(ccw - old_pos)
old_pos = ccw
old_pos = 0
for cw in sorted([((ants[0][0] - x)%L) for x in ants[0][1:]]):
dist_from_next_near00_cw.append(cw - old_pos)
old_pos = cw
moved_dist = 0
dist_idx = [dist_from_next_near00_c_cw,dist_from_next_near00_cw]
for i in range(N-1):
rot_dir = i%2
rot_idx = i // 2
if rot_idx >= len(dist_idx[rot_dir]):
break
dist = dist_idx[rot_dir][rot_idx] / 2.0
if moved_dist + dist > L:
break
moved_dist += dist
base_idx -= i * (T // L)
#print(f"debug base_idx = {base_idx}")
moved_dist = 0
for i in range(N-1):
rot_dir = i%2
rot_idx = i // 2
if rot_idx >= len(dist_idx[rot_dir]):
print(f"debug1 i = {i}")
break
dist = dist_idx[rot_dir][rot_idx] / 2.0
if moved_dist + dist > T:
#print(f"debug2 i = {i}")
#print(f"debug2 moved_dist = {moved_dist}")
#print(f"debug2 dist = {dist}")
break
moved_dist += dist
#print(f"debug3 i = {i}")
#print(f"debug i = {i}")
base_idx -= i
#print(f"debug base_idx = {base_idx}")
for i in range(N):
print(ants_final_pos[(base_idx + i) % N])
|
s758218715 | p03747 | u684695949 | 1559183110 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38384 | 1746 | import bisect
N,L,T= map(int,input().split())
mod_within = lambda x: x % L
ants = [[],[]]
for i in range(N):
X,W = map(int,input().split())
ants[W-1].append(X)
if len(ants[0]) == N:
for i in range(N):
print(((x+T)%L))
exit()
if len(ants[0]) == 0:
for i in range(N):
print(((x-T)%L))
exit()
ants_final_pos = sorted([((x+T)%L) for x in ants[0]] + [((x-T)%L) for x in ants[1]])
base_idx = ants_final_pos.index(((ants[0][0]+T)%L))
#print(f"debug ants_final_pos = {ants_final_pos}")
#print(f"debug base_idx = {base_idx}")
dist_from_next_near00_cw =[]
dist_from_next_near00_c_cw = []
old_pos = 0
for ccw in sorted([((x - ants[0][0])%L) for x in ants[1]]):
dist_from_next_near00_c_cw.append(ccw - old_pos)
old_pos = ccw
old_pos = 0
for cw in sorted([((ants[0][0] - x)%L) for x in ants[0][1:]]):
dist_from_next_near00_cw.append(cw - old_pos)
old_pos = cw
moved_dist = 0
dist_idx = [dist_from_next_near00_c_cw,dist_from_next_near00_cw]
for i in range(N-1):
rot_dir = i%2
rot_idx = i // 2
if rot_idx >= len(dist_idx[rot_dir]):
break
dist = dist_idx[rot_dir][rot_idx] / 2.0
if moved_dist + dist > L:
break
moved_dist += dist
base_idx -= i * (T // L)
#print(f"debug base_idx = {base_idx}")
moved_dist = 0
for i in range(N-1):
rot_dir = i%2
rot_idx = i // 2
if rot_idx >= len(dist_idx[rot_dir]):
print(f"debug1 i = {i}")
break
dist = dist_idx[rot_dir][rot_idx] / 2.0
if moved_dist + dist > T:
#print(f"debug2 i = {i}")
#print(f"debug2 moved_dist = {moved_dist}")
#print(f"debug2 dist = {dist}")
break
moved_dist += dist
#print(f"debug3 i = {i}")
#print(f"debug i = {i}")
base_idx -= i
#print(f"debug base_idx = {base_idx}")
for i in range(N):
print(ants_final_pos[(base_idx + i) % N])
|
s559133526 | p03747 | u684695949 | 1559182909 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38256 | 1788 | import bisect
N,L,T= map(int,input().split())
mod_within = lambda x: x % L
ants = [[],[]]
for i in range(N):
X,W = map(int,input().split())
ants[W-1].append(X)
if len(ants[0]) == N:
for i in range(N):
print(mod_within(x+T))
exit()
if len(ants[0]) == 0:
for i in range(N):
print(mod_within(x-T))
exit()
ants_final_pos = sorted([mod_within(x+T) for x in ants[0]] + [mod_within(x-T) for x in ants[1]])
base_idx = ants_final_pos.index(mod_within(ants[0][0]+T))
#print(f"debug ants_final_pos = {ants_final_pos}")
#print(f"debug base_idx = {base_idx}")
dist_from_next_near00_cw =[]
dist_from_next_near00_c_cw = []
old_pos = 0
for ccw in sorted([mod_within(x - ants[0][0]) for x in ants[1]]):
dist_from_next_near00_c_cw.append(ccw - old_pos)
old_pos = ccw
old_pos = 0
for cw in sorted([mod_within(ants[0][0] - x) for x in ants[0][1:]]):
dist_from_next_near00_cw.append(cw - old_pos)
old_pos = cw
moved_dist = 0
dist_idx = [dist_from_next_near00_c_cw,dist_from_next_near00_cw]
for i in range(N-1):
rot_dir = i%2
rot_idx = i // 2
if rot_idx >= len(dist_idx[rot_dir]):
break
dist = dist_idx[rot_dir][rot_idx] / 2.0
if moved_dist + dist > L:
break
moved_dist += dist
base_idx -= i * (T // L)
#print(f"debug base_idx = {base_idx}")
moved_dist = 0
for i in range(N-1):
rot_dir = i%2
rot_idx = i // 2
if rot_idx >= len(dist_idx[rot_dir]):
print(f"debug1 i = {i}")
break
dist = dist_idx[rot_dir][rot_idx] / 2.0
if moved_dist + dist > T:
#print(f"debug2 i = {i}")
#print(f"debug2 moved_dist = {moved_dist}")
#print(f"debug2 dist = {dist}")
break
moved_dist += dist
#print(f"debug3 i = {i}")
#print(f"debug i = {i}")
base_idx -= i
#print(f"debug base_idx = {base_idx}")
for i in range(N):
print(ants_final_pos[(base_idx + i) % N])
|
s297780004 | p03747 | u182047166 | 1558467077 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 15320 | 3106 | import bisect
import sys
def input():
return sys.stdin.readline()[:-1]
# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}
# b = list(map(lambda x: math.ceil(x/10)*10, a))
n, l, t = map(int, input().split())
x = []
w = []
for i in range(n):
a, b = map(int, input().split())
x.append(a)
w.append(b)
def distance(x, y):
if x <= y:
return y-x
else:
return y+l-x
def forward(x):
x += 1
if x == l:
x = 0
return x
def back(x):
x -= 1
if x == -1:
x = l-1
return x
temp_x = x.copy()
temp_w = w.copy()
for t in range(t):
for i in range(n):
if i == 0:
if w[0] == 2:
if w[n-1] == 1 and distance(x[n-1], x[0]) == 2:
temp_x[i] = back(x[i])
temp_w[i] = 1
elif w[n-1] == 1 and distance(x[n-1], x[0]) == 1:
temp_w[i] = 1
else:
temp_x[i] = back(x[i])
elif w[i] == 1 and w[i+1] == 2:
if distance(x[i], x[i+1]) == 2:
temp_x[i] = forward(x[i])
temp_w[i] = 2
elif distance(x[i], x[i+1]) == 1:
temp_w[i] = 2
else:
temp_x[i] = forward(x[i])
elif w[i] == 1:
temp_x[i] = forward(x[i])
elif i == n-1:
if w[n-1] == 1:
if w[0] == 2 and distance(x[n-1], x[0]) == 2:
temp_x[i] = forward(x[i])
temp_w[i] = 2
elif w[0] == 2 and distance(x[n-1], x[0]) == 1:
temp_w[i] = 2
else:
temp_x[i] = forward(x[i])
elif w[i] == 2 and w[i-1] == 1:
if distance(x[i-1], x[i]) == 2:
temp_x[i] = back(x[i])
temp_w[i] = 1
elif distance(x[i-1], x[i]) == 1:
temp_w[i] = 1
else:
temp_x[i] = back(x[i])
elif w[i] == 2:
temp_x[i] = back(x[i])
else:
if w[i] == 1 and w[i+1] == 2:
if distance(x[i], x[i+1]) == 2:
temp_x[i] = forward(x[i])
temp_w[i] = 2
elif distance(x[i], x[i+1]) == 1:
temp_w[i] = 2
else:
temp_x[i] = forward(x[i])
elif w[i] == 1:
temp_x[i] = forward(x[i])
elif w[i] == 2 and w[i-1] == 1:
if distance(x[i-1], x[i]) == 2:
temp_x[i] = back(x[i])
temp_w[i] = 1
elif distance(x[i-1], x[i]) == 1:
temp_w[i] = 1
else:
temp_x[i] = back(x[i])
elif w[i] == 2:
temp_x[i] = back(x[i])
x = temp_x.copy()
w = temp_w.copy()
for i in range(n):
print(x[i])
|
s274496253 | p03747 | u260216890 | 1557161760 | Python | Python (3.4.3) | py | Runtime Error | 457 | 13648 | 615 | n, l, t = map(int,input().split())
x=[]
w=[]
for i in range(n):
x_temp, w_temp=map(int, input().split())
x.append(x_temp)
w.append(w_temp)
final_x=[]
for i in range(n):
if w[i]==1:
final_x.append((x[i]+t)%l)
elif w[i]==2:
final_x.append((x[i]-t)%l)
new_x=sorted(final_x)
cnt=0
if w[0]==2:
for i in range(1, n):
if w[i]==1 and x[i]-x[0]<t/2:
cnt-=1
cnt=cnt-(cnt%n)
elif w[1]==1:
for i in range(1, n):
if w[i]==1 and x[i]-x[0]<t/2:
cnt+=1
cnt=cnt%n
idx=new_x.index(final_x[0])-1
for i in range(n):
print(new_x[(idx+i)%n]) |
s507044755 | p03747 | u260216890 | 1557160683 | Python | Python (3.4.3) | py | Runtime Error | 453 | 12892 | 569 | n, l, t = map(int,input().split())
x=[]
w=[]
for i in range(n):
x_temp, w_temp=map(int, input().split())
x.append(x_temp)
w.append(w_temp)
final_x=[]
for i in range(n):
if w[i]==1:
final_x.append((x[i]+t)%l)
elif w[i]==2:
final_x.append((x[i]-t)%l)
cnt=0
if w[0]==2:
for i in range(1, n):
if w[i]==1 and x[i]-x[0]<=t/2:
cnt-=1
cnt=cnt-(cnt%n)
elif w[1]==1:
for i in range(1, n):
if w[i]==1 and x[i]-x[0]<=t/2:
cnt+=1
cnt=cnt%n
for p in range(n):
print(final_x[(p+cnt)%n-1]) |
s505475854 | p03747 | u909643606 | 1548547650 | Python | Python (3.4.3) | py | Runtime Error | 472 | 24240 | 3400 | #import sys
#input = sys.stdin.readline
#template input
import bisect
def IT(): #整数1個
return int(input())
def IL(): #整数複数
return [int(_) for _ in input().split()]
def IS(): #文字列複数
return [_ for _ in input().split()]
def ILS(n): #整数1つ 縦にズラーってなってるやつ
return [int(input()) for _ in range(n)]
def SLS(n): #文字列 縦にズラーってなってるやつ
return [input() for _ in range(n)]
def ILSS(n): #整数複数 縦にズラーってなってるやつ
return [[int(_) for _ in input().split()] for j in range(n)]
#template technique
def bit_full_search(ss):
n = len(ss)
for i in range(1 << n):
s = ""
for j in range(n + 1):
if ((1 & i >> j) == 1):
s += ss[j]
print(s)
def bit_full_search2(A):
#https://blog.rossywhite.com/2018/08/06/bit-search/
value = []
for i in range(1 << len(A)):
output = []
for j in range(len(A)):
if ((i >> j) & 1) == 1:
#output.append(A[j])
output.append(A[j])
value.append([format(i, 'b').zfill(16), sum(output)])
value.sort(key=lambda x:x[1])
bin = [value[k][0] for k in range(len(value))]
val = [value[k][1] for k in range(len(value))]
return bin, val
def matching_bisect(list1_val, list2_val, n):
#2分探索
j = 0
for i in range(len(list1_val)):
j = bisect.bisect_left(list2_val, n - list1_val[i])
if j < len(list2_val):
if list1_val[i] + list2_val[j] == n:
#ans = list2_bin[j] + list1_bin[i]
break
return j
"""ここからメインコード"""
def main():
n, l, t = IL()
xw = ILSS(n)
first_ant_number = 1
first_ant_direction = xw[0][1]
if first_ant_direction == 1:
first_ant_position = (xw[0][0] + t) % l
else:
first_ant_position = (xw[0][0] - t) % l
for i in range(n):
if xw[i][1] == 1:
first_ant_number = i + 1
first_ant_position = (xw[i][0] + t) % l
first_ant_direction = xw[i][1]
break
for i in range(n):
if first_ant_direction != xw[i][1]:
if t < ((xw[i][0] - first_ant_position) % l )/ 2:
hit_count = 0
else:
dt =((xw[i][0] - first_ant_position) % l )/ 2
hit_count = int ( 1 +2 * ( t - dt) // l)
first_ant_number = (first_ant_number + hit_count) % n
if first_ant_number == 0:
first_ant_number = n
ant_position = []
for i in range(n):
if xw[i][1] == 1:
pos = (xw[i][0] + t) % l
else:
pos = (xw[i][0] - t) % l
ant_position.append(pos)
ant_position.sort()
ans = [0 for i in range(n)]
for i in range(n):
if first_ant_position == ant_position[n-i-1]:
i = n - i - 1
# for j in range(n-i):
# ans[first_ant_number-1+j] = ant_position[i+j]
# for j in range(i):
# ans[first_ant_number-2-j] = ant_position[i-j-1]
for j in range(n-i):
ans[first_ant_number-1+j] = ant_position[i+j]
for j in range(i):
ans[first_ant_number-2-j] = ant_position[i-j-1]
break
for i in range(n):
print(ans[i])
main()
|
s138648501 | p03747 | u941407962 | 1539218650 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 210 | n,l,t=map(int,input().split())
a,cs=[0]*n,0
for i in range(n):
x,y=map(int,input().split())
x+=(t if y==1 else -t)
cs=(cs+x//l)%n
x%=l
a[i]=x
a.sort()
print('\n'.join([str(a[(i+cs)%n]) fori in range(n)]))
|
s270421947 | p03747 | u941407962 | 1539216151 | Python | PyPy3 (2.4.0) | py | Runtime Error | 361 | 59612 | 1370 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
# if (x + (1 if y == 1 else -1) * T)%L == 52648:
# print(x, y)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if pr_x == None:
for x in candidates:
print(x)
sys.exit()
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree <= 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree <= 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
candidates = sorted(candidates)
for i, c in enumerate(candidates):
if c == rep[1]:
start = i - rep[0]
break
for j in range(N):
if ree == 0:
1/0
# candidates[(start + j) % N + 1]
print(candidates[(start + j) % N])
|
s191730158 | p03747 | u941407962 | 1539216091 | Python | PyPy3 (2.4.0) | py | Runtime Error | 354 | 59612 | 1381 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
# if (x + (1 if y == 1 else -1) * T)%L == 52648:
# print(x, y)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if pr_x == None:
for x in candidates:
print(x)
sys.exit()
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree <= 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree <= 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
print(rep)
candidates = sorted(candidates)
for i, c in enumerate(candidates):
if c == rep[1]:
start = i - rep[0]
break
for j in range(N):
if ree == 0:
1/0
# candidates[(start + j) % N + 1]
print(candidates[(start + j) % N])
|
s073526084 | p03747 | u941407962 | 1539212488 | Python | PyPy3 (2.4.0) | py | Runtime Error | 354 | 59612 | 1282 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if pr_x == None:
for x in candidates:
print(x)
sys.exit()
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree < 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree < 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
result = []
candidates = sorted(candidates)
for i, c in enumerate(candidates):
if c == rep[1]:
start = i - rep[0]
break
for j in range(N):
if ree != 0:
print(candidates[(start + j) % N])
else:
1/0
|
s893604322 | p03747 | u941407962 | 1539212195 | Python | PyPy3 (2.4.0) | py | Runtime Error | 363 | 59612 | 1208 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree < 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree < 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
result = []
candidates = sorted(candidates)
for i, c in enumerate(candidates):
if c == rep[1]:
start = i - rep[0]
break
for j in range(N):
if ree != 0:
print(candidates[(start + j) % N])
else:
1/0
|
s885862843 | p03747 | u941407962 | 1539212167 | Python | PyPy3 (2.4.0) | py | Runtime Error | 357 | 59612 | 1219 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree < 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree < 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
print(rep)
result = []
candidates = sorted(candidates)
for i, c in enumerate(candidates):
if c == rep[1]:
start = i - rep[0]
break
for j in range(N):
if ree != 0:
print(candidates[(start + j) % N])
else:
1/0
|
s802771651 | p03747 | u941407962 | 1539203894 | Python | PyPy3 (2.4.0) | py | Runtime Error | 356 | 58588 | 1175 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree < 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree < 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
result = []
for i, c in enumerate(candidates):
if c == rep[1]:
start = i - rep[0]
break
for j in range(N):
if ree != 0:
print(candidates[(start + j) % N])
else:
1/0
|
s130693114 | p03747 | u941407962 | 1539203016 | Python | PyPy3 (2.4.0) | py | Runtime Error | 355 | 58844 | 1192 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree < 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree < 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
result = []
for i, c in enumerate(candidates):
if c == rep[1]:
start = i - rep[0]
for i in range(N):
if ree != 0:
print(candidates[(start + i) % N])
else:
print(candidates[(start + i) % N])
|
s515811768 | p03747 | u941407962 | 1539201779 | Python | PyPy3 (2.4.0) | py | Runtime Error | 352 | 58588 | 1122 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree < 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree < 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
result = []
for i in range(N):
if ree != 0:
print(candidates[(-1 * rep[0] + i) % N])
else:
print(candidates[(-1 * rep[0] + i) % N])
|
s805023290 | p03747 | u941407962 | 1539201725 | Python | PyPy3 (2.4.0) | py | Runtime Error | 349 | 58716 | 1132 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree < 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree < 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N),
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
print(rep)
result = []
for i in range(N):
if ree != 0:
print(candidates[(-1 * rep[0] + i) % N])
else:
print(candidates[(-1 * rep[0] + i) % N])
|
s362818707 | p03747 | u941407962 | 1539201107 | Python | PyPy3 (2.4.0) | py | Runtime Error | 351 | 58588 | 1137 |
import sys
N, L, T = [int(x) for x in input().strip().split(" ")]
xys = []
candidates = []
for line in sys.stdin:
x, y = line.strip().split(" ")
x, y = int(x), int(y)
xys.append((x,y))
candidates.append((x + (1 if y == 1 else -1) * T)%L)
x0, y0 = xys[0]
dxs = []
pr_x = None
counter = 0
for x, y in xys[1:]:
if y != y0:
if pr_x == None:
if y0 == 1:
a = (x - x0)
else:
dxs.append(x - pr_x)
pr_x = x
counter += 1
if y0 == 2:
a = (L - pr_x) + x0
ree = (2*T)%L
num_round = (2*T)//L
ree = ree - a
if ree < 0:
max_i = 0
else:
for i, dx in enumerate(dxs if y0 == 1 else dxs[::-1]):
ree = ree - dx
if ree < 0:
max_i = i + 1
break
else:
max_i = counter
c_n = num_round * counter + max_i - 1
rep = (
((1 if y0 == 1 else -1) * (c_n % N) % N) + 1,
((x0 + (1 if y0 == 1 else -1) * (T % L)) % L)
)
result = []
for i in range(N):
i = i + 1
if ree != 0:
print(candidates[(rep[0] + i) % N])
else:
print(candidates[(rep[0] + i - 1) % N])
|
s206956554 | p03747 | u536113865 | 1536991555 | Python | Python (3.4.3) | py | Runtime Error | 445 | 17040 | 1317 | li = lambda: list(map(int,input().split()))
n,l,t = li()
a,ac,au = [],[],[]
for i in range(n):
x,y = li()
if i == 0: start = y
a.append(x)
if y == 1:
ac.append(x)
else:
au.append(x)
tt = t%l
if not ac:
pointofone = (au[0]-t) % l
elif not au:
pointofone = (ac[0]+t) % l
elif start == 2:
acc = [n-ac[-s] for s in range(1,len(ac)+1)]
dist = au[0]+acc[0]
j = 0
for i in range(1, min(len(au), len(acc))):
if dist > tt:
j = i-1
break
if i&1:
dist += au[i]-au[i-1]
else:
dist += acc[i]-acc[i-1]
if j&1:
pointofone = (n - acc[j//2] + t)%l
else:
pointofone = (au[j//2] -t)%l
else:
acc = [-au[0]] + [n-ac[-s] for s in range(1, len(ac))]
dist = acc[0] + au[0]
j = 0
for i in range(1, min(len(ac), len(acc))):
if dist > tt:
j = i-1
break
if i&1:
dist += acc[i]-acc[i-1]
else:
dist += au[i]-au[i-1]
if j == 0:
pointofone = (ac[0] + t)%l
elif j&1:
pointofone = (au[j//2]-t)%l
else:
pointofone = (n - acc[j//2]+t)%l
ant = sorted([(s-t)%l for s in au] + [(s+t)%l for s in ac])
st = ant.index(pointofone)
ant = ant[st:]+ant[:st]
print(*ant, sep='\n')
|
s782093064 | p03747 | u536113865 | 1536990576 | Python | Python (3.4.3) | py | Runtime Error | 415 | 16672 | 1196 | li = lambda: list(map(int,input().split()))
n,l,t = li()
a,ac,au = [],[],[]
for i in range(n):
x,y = li()
if i == 0: start = y
a.append(x)
if y == 1:
ac.append(x)
else:
au.append(x)
tt = t%l
if start == 2:
acc = [n-ac[-s] for s in range(1,len(ac)+1)]
dist = au[0]+acc[0]
j = 0
for i in range(1, min(len(au), len(acc))):
if dist > tt:
j = i-1
break
if i&1:
dist += au[i]-au[i-1]
else:
dist += acc[i]-acc[i-1]
if j&1:
pointofone = n - acc[j//2]
else:
pointofone = au[j//2]
else:
acc = [-au[0]] + [n-ac[-s] for s in range(1, len(ac))]
dist = acc[0] + au[0]
j = 0
for i in range(1, min(len(ac), len(acc)) ):
if dist > tt:
j = i-1
break
if i&1:
dist += acc[i]-acc[i-1]
else:
dist += au[i]-au[i-1]
if j == 0:
pointofone = ac[0]
elif j&1:
pointofone = au[j//2]
else:
pointofone = n - acc[j//2]
ant = sorted([(s-t)%l for s in au] + [(s+t)%l for s in ac])
st = ant.index(pointofone)
ant = ant[st:]+ant[:st]
print(*ant, sep='\n')
|
s755580240 | p03747 | u536113865 | 1536990244 | Python | Python (3.4.3) | py | Runtime Error | 433 | 16704 | 1199 | li = lambda: list(map(int,input().split()))
n,l,t = li()
a,ac,au = [],[],[]
for i in range(n):
x,y = li()
if i == 0: start = y
a.append(x)
if y == 1:
ac.append(x)
else:
au.append(x)
tt = t%l
if start == 2:
acc = [n-ac[-s] for s in range(1,len(ac)+1)]
dist = au[0]+acc[0]
j = 0
for i in range(1, min(len(au), len(acc))):
if dist > tt:
j = i-1
break
if i&1:
dist += au[i]-au[i-1]
else:
dist += acc[i]-acc[i-1]
if j&1:
pointofone = n - acc[j//2]
else:
pointofone = au[j//2]
else:
acc = [-au[0]] + [n-ac[-s] for s in range(1, len(ac))]
dist = acc[0] + au[0]
j = 0
for i in range(1, min(len(ac), len(acc)) + 1):
if dist > tt:
j = i-1
break
if i&1:
dist += acc[i]-acc[i-1]
else:
dist += au[i]-au[i-1]
if j == 0:
pointofone = ac[0]
elif j&1:
pointofone = au[j//2]
else:
pointofone = n - acc[j//2]
ant = sorted([(s-t)%l for s in au] + [(s+t)%l for s in ac])
st = ant.index(pointofone)
ant = ant[st:]+ant[:st]
print(*ant, sep='\n')
|
s524228732 | p03747 | u997521090 | 1534651491 | Python | Python (2.7.6) | py | Runtime Error | 559 | 32596 | 1355 | #!/usr/bin/env python
from collections import deque
import itertools as it
import sys
import math
sys.setrecursionlimit(10000000)
N, L, T = map(int, raw_input().split())
T %= L
X1 = []
X2 = []
Xs = []
for i in range(N):
X, W = map(int, raw_input().split())
if W == 1:
X1.append(X)
else:
X2.append(X)
Xs.append((X, W))
m = {}
for loop in range(2):
pos1 = 0
pos2 = 0
bias = 0
sz = len(X2)
X2 = [X2[-1] - L] + X2 + [X2[0] + L]
for x in X1:
while True:
if X2[pos1 + 1] + bias - x <= 2 * T:
pos1 += 1
else:
break
if pos1 > sz:
bias += L
pos1 = 1
while True:
if X2[pos2 + 1] < x:
pos2 += 1
else:
break
if loop == 0:
m[x] = pos1 - pos2 + bias / L * sz
else:
m[(L - x) * (x != 0)] = pos1 - pos2 + bias / L * sz
X2 = X2[1:-1]
for i in range(len(X1)):
X1[i] = (L - X1[i]) * (X1[i] != 0)
for i in range(len(X2)):
X2[i] = (L - X2[i]) * (X2[i] != 0)
X1, X2 = X2, X1
ans = [0] * N
for i in range(N):
X, W = Xs[i]
if W == 1:
ans[(i + m[X]) % N] = (X + T) % L
else:
ans[(i - m[X]) % N] = (X - T) % L
for i in range(N):
print ans[i]
|
s457800819 | p03747 | u562016607 | 1532977610 | Python | Python (3.4.3) | py | Runtime Error | 521 | 13424 | 726 | N,L,T=map(int,input().split())
X=[0 for i in range(N)]
W=[0 for i in range(N)]
for i in range(N):
X[i],W[i]=map(int,input().split())
Y=[0 for i in range(N)]
for i in range(N):
if W[i]==1:
Y[i]=(X[i]+T)%L
else:
Y[i]=(X[i]-T)%L
def dist(i,j):
if (3-2*W[i])*(3-2*W[j])==1:
return -1
else:
if 3-2*W[i]==1:
D=(X[j]-X[i])%L
return D//2
else:
D=(X[i]-X[j])%L
return D//2
z=0
dt=3-2*W[0]
for i in range(1,N):
ds=3-2*W[i]
if dt*ds==1:
continue
z+=dt*((T//L)*2)
K=T%L
if K>=dist(0,i):
z+=dt
if K>=dist(0,i)+L//2:
z+=st
z=-z%N
Z=Y[z:]+Y[:z]
for i in range(N):
print(Z[i])
|
s677348100 | p03747 | u817026203 | 1524956155 | Python | PyPy3 (2.4.0) | py | Runtime Error | 959 | 87896 | 1051 | def main():
n, l, t = map(int, input().split())
xs, ds = [], []
for _ in range(n):
x, w = [int(c) for c in input().split()]
xs.append(x)
ds.append(1 if w == 1 else -1)
xs_thr = [(x + d * t )% l for x, d in zip(xs, ds)]
x_groups = {
-1: [x for i, x in enumerate(xs) if ds[i] == -1],
1: [x for i, x in enumerate(xs) if ds[i] == 1],
}
def bin_count(arr, v):
if v <= arr[0]:
return 0
p, q = 0, len(arr)
while q - p > 1:
m = (p + q) // 2
if arr[m] < v:
p = m
else:
q = m
return q
def collide(i):
pos = xs[i] + t * ds[i] * 2
itera = len(x_groups[-ds[i]]) * abs(pos // l)
f_delta = bin_count(x_groups[-ds[i]], xs[i])
b_delta = bin_count(x_groups[-ds[i]], pos % l)
return itera + (b_delta - f_delta) * ds[i]
for i in range(n):
print(xs_thr[(i - collide(i) * ds[i] % n + n) % n])
if __name__ == '__main__':
main() |
s627340752 | p03747 | u061545295 | 1523007114 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 25164 | 1904 | # AtCoder Grand Contest 013
#■標準入力ショートカット
def get_next_int():
return int(float(input()))
def get_next_ints(delim=" "):
return tuple([int(float(x)) for x in input().split(delim)])
def get_next_str():
return input()
def get_next_strs(delim=" "):
return tuple(input().split(delim))
def get_next_by_types(*value_types, delim=" "):
return tuple([t(x) for t, x in zip(value_types, input().split(delim))])
N, L, T = 0, 0, 0
class Ant():
def __init__(self, pos, dir):
self.pos = pos
self.dir = True if dir == 1 else False
def move(ants):
bump = [False] * N
moved = [False] * N
for i, ant in enumerate(ants):
if bump[i]:
continue
if ant.dir:
next_pos = (ant.pos + 1) % L
else:
next_pos = (
ant.pos - 1) if (ant.pos - 1) >= 0 else L - 1
if ants[i - 1].pos == next_pos and ants[i - 1].dir and not ant.dir and not moved[i - 1]:
ants[i - 1].dir = not ants[i - 1].dir
bump[i - 1] = True
ants[i].dir = not ants[i].dir
bump[i] = True
continue
elif next_pos == ants[(i + 1) % N].pos and ant.dir and not ants[(i + 1) % N].dir:
ants[i].dir = not ants[i].dir
bump[i] = True
ants[i + 1].dir = not ants[i + 1].dir
bump[i + 1] = True
continue
else:
ants[i].pos = next_pos
moved[i] = True
if moved[i - i] and ants[i - 1].pos == next_pos:
ants[i].dir = not ants[i].dir
ants[i - 1].dir = not ants[i + 1].dir
def solve():
global N, L, T
N, L, T = get_next_ints()
ants = []
for i in range(N):
ants.append(Ant(*get_next_ints()))
for i in range(T):
move(ants)
for ant in ants:
print(ant.pos)
solve() |
s238487921 | p03747 | u061545295 | 1523006906 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 39684 | 1971 | #■標準入力ショートカット
def get_next_int():
return int(float(input()))
def get_next_ints(delim=" "):
return tuple([int(float(x)) for x in input().split(delim)])
def get_next_str():
return input()
def get_next_strs(delim=" "):
return tuple(input().split(delim))
def get_next_by_types(*value_types, delim=" "):
return tuple([t(x) for t, x in zip(value_types, input().split(delim))])
N, L, T = 0, 0, 0
class Ant():
def __init__(self, pos, dir):
self.pos = pos
self.dir = True if dir == 1 else False
def move(ants):
bump = [False] * N
moved = [False] * N
for i, ant in enumerate(ants):
if bump[i]:
continue
if ant.dir:
next_pos = (ant.pos + 1) % L
else:
next_pos = (
ant.pos - 1) if (ant.pos - 1) >= 0 else L - 1
if ants[i - 1].pos == next_pos and ants[i - 1].dir and not ant.dir and not moved[i - 1]:
ants[i - 1].dir = not ants[i - 1].dir
bump[i - 1] = True
ants[i].dir = not ants[i].dir
bump[i] = True
continue
elif next_pos == ants[(i + 1) % N].pos and ant.dir and not ants[(i + 1) % N].dir:
ants[i].dir = not ants[i].dir
bump[i] = True
ants[i + 1].dir = not ants[i + 1].dir
bump[i + 1] = True
continue
else:
ants[i].pos = next_pos
moved[i] = True
if moved[i - i] and ants[i - 1].pos == next_pos:
ants[i].dir = not ants[i].dir
ants[i - 1].dir = not ants[i + 1].dir
def solve():
global N, L, T
N, L, T = get_next_ints()
ants = []
for i in range(N):
ants.append(Ant(*get_next_ints()))
for i in range(T):
move(ants)
for j, ant in enumerate(ants):
print(j, ant.pos, ant.dir)
print("")
for ant in ants:
print(ant.pos)
solve() |
s229389214 | p03747 | u602860891 | 1493240414 | Python | Python (3.4.3) | py | Runtime Error | 649 | 47996 | 1229 | N, L, T = list(map(int, input().split()))
X = []
W = []
X_after = []
for _ in range(N):
x, w = list(map(int, input().split()))
if w == 1:
x_after = (x + T) % L
else:
x_after = (x - T) % L
if x_after < 0:
x_after = L + x_after
X.append(x)
W.append(w)
X_after.append(x_after)
n_colide = 0
for i in range(1, N):
if W[0] == 1 and W[i] == 2:
dist = X[i] - X[0]
n_colide += 2 * (T - (dist / 2)) // L + 1
elif W[0] == 2 and W[i] == 1:
dist = (L + X[0]) - X[i]
n_colide += 2 * (T - (dist / 2)) // L + 1
if W[0] == 1:
num_after = W[0] + (N % n_colide)
else:
num_after = W[0] - (N % n_colide)
num_after = num_after if num_after >= 0 else L + num_after
num_after = int(num_after)
last_info = [
{"X": X_after[0], "num": num_after}
]
x_after_first = X_after[0]
X_after = sorted(X_after)
i = X_after.index(x_after_first)
X_after = X_after[i:] + X_after[:i]
for i in range(1, N):
num = num_after + i
if num >= N:
num = N - num
last_info.append({
"X": X_after[i],
"num": num,
})
sorted_info = sorted(last_info, key=lambda info: info["num"])
for info in sorted_info:
print(info["X"])
|
s465447206 | p03747 | u602860891 | 1493239403 | Python | Python (3.4.3) | py | Runtime Error | 615 | 47352 | 1107 | N, L, T = list(map(int, input().split()))
X = []
W = []
X_after = []
for _ in range(N):
x, w = list(map(int, input().split()))
if w == 1:
x_after = (x + T) % L
else:
x_after = (x - T) % L
if x_after < 0:
x_after = L + x_after
X.append(x)
W.append(w)
X_after.append(x_after)
n_colide = 0
for i in range(1, N):
if W[0] == 1 and W[i] == 2:
dist = X[i] - X[0]
n_colide += 2 * (T - (dist / 2)) // L + 1
elif W[0] == 2 and W[i] == 1:
dist = (L + X[0]) - X[i]
n_colide += 2 * (T - (dist / 2)) // L + 1
if W[0] == 1:
num_after = W[0] + (N % n_colide)
else:
num_after = W[0] - (N % n_colide)
num_after = num_after if num_after >= 0 else L + num_after
num_after = int(num_after)
last_info = [
{"X": X_after[0], "num": num_after}
]
for i in range(1, N):
num = num_after + i
if num >= N:
num = N - num
last_info.append({
"X": X_after[i],
"num": num,
})
sorted_info = sorted(last_info, key=lambda info: info["num"])
for info in sorted_info:
print(info["X"])
|
s940152051 | p03747 | u985443069 | 1492427612 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3192 | 2077 | import sys
sys.stdin = open('c2.in')
# sys.stdin = open('gen_c/c10.in')
def solve_it_large(n, l, t, x, w):
ants = []
for i in range(n):
ants.append([x[i], w[i], (x[i] + w[i] * t) % l, i])
# ants.sort()
n_intersections = 0
x0, w0, dest0, i0 = ants[0]
for x, w, dest, i in ants:
if w != w0:
d = (w0 * (x - x0) + l) % l
intersections = 0
if 2 * t >= d:
intersections = (2 * t - d) // l + 1
n_intersections += intersections
res = [0] * n
shift = n_intersections
for i in range(n):
res[ants[(i + w0 * shift) % n][3]] = ants[i][2]
return res
def solve_it_chameleons(n, l, t, x, w):
initial_color = [i for i in range(n)]
chameleons = [[x[i], w[i], initial_color[i]] for i in range(n)]
initial_color_clockwise = [chameleons[i][2] for i in range(n)]
x0, w0, color0 = chameleons[0]
for i in range(n):
if w[i] != w0:
d = (w0 * (x[i] - x0)) % l
meet = 0
if 2 * t >= d:
meet = (2 * t - d) // l + 1
color0 += w0 * meet
color0 %= n
# The chameleon (let's call him chameleon 0) initially at x0 is at (x0 + w0 * t) % l at the end,
# Initially, its color is color0 and it changed <meet> times.
# The final clockwise colors are a translation of the initial clockwise colors.
x_final = [(x[i] + w[i] * t) % l for i in range(n)]
x_final.sort()
i = x_final.index((x0 + w0 * t) % l)
if i + 1 < n and x_final[i] == x_final[i + 1]:
if w0 == 1:
i += 1
res = [0] * n
for k in range(n):
color = (color0 + k) % n
res[color] = x_final[(i+k) % n]
return res
if __name__ == '__main__':
n, l, t = map(int, input().split())
x = []
w = []
for i in range(n):
_x, _w = map(int, input().split())
if _w == 2:
_w = -1
x.append(_x)
w.append(_w)
res = solve_it_chameleons(n, l, t, x, w)
for i in range(n):
print(res[i])
|
s376205139 | p03747 | u054556734 | 1492344762 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1176 |
# アリ１からNまでの前後関係は不変。つまり、アリ１からNまでの順番は保たれる。
# アリの最終座標の昇順リストを用意して、アリ１からNに対応させればよい。
n,l,t=map(int,input().split())
x=[0 for i in range(n+1)]
w=[0 for i in range(n+1)]
ans=[] # アリの最終座標リスト
w1=[] # w=1のアリの初期座標リスト
w2=[] # w=2のアリの初期座標リスト
for i in range(1,n+1):
x[i],w[i]=map(int,input().split())
if w[i]==1: a=(x[i]+t)%l; w1.append(x[i])
if w[i]==2: a=(x[i]-t+l)%l; w2.append(x[i])
ans.append(a)
# kはアリ同士がすれ違った数
k=0
for i in range(n):
if w[i]==1: # もしw=1のアリがいないならk=0のままで問題なし。
if (x[i]+2*t)>=l:
for j in range(x[i],x[i]+2*t+1): k+=w2.count(j)
for j in range((x[i]+2*t+1)%l,x[i]): k+=w2.count(j)
else:
for j in range(x[i],x[i]+2*t+1): k+=w2.count(j)
break # １つw=1のアリ見つけたらそこで終了。
# ansをソートしてkだけ円順列的にずらして出力
ans.sort()
for i in range(n): print(ans[(i+k)%n])
|
s636786001 | p03747 | u854685751 | 1492322771 | Python | Python (3.4.3) | py | Runtime Error | 385 | 8992 | 1044 | N, L, T = list(map(int, input().split(" ")))
# N,L,T = 3,10,6
# a = [1,2,3]
# b = [2,1,1]
a = []
b = []
for i in range(N):
an, ve = map(int, input().split(" "))
a.append(an)
b.append(ve)
crash = 0
for i in range(1, N):
if b[0] != b[i]:
if b[0] == 1:
crash += (T - ((a[i] - a[0]) / 2)) // (L / 2) + 1
else:
crash += (T - (L - (a[i] - a[0])) / 2) // (L / 2) + 1
for i in range(N):
if b[i] == 1:
a[i] += T
else:
a[i] -= T
a[i] %= L
if b[0] == 1:
where = int(crash) % N
else:
where = int(-crash) % N
nowplace = a[where]
a.sort()
if b[0] == 1:
if crash % 2 == 1:
where0 = min([i for i in range(N) if a[i] == nowplace])
else:
where0 = max([i for i in range(N) if a[i] == nowplace])
else:
if crash % 2 == 1:
where0 = max([i for i in range(N) if a[i] == nowplace])
else:
where0 = min([i for i in range(N) if a[i] == nowplace])
where0 = (where0 - crash) % N
res = a[where0:] + a[:where0]
res = map(str, res)
for i in res:
print(i)
|
s116297801 | p03747 | u466826467 | 1492313295 | Python | Python (3.4.3) | py | Runtime Error | 404 | 29084 | 1134 | # N:ありの頭数 L:周の長さ T:時間。この時の状態を求める
N, L, T = list(map(int, input().split()))
ant = [list(map(int, input().split())) for i in range(N)]
line_pos = []
for i in range(0, N):
if ant[i][1] == 1:
line_pos.append(ant[i][0] + T)
else:
line_pos.append(ant[i][0] - T)
# X1についてのみみる
if ant[0][1] == 1:
crash_count = 0
for i in range(1, N):
if ant[i][1] == 2:
crash_count += (2 * T - ant[i][0] + ant[0][0]) // L + 1
else:
crash_count = 0
for i in range(1, N):
if ant[i][1] == 1:
crash_count += (2 * T - ant[i][0] + ant[0][0]) // L + 1
ans_pos = [-1 for i in range(N)]
if ant[0][1] == 1:
for i in range(0, N):
if crash_count + i < N:
ans_pos[crash_count + i] = line_pos[i] % L
else:
ans_pos[crash_count + i - N] = line_pos[i] % L
else:
for i in range(0, N):
if 0 < i - crash_count:
ans_pos[N - (i - crash_count)] = line_pos[i] % L
else:
ans_pos[i - crash_count] = line_pos[i] % L
for ans in ans_pos:
print(ans)
|
s978973397 | p03747 | u238510421 | 1492312808 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 26844 | 1669 | import numpy as np
from numpy import inf
n,l,t = list(map(int,input().split()))
x_list = list()
w_list = list()
for i in range(n):
x, w = list(map(int,input().split()))
x_list.append(x)
w_list.append(w)
d_list = list()
for i in range(len(x_list)-1):
d_list.append(x_list[i+1]-x_list[i])
d_list.append(x_list[0]+l-x_list[-1])
w_list = [w if w == 1 else -1 for w in w_list]
x_array = np.array(x_list)
w_array = np.array(w_list)
d_array = np.array(d_list)
time = 0
while time < t:
# s_list = list()
# # さが縮まるかどうか。縮まるなら1
# for i in range(len(w_list)):
# if w_array[i%n] == 1 and w_array[(i+1)%n]==-1:
# s_list.append(1)
# elif w_array[i%n] == -1 and w_array[(i+1)%n]==1:
# s_list.append(-1)
# else:
# s_list.append(0)
s_array = (w_array[1:] - w_array[:-1]) * (-1/2)
s_array = np.append(s_array,(w_array[0]-w_array[-1])*(-1/2))
# s_array = np.array(s_list)
# d_arrayには差が入っている。
butukaru_array = d_array / (s_array*2)
butukaru_array[butukaru_array == inf] = 0
if s_array.all == 0:
next_time = t -time
else:
next_time = butukaru_array.max()
time += next_time
if time >= t:
next_time -= (time-t)
x_array = (x_array + w_array*next_time)%l
d_array = d_array - s_array*2*next_time
butukatta_x = np.where(d_array == 0)[0]
# for i in butukatta_x:
w_array[butukatta_x] *= -1
w_array[(butukatta_x+1)%n] *= -1
for x in x_array:
while x<0:
x += l
while x >= l:
x -= l
print(int(x)) |
s328228617 | p03747 | u945080461 | 1492310443 | Python | Python (2.7.6) | py | Runtime Error | 179 | 21900 | 1042 | from sys import stdin
from itertools import repeat
def main():
n, l, t = map(int, stdin.readline().split())
dat = map(int, stdin.read().split(), repeat(10, 2 * n))
for i in xrange(1, n * 2, 2):
if dat[i] == 2:
dat[i] = -1
t %= l
y = [(dat[i*2] + t * dat[i*2+1]) % l for i in xrange(n)]
po = dat[0] * 2
di = dat[1]
pu = [[], [], []]
for i in xrange(n):
pu[dat[i*2+1]].append(dat[i*2] * 2)
l *= 2
pu[-1] += [x + l for x in pu[-1]]
pu[-1] = pu[-1][::-1]
pu[1] += [x + l for x in pu[1]]
pu[1] = [x - 2 * l for x in pu[1]]
if di == -1:
pu[-1].pop()
tt = 0
t *= 2
while tt < t:
x = pu[-di].pop() - di * tt
k = di * (x - po) / 2
if tt + k < t:
po += di * k
else:
po += di * (t - tt)
break
tt += k
di = -di
po = (po % l) / 2
for i, x in enumerate(y):
if po == x:
break
y = y[i:] + y[:i]
for x in y:
print x
main()
|
s709392829 | p03747 | u945080461 | 1492310303 | Python | Python (2.7.6) | py | Runtime Error | 181 | 21904 | 1021 | from sys import stdin
from itertools import repeat
def main():
n, l, t = map(int, stdin.readline().split())
dat = map(int, stdin.read().split(), repeat(10, 2 * n))
for i in xrange(1, n * 2, 2):
if dat[i] == 2:
dat[i] = -1
t %= l
y = [(dat[i*2] + t * dat[i*2+1]) % l for i in xrange(n)]
po = dat[0] * 2
di = dat[1]
pu = [[], [], []]
for i in xrange(n):
pu[dat[i*2+1]].append(dat[i*2] * 2)
l *= 2
pu[-1] += [x + l for x in pu[-1]]
pu[-1] = pu[-1][::-1]
pu[1] += [x + l for x in pu[1]]
pu[1] = [x - 2 * l for x in pu[1]]
pu[di].pop()
tt = 0
t *= 2
while tt < t:
x = pu[-di].pop() - di * tt
k = di * (x - po) / 2
if tt + k < t:
po += di * k
else:
po += di * (t - tt)
break
tt += k
di = -di
po = (po % l) / 2
for i, x in enumerate(y):
if po == x:
break
y = y[i:] + y[:i]
for x in y:
print x
main()
|
s373856368 | p03747 | u556160473 | 1492309510 | Python | Python (3.4.3) | py | Runtime Error | 2112 | 1107908 | 542 | import numpy as np
n,l,t = map(int, input().split(' '))
x,w = [],[]
x1,x2 = [],[]
for _ in range(n):
x_,w_ = map(int, input().split(' '))
x.append(x_)
w.append(w_)
if w_ == 1:
x1.append(x_)
elif w_ == 2:
x2.append(x_)
x_ = np.array(x)
w_ = np.array(w)
final_x = (x_+(-w_*2+3)*t)%l
t1 = t % (2*l)
t2 = t // (2*l)
meet = t2*(len(x1)*len(x2))
x1_ = np.array([x1])
x2_ = np.array([x2]).T
d = x2_-x1_
d %= l
meet += np.sum(d <= (2*t1))
meet %= n
ret = np.roll(final_x,-meet)
for ret_ in ret:
print(ret_) |
s035548919 | p03747 | u556160473 | 1492309354 | Python | Python (3.4.3) | py | Runtime Error | 2112 | 1110340 | 549 | import numpy as np
n,l,t = map(int, input().split(' '))
x,w = [],[]
x1,x2 = [],[]
for _ in range(n):
x_,w_ = map(int, input().split(' '))
x.append(x_)
w.append(w_)
if w_ == 1:
x1.append(x_)
elif w_ == 2:
x2.append(x_)
x_ = np.array(x)
w_ = np.array(w)
final_x = (x_+(-w_*2+3)*t)%l
t1 = t % (2*l)
t2 = t // (2*l)
meet = t2*(len(x1)*len(x2))
x1_ = np.array([x1])
x2_ = np.array([x2]).T
d = x2_-x1_
d %= l
meet += np.sum(d <= (2*t1))
meet %= n
ret = final_x[meet:]+final_x[:meet]
for ret_ in ret:
print(ret_) |
s092688272 | p03747 | u602860891 | 1492308616 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1312 |
ant_list = [] # (pos, direction)
N, L, T = list(map(int, input().split()))
for i in range(N):
pos, direction = list(map(int, input().split()))
ant_list.append(Ant(pos, direction))
for t in range(T):
clide_ant_list = get_colide_ants(ant_list)
for ant in colide_ant_list:
ant.change_direction()
for ant in ant_list:
ant.move()
clide_ant_list = get_colide_ants(ant_list)
for ant in colide_ant_list:
ant.change_direction()
ant.move()
def get_colide_ants(ant_list):
colide_ant_list = []
sorted(ant_list, key=lambda ant: ant.pos)
len_ant_list = len(ant_list)
for i in range(len_ant_list-1):
if ant_list[index].pos == ant_list[index+1].pos:
colide_ant_list.append((ant_list[i], ant_list[i+1]))
return colide_ant_list
class Ant:
def __init__(self, pos, direction):
self.pos = pos
self.direction = direction
def move():
if direction == 1:
self.pos += 1
else:
self.pos -= 1
if self.pos >= L:
self.pos = self.pos - L
if self.pos < 0:
self.pos += L + self.pos
def change_direction():
if direction == 1:
direction = 2
else:
direction = 1
|
s424473885 | p03751 | u312666261 | 1591571568 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 399 | n, k = map(int, input().split())
a = list(map(int, input().split()))
min_cost = float("inf")
for i in range(2**n):
if bin(i).count("1") != k:
continue
min_h = a[0]
cost = 0
for j in range(1, n):
if i >> j & 1:
min_h += 1
cost += max(0, min_h-a[j])
min_h = max(min_h, a[j])
min_cost = min(min_cost, cost)
print(min_cost) |
s532943686 | p03751 | u033602950 | 1589352068 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 386 | n,k = list(map(int, input().split()))
a=list(map(int, input().split()))
ans=[]
for i in range(1<<n):
if bin(i).count("1")==k:
cst=0
use=a.copy()
for u in range(1,n):
if(i>>u&1):
left_max=max(use[:u])
cst+=left_max-use[u]+1
use[u]= left_max+1
ans.append(cst)
print(min(ans))
|
s108587312 | p03751 | u579699847 | 1588359904 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 497 | def LI(): return list(map(int,input().split()))
N,K = LI()
a = LI()
ans = float('INF')
for i in range(2**(N-1)):
bit = [i>>j&1 for j in range(N-1)]
if K-1!=sum(bit):
continue
cost,kijun = 0,a[0]
for k in range(N-1):
if bit[k]==0:
kijun = max(kijun,a[k+1])
else:
if a[k+1]>=kijun+1:
kijun = a[k+1]
continue
cost += (kijun+1)-a[k+1]
kijun += 1
ans = min(ans,cost)
print(ans)
|
s658515322 | p03751 | u487523716 | 1587319782 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3444 | 4883 | #recursion-version
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_A&lang=jp
#http://penguinshunya.hatenablog.com/entry/2019/07/09/003006
import sys
sys.setrecursionlimit(10000)
inpPh = 0
debug = True
#debug = False
if not debug:
inpPh = 0
input1 ='''
4
1 2
2 3
2 4
'''[1:]
input2 ='''
4
1 2
2 4
4 3
'''[1:]
input1bk ='''
4
0 1 2
1 2 1
1 3 3
'''[1:]
#input1 = input2
output1_2='''
5 7
'''
inputXs = [input1, input2,None]
if debug:
try:
inputXs.append(inputA0)
except:
pass
else:
pass
inploc = inpPh - 1 #0,1,2
if inpPh > 0:
#print('selected_input:\n'+inputXs[inploc])
#print('')
pass
inpX_lst = []
if debug and inpPh > 0:
inpX_lst = inputXs[inploc].splitlines()
if inpPh ==0:
n = int(input())
else:
n = int(inpX_lst.pop(0) )
st_list = []
noe_vwise = [0 for _ in range(n)]
for i in range(n-1):
if inpPh ==0:
si,ti = tuple(map(lambda x: int(x), input().split() ) )
else:
si,ti = tuple(map(lambda x: int(x), inpX_lst.pop(0).split() ) )
noe_vwise[si-1] += 1
#noe_vwise[ti-1] += 1
st_list.append((si-1,ti-1))
#print(st_list)
from collections import namedtuple
INF = float('inf')
Edge = namedtuple('Edge', ['to', 'value'])
def Edge(x,y):
return (x,y)
def reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise):
def dfs1(v,v_par):
nonlocal es_vwise, dp_es_vwise, e_init, vpar_v, noe_vwise
stack = [(v,v_par)]
while stack:
(v,v_par) = stack.pop()
#print('es_vwise[v]',v,es_vwise[v])
ret = e
#ret = Edge(-INF,-INF)
ret = (0, 0)
for i in range(len(es_vwise[v]) ):
e_local = es_vwise[v][i]
if (e_local[0] == v_par):
print('this-part should not be printed')
vpar_v[v] = i
continue
dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
#dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
ret = merge(ret, dp_es_vwise[v][i] )
return ret
def dfs2(v, t):
# bundlable_parental_edge = t
nonlocal ans, es_vwise, dp_es_vwise, vpar_v, e_init, noe_vwise
nonlocal pe_vwise
if (vpar_v[v] is not None):
pass
#lift(parental_edge, gparental_edge)
#dp_es_vwise[v][vpar_v[v]] = lift(t,es_vwise[v][vpar_v[v]][1] )
l = len(es_vwise[v])
dpl = [e_init for i in range(l+1) ]
dpr = [e_init for i in range(l+1) ]
if (pe_vwise[v] is not None):
v0, v1, w = pe_vwise[v]
dpr[l] = lift(t,w)
for i in range(l):
dpl[i+1] = merge(dpl[i], dp_es_vwise[v][i])
for i in range(l-1,-1,-1):
dpr[i] = merge(dpr[i+1], dp_es_vwise[v][i])
#l: 0->1, l-1->l
#r: l->l-1, 1->0
ans[v] = dpr[0]
for i in range(l):
if (i == vpar_v[v]):
print('continue, l',0)
continue
u = es_vwise[v][i][0]
dfs2(u, merge(dpl[i], dpr[i+1]) )
def lift(a,w):
if a[1] == 0:
return (w,1)
return ( (a[0] / a[1]) + w, 1)
#w is 1, though...
#return Edge(max(0,a[0]) +w, -INF)
def merge(a,b):
# print("merge:",a,b)
return (a[0] + b[0], a[1]+b[1])
nov = n
vpar_v = [None for i in range(nov)]
vpar_v0 = [None for i in range(nov)]
for i in range(len(es_vwise)):
for e in es_vwise[i]:
vpar_v0[e[0]] = i
ans = [Edge(0,-INF) for i in range(nov)]
dfs1(0,None)
#0 must be root?
dfs2(0,None)
ret = 0
for i in range(len(ans)):
#print(f'i:{i} ans:{ans[i]}')
print(float(ans[i][0] / ans[i][1]))
return ans
class reroot_init:
def __init__(self,n,noe_vwise):
self.n = n
self.es_vwise = [ [] for i in range(n)]
self.dp_es_vwise = [ [] for i in range(n)]
self.pe_vwise = [ None for i in range(n)]
parental_edge_vwise = self.pe_vwise
def movemain(self):
reroot(n,self.es_vwise, self.dp_es_vwise, (-INF,-INF), noe_vwise, {})
def main():
rri = reroot_init(n, noe_vwise)
es_vwise = [ [] for i in range(n)]
dp_es_vwise = [ [] for i in range(n)]
pe_vwise = [ None for i in range(n)]
edges_vwise = es_vwise ; parental_edge_vwise = pe_vwise
def v_add_edge(v,u,w):
es_vwise[v].append((u,w))
dp_es_vwise[v].append((0, -INF))
for st in st_list:
s,t = st
#print(stw)
v_add_edge(s,t,1)
pe_vwise[t] = (s,t,1)
e_init = (0,0)
reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise)
main() |
s118126665 | p03751 | u143509139 | 1575690511 | Python | Python (3.4.3) | py | Runtime Error | 45 | 4852 | 279 | n=int(input())
s = [input()for _ in range(n)]
t = input()
s += t
a = s.copy()
z = s.copy()
for i in range(n):
a[i] = a[i].replace('?', 'a')
z[i] = z[i].replace('?', 'z')
a.sort()
z.sort()
idx1 = z.index(t)
idx2 = a.index(t)
print(' '.join(map(str,range(idx1 + 1, idx2 + 2)))) |
s091246140 | p03752 | u935685410 | 1600295861 | Python | Python (3.8.2) | py | Runtime Error | 87 | 9284 | 2192 | import copy
N,K = map(int,input().split())
A_list = list(map(int,input().split()))
###########
can_see = [0]
max_building = A_list[0]
for i in range(0,N-1):
if max_building < A_list[i+1]:
can_see.append(i+1)
max_building = A_list[i+1]
#print("can_see",can_see)
need_to_build = K-len(can_see)
#print("NTB",need_to_build)
#1つ目のタワーは足すことがないので抜かしてビット全探索。
#need_to_buildと同じフラグが立ったものだけ、Ｂｕｉｌｄして値段を検索
min_money = 100000000000000000
samebuilding_flag = False
for i in range(2**(N-1)):
#print("roop start")
bit_box = [0] * (N-1)
for j in range(N-1):
if (i>>j)&1:
bit_box[N-1-1-j] = 1
if N-1-j in can_see:
#print("flag apeeard")
samebuilding_flag = True
#print(bit_box)
if bit_box.count(1) != need_to_build:
#print("not match")
#print(bit_box)
pass
elif samebuilding_flag == True:
samebuilding_flag = False
pass
else:
#試すものがここに残る。
#print("try parameters")
#print(bit_box)
building_list = copy.deepcopy(A_list)
use_money = 0
bit_box_start = bit_box.index(1)
#print("BBS",bit_box_start)
for _ in range(0,len(can_see))[::-1]:
if can_see[_] < bit_box_start+1:
highest_building = building_list[can_see[_]]
break
for k in range(0,N-1):
if bit_box[k] == 1:
#print("build start building No.",k+2)
if highest_building >= building_list[k+1]:
#print("make higher")
use_money += (highest_building-building_list[k+1]+1)
#print("use_money",use_money)
#print(f"change {building_list[k+1]} to {highest_building+1} ")
building_list[k+1] = highest_building+1
highest_building = building_list[k+1]
#print("building now",building_list)
else:
#print("stay")
#print("building now",building_list)
pass
#print("use_money",use_money)
min_money = min(min_money,use_money)
#print("result",min_money)
del building_list
print(min_money)
|
s520224261 | p03752 | u771383254 | 1600202608 | Python | Python (3.8.2) | py | Runtime Error | 66 | 9128 | 410 | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = float('inf')
for bit in range(1<<(n-1)):
cand = [0]*(n-1)
for i in range(n-1):
if bit & 1<<i: cand[i] = 1
if cand.count(1) != k-1: continue
cost = 0
mx = a[0]
for i in range(1, n):
if cand[i-1]:
if a[i] <= mx:
cost += mx-a[i]+1
mx += 1
mx = max(mx, a[j])
ans = min(ans, cost)
print(ans) |
s314691534 | p03752 | u771383254 | 1600202125 | Python | Python (3.8.2) | py | Runtime Error | 63 | 9228 | 412 | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = float('inf')
for bit in range(1<<(n-1)):
cost = 0
cand = [0]*(n-1)
for i in range(n-1):
if bit & 1<<i: cand[i] = 1
if cand.count(1) != k-1: continue
mx = a[0]
for i in range(1, n):
if cand[i-1]:
if a[i] <= mx:
cost += prev-a[i]+1
ms += 1
mx = max(mx, a[j])
ans = min(ans, cost)
print(ans) |
s659619115 | p03752 | u583285098 | 1599879120 | Python | Python (3.8.2) | py | Runtime Error | 66 | 9200 | 401 | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = 10**9
for i in range(1, 2**n, 2):
if not i & 1 or k != sum([i >> j & 1 for j in range(n)]):
continue
pre = a[0]
cost = 0
for j in range(1, n):
if i >> j & 1:
tmp = max(pre - a[j] + 1, 0)
pre = a[j] + tmp
cost += tmp
ans = min(ans, cost)
print(ans+'\n')
|
s223628431 | p03752 | u523087093 | 1596987775 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9080 | 718 | N, K = map(int, input().split())
buildings = list(map(int, input().split()))
# a[1:]で大きさが上位K-1についてフラグを付ける
# フラグがついているのと前回のものの差分＋１をしていく
# この処理をK-1回行った段階で終了させる
target_list = sorted(buildings[1:], reverse=True)[:K-1]
i = 0 #ターゲットリストの添え字
cost = 0
before_building = buildings[0]
for building in buildings[1:]:
if building == target_list[i]:
cost += max(before_building - building + 1, 0)
before_building += 1
# print('cost: ', cost)
# print('before_building: ', before_building)
i += 1
if i == K:
break
print(cost) |
s092479561 | p03752 | u489691149 | 1593984481 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9256 | 755 | from itertools import combinations
n,k=map(int,input().split())
lst=list(map(int,input().split()))
work=lst[0]
ini=[x-work for x in lst]
ini_seen=[0]
work=0
for i in range(1,n):
if ini[i]>work:
work=ini[i]
ini_seen.append(i)
mn=None
for x in combinations(range(n-len(ini_seen)),k-len(ini_seen)):
sm=0
work=0
xtoken=0
count=1
for i in range(1,n):
if i in ini_seen:
count+=1
if work<ini[i] : work=ini[i]
else:
work+=1
sm+=work-ini[i]
elif i==x[xtoken]+count:
work+=1
sm+=work-ini[i]
xtoken+=1
if xtoken==k-len(ini_seen):break
if not mn : mn=sm
if mn>sm : mn=sm
print(mn)
|
s392473496 | p03752 | u880480312 | 1592849506 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9068 | 993 | #<14>
#(point)
#全探索によってどの建物が見えるようにするかを決めて必要な費用を計算。
#建物が見える = それより左にある建物maxより１大きいなので左から線形に
#最大値を更新、計算量は高々n_c_kのcombについてO(N)の操作なのでおｋ
from itertools import combinations
n, k = map(int,input().split())
a = list(map(int,input().split()))
mn = 10 ** 18
for b in combinations(range(1, n),k - 1):#一番左は固定
mx = a[0] #初期値=一番左の建物
score = 0
for j in range(1, n):
if j in b:#見えなあかん建物なら
if a[j] <= mx : #低けりゃ高くする
mx += 1
score += (mx - a[j])
else: #高さが十分なら最大値を更新するだけ
mx = a[n]
else:
mx = max(mx, a[j])#別に見えんくてもいい建物なら最大値更新
mn = min(mn, score)
print(mn)
|
s629044955 | p03752 | u312666261 | 1591578647 | Python | Python (3.4.3) | py | Runtime Error | 63 | 3572 | 552 | import copy
n, k = map(int, input().split())
alist = list(map(int, input().split()))
ans = 10**20
count = 0
tempbin = ""
maxx = 0
for i in range(2**n):
tempbin = format(i,'b')
tempbin = tempbin.zfill(n)
count = 0
templist = alist.copy()
if tempbin.count("1") != k:
continue
for j in range(1,n):
if tempbin[j] == "1":
maxx = max(templist[:j])
if maxx >= templist[j]:
count += maxx + 1 - templist[j]
templist = maxx + 1
ans = min(ans,count)
print(ans) |
s278956542 | p03752 | u227082700 | 1591561324 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 144 | n,k=map(int,input().split())
a=list(map(int,input().split()))
b=sum(sorted(a[1:])[::-1])[:k-1]
s=sum(i for i in range(2,k+1))
print(max(s-b,0))
|
s268480112 | p03752 | u227082700 | 1591561297 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 144 | n,k=map(int,input().split())
a=list(map(int,input().split()))
b=sum(sorted(a[1:]])[::-1])[:k-1]
s=sum(i for i in range(2,k+1))
print(max(s-b,0)) |
s357221302 | p03752 | u775383541 | 1591465478 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 973 | #include <bits/stdc++.h>
// #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);i++)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
const ll inf = 1LL<<60;
int main() {
int n,k,high;cin>>n>>k;
ll ans=inf;
ll now=0;
int color=0;
vector<int> a(n);
rep(i,n){
cin>>a[i];
}
for(int i=0;i<(1<<n);i++){
high=a[0];
color=1;
now=0;
for(int j=1;j<n;j++){
if(1 & (i>>j)){
if(a[j]<=high){
now+=high-a[j]+1;
high=high+1;
color+=1;
}else{
color+=1;
}
}else{
if(high<a[j]){
high=a[j];
color+=1;
}
}
}
if(k<=color){
ans=min(ans,now);
}
}
cout<<ans<<endl;
}
|
s936800788 | p03752 | u459419927 | 1591223045 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 754 | N, K = list(map(int, input().split()))
height = list(map(int, input().split()))
height2=height.copy()
ans = 10 ** 10
# if N==K:
# cost=0
# for i in range(1,N):
# if height2[i-1]>=height2[i]:
# cost+=height2[i-1]-height2[i]+1
# height2[i]+=height2[i-1]-height2[i]+1
# print(cost)
for i in range(2 ** N):
count=1
cost = 0
height2 = height.copy()
if bin(i).count("1")>=K:
for j in range(N):
if i >> j & 1:
if j!=0:
tarou=max(height2[:j])
if height2[j]<=tarou:
cost+=tarou-height2[j]+1
height2[j]+=tarou-height2[j]+1
if ans > cost
ans = cost
print(ans) |
s170547516 | p03752 | u847923740 | 1591221679 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38256 | 407 | # https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_b
from itertools import combinations
N,K=map(int,input().split())
a=list(map(int,input().split()))
minc=10**12
ai=[i for i in range(N)]
for i in combinations(ai,K):
ac=a[:]
cost=0
i=list(i)
for j in range(1,K):
costt=max(max(ac[:i[j]])-ac[i[j]]+1,0)
ac[i[j]]+=costt
costa+=costt
minc=min(cost,minc)
print(minc) |
s106664202 | p03752 | u847923740 | 1591220955 | Python | PyPy3 (2.4.0) | py | Runtime Error | 187 | 39920 | 474 | # https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_b
from itertools import combinations
N,K=map(int,input().split())
a=list(map(int,input().split()))
upend=N-1
for i in range(N):
if a[i]>a[i+1]:
upend=i
break
minc=10**12
for i in combinations(a[upend+1:],K):
cost=0
l=[a[j] for j in range(upend+1)]+list(i)
for j in range(1,K):
costt=max(l[j-1]-l[j]+1,0)
l[j]+=costt
cost+=costt
minc=min(cost,minc)
print(minc)
|
s257231791 | p03752 | u847923740 | 1591220744 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 340 | # https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_b
from itertools import combinations
N,K=map(int,input().split())
a=list(map(int,input().split()))
minc=10**12
for i in combinations(a,K):
cost=0
for j in range(1,K):
costt=max(i[j-1]-i[j]+1,0)
i[j]+=costt
cost+=costt
minc=min(cost,minc)
print(minc)
|
s000884355 | p03752 | u459419927 | 1591218277 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38256 | 567 | N,K=list(map(int,input().split()))
height=list(map(int,input().split()))
ans=10**10
for i in range(2**N):
cost=0
height2=height.copy()
for j in range(N):
if i>>j&1:
count=0
for k in range(j):
if height2[k]>=height2[j]:
cost+=height2[k]-height2[j]+1
height2[j]+=height2[k]-height2[j]+1
for x in range(1,N):
if height2[0]<height2[x]:
count+=1
if ans>cost and count==K-1:
ans=cost
print(ans) |
s336172095 | p03752 | u993435350 | 1590095991 | Python | Python (3.4.3) | py | Runtime Error | 638 | 6940 | 539 | import copy
N,K = map(int,input().split())
A = list(map(int,input().split()))
ans = [None for i in range(2 ** (N - 1))]
seen = 1 #[[A[j] for j in range(i,N) if A[j] > A[i]] for i in range(0,N)]
for i in range(2 ** (N - 1)):
AA = copy.deepcopy(A)
cost = 0
for j in range(N - 1):
m = max(AA[:j + 1])
a = AA[j + 1]
if ((i >> j) & 1) and a <= m:
cost += (m - a + 1)
AA[j + 1] = m + 1
print(AA,bin(i),cost)
if len([AA[i] for i in range(1,N) if AA[i] > A[0]]) >= K - 1:
ans[i] = cost
print(min(ans))
|
s443731409 | p03752 | u993435350 | 1590095125 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3444 | 582 | import copy
N,K = map(int,input().split())
A = list(map(int,input().split()))
ans = 10 ** 12
seen = 1 #[[A[j] for j in range(i,N) if A[j] > A[i]] for i in range(0,N)]
for i in range(2 ** (N - 1)):
AA = copy.deepcopy(A)
cost = 0
con = 0
for j in range(N - 1):
m = max(AA[:j + 1])
W
#print(AA[:j + 1])
a = AA[j + 1]
if ((i >> j) & 1) and A[j + 1] <= m:
cost += (m - a + 1)
AA[j + 1] = m + 1
con += 1
if con == K - 1:
break
if len([AA[i] for i in range(1,N) if AA[i] > A[0]]) == K - 1:
ans = min(cost,ans)
print(ans) |
s145966523 | p03752 | u033602950 | 1589352044 | Python | PyPy3 (2.4.0) | py | Runtime Error | 190 | 40428 | 386 | n,k = list(map(int, input().split()))
a=list(map(int, input().split()))
ans=[]
for i in range(1<<n):
if bin(i).count("1")==k:
cst=0
use=a.copy()
for u in range(1,n):
if(i>>u&1):
left_max=max(use[:u])
cst+=left_max-use[u]+1
use[u]= left_max+1
ans.append(cst)
print(min(ans))
|
s135211888 | p03752 | u033602950 | 1589352006 | Python | PyPy3 (2.4.0) | py | Runtime Error | 192 | 40428 | 386 | n,k = list(map(int, input().split()))
a=list(map(int, input().split()))
ans=[]
for i in range(1<<n):
if bin(i).count("1")==k:
cst=0
use=a.copy()
for u in range(1,n):
if(i>>u&1):
left_max=max(use[:u])
cst+=left_max-use[u]+1
use[u]= left_max+1
ans.append(cst)
print(min(ans))
|
s332735972 | p03752 | u135454978 | 1589326738 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1082 | # Square869120Contest #4 B - Buildings are Colorful!
import sys
N, K = map(int, sys.stdin.readline().strip().split())
a = list(map(int, sys.stdin.readline().strip().split()))
if K == 0:
break
def dfs(height=a[0], cost=0, target=K, can_see=1, i=1):
if can_see >= target:
# print('height', height)
# print('can_see', can_see)
# print('cost', cost)
return cost
# 端まで探索したとき
if i == len(a):
return float('inf')
# 建物 i を選ばない場合
if height >= a[i]:
cost1 = dfs(height=height, cost=cost, target=K, can_see=can_see, i=i+1)
else:
cost1 = dfs(height=a[i], cost=cost, target=K, can_see=can_see+1, i=i+1)
# print('cost1', cost1, 'can_see', can_see, 'i', i)
# 建物 i を選んだ場合
cost += max(0, height + 1 - a[i])
height = max(a[i], height + 1)
cost2 = dfs(height=height, cost=cost, target=K, can_see=can_see+1, i=i+1)
# print('cost2', cost2)
return min(cost1, cost2)
print(dfs(a[0], cost=0, target=K, can_see=1, i=1)) |
s847644109 | p03752 | u135454978 | 1589326693 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3192 | 1080 | # Square869120Contest #4 B - Buildings are Colorful!
import sys
N, K = map(int, sys.stdin.readline().strip().split())
a = list(map(int, sys.stdin.readline().strip().split()))
if K == 0:
break
def dfs(height=a[0], cost=0, target=K, can_see=1, i=1):
if can_see >= target:
# print('height', height)
# print('can_see', can_see)
# print('cost', cost)
return cost
# 端まで探索したとき
if i == len(a):
return float('inf')
# 建物 i を選ばない場合
if height >= a[i]:
cost1 = dfs(height=height, cost=cost, target=K, can_see=can_see, i=i+1)
else:
cost1 = dfs(height=a[i], cost=cost, target=K, can_see=can_see+1, i=i+1)
# print('cost1', cost1, 'can_see', can_see, 'i', i)
# 建物 i を選んだ場合
cost += max(0, height + 1 - a[i])
height = max(a[i], height + 1)
cost2 = dfs(height=height, cost=cost, target=K, can_see=can_see+1, i=i+1)
# print('cost2', cost2)
return min(cost1, cost2)
print(dfs(a[0], cost=0, target=K, can_see=1, i=1)) |
s386471416 | p03752 | u785883180 | 1589041979 | Python | PyPy3 (2.4.0) | py | Runtime Error | 191 | 41068 | 490 | n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=float("inf")
for i in range(2**n):
bit=[(i>>j)&1 for j in range(n)]
if sum(bit)==k and bit[0]:
cost,kijun=0,a[0]
for j in range(n):
if not bit[j]:
kijun=max(kijun,a[j+1])
continue
if a[j+1]>=kijun+1:
kijun=a[j+1]
continue
cost+=kijun+1-a[j+1]
kijun+=1
ans=min(ans,cost)
print(ans) |
s615734858 | p03752 | u785883180 | 1589041860 | Python | PyPy3 (2.4.0) | py | Runtime Error | 211 | 42844 | 468 | n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=float("inf")
for i in range(2**n):
bit=[(i>>j)&1 for j in range(n)]
if sum(bit)==k and bit[0]:
cost,kijun=0,a[0]
for j in range(n):
if not bit[j]:
kijun=max(kijun,a[k+1])
elif a[k+1]>=kijun+1:
kijun=a[k+1]
else:
cost+=kijun+1-a[k+1]
kijun+=1
ans=min(ans,cost)
print(ans) |
s312147958 | p03752 | u785883180 | 1589041288 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38256 | 398 | n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=float("inf")
for i in range(2**n):
if sum(bin(i))==k and (i>>0)&1:
l=[]
tmp=0
for j in range(n):
if (i>>j)&1: l.append(a[j])
for k in range(len(l)-1):
p=+l[k]+1-l[k+1]
if p>0:
tmp+=p
l[k+1]+=p
ans=min(ans,tmp)
print(ans) |
s243175781 | p03752 | u474484450 | 1588265091 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 527 | cin = open(0).read().strip().split('\n')
n, k = map(int, cin[0].split(' '))
a = list(map(int, cin[1].split(' ')))
ret = 0
target = [a[0]+i for i in range(1, k)]
for idx in range(2**(n-1)):
cnt = 0
tmp = 0
for i in range(n):
if (idx>>i) & 1:
tmp += target[cnt] - a[i+1] if target[cnt] > a[i+1] else 0
cnt += 1
if cnt == len(target):
if ret == 0:
ret = tmp
else:
ret = min(ret, tmp)
break
print(f'{ret}\n') |
s281120733 | p03752 | u677121387 | 1587499879 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 408 | from itertools import combinations as comb
N,K = map(int,input().split())
a = [int(i) for i in input().split()]
ans = float("INF")
for c in comb(range(1,N),K-1):
cnt = 0
color = 0
mh = a[0]
for i in range(1,N):
if i == c[color]:
cnt += max(mh-a[i]+1,0)
idx += 1
mh = max(mh+1,a[i])
if color == K-1: break
ans = min(cnt ,ans)
print(ans) |
s317284418 | p03752 | u339199690 | 1586993806 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 709 | N, K = map(int, input().split())
A = list(map(int, input().split()))
res = 1000000000
for bit in range(2 ** N):
b = [int(bin(bit)[i + 2]) for i in range(len(bin(bit)) - 2)]
if b.count(1) >= K:
b.reverse()
b_index = -1
height = 0
cnt = 0
while True:
sub = 0
if 1 in b[b_index + 1:]:
b_index = b[b_index + 1:].index(1) + b_index + 1
else:
break
if A[b_index] - height <= 0:
sub += height - A[b_index] + 1
cnt += sub
height = A[b_index] + sub
else:
height = A[b_index]
res = min(res, cnt)
print(res) |
s242150126 | p03752 | u995062424 | 1586836093 | Python | PyPy3 (2.4.0) | py | Runtime Error | 175 | 38256 | 632 | import copy
N, K = map(int, input().split())
a = list(map(int, input().split()))
ans = []
for i in range(2**N):
s = a.copy()
cnt = 0
tmp = 0
henkou = [False for _ in range(N)]
for j in range(N):
if((i >> j)&1):
henkou[j] = True
bill = s[0]
for k in range(1, N):
if(henkou[k]):
if(bill >= s[k]):
cnt += bill-s[k]+1
s[k] = bill+1
bill = s[k]
else:
if(bill >= s[k]):
tmp += 1
else:
bill = s[k]
if(N-tmp >= K):
ans.append(cnt)
print(min(ans)) |
s869151886 | p03752 | u477977638 | 1586027109 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38256 | 629 | import sys
input = sys.stdin.readline
input = sys.stdin.buffer.readline
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
# mod=10**9+7
# rstrip().decode('utf-8')
#import numpy as np
from itertools import combinations
def main():
n,k=MI()
ans=10**18
A=LI()
A=[A[0]-1]+A
for t in combinations(range(n),k):
B=A.copy()
tmp=0
for i in t:
i+=1
B[i]=max(max(B[:i])+1,A[i])
tmp+=B[i]-A[i]
ans=min(ans,tmp)
print(ans)
if __name__ == "__main__":
main()
|
s579345995 | p03752 | u969277466 | 1585269667 | Python | PyPy3 (2.4.0) | py | Runtime Error | 200 | 41196 | 716 | n,k = map(int,input().split())
a = list(map(int,input().split()))
ans = 1145141919810364364334
for i in range(1,2**n):
ls = [0] * n
qq = []
for j in range(n):
if (i >> j) & 1:
ls[j] = 1
qq.append(j)
if sum(ls) < k:
continue
elif ls[0] == 1:
t = []
for j in qq:
t.append(a[j])
mt = t[0]
cost = 0
for j in range(len(qq) - 1) :
if t[j+1] <= mt:
cost += (mt + 1 - t[j+1])
mt += 1
else:
mt = max(t[j+1] ,a[:qq[j+1]])
else:
continue
ans = min(ans,cost)
print(ans) |
s240158005 | p03752 | u705857261 | 1584205165 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38384 | 2199 |
#!/usr/bin/env python3
N, K = map(int, input().split())
l_height = list(map(int, input().split()))
# print(N, K)
# print(l_height)
costs = []
if N == K:
cost = 0
max_height = l_height[0]
for i in range(1, N):
if max_height >= l_height[i]:
cost += (max_height + 1) - l_height[i]
l_height[i] = max_height + 1
max_height = l_height[i]
costs.append(cost)
else:
for bits in range(2 ** N):
buildings = []
# bit立っている建物の番号のリストを求める
for i in range(N):
if bits & (1 << i):
buildings.append(i)
l_height_copy = l_height[:]
cost = 0
# K色の色を見えるようにしたときのcostを求める
if len(buildings) == K:
print(f"\nbits: {bin(bits)}")
print(f"buildings: {buildings}")
max_height = l_height_copy[0]
for i in range(1, N):
if i in buildings:
# print(f"i: {i} is in buildings")
# print(f"buildings: {buildings}")
# print(f"l_height_copy: {l_height_copy}")
# print(f"max_height: {max_height}")
# print(f"l_height_copy[i]: {l_height_copy[i]}")
# 建物iの高さを増やす必要があるとき
if max_height >= l_height_copy[i]:
# print("max_height >= l_height[i]")
# print(f"diff: {(max_height + 1) - l_height_copy[i]}")
cost += (max_height + 1) - l_height_copy[i]
# print(f"cost: {cost}")
l_height_copy[i] = max_height + 1
max_height = l_height_copy[i]
# print(f"updated max_height: {max_height}")
else:
max_height = l_height_copy[i]
else:
if l_height_copy[i] > max_height:
# print(f"updated max_height: {max_height}")
max_height = l_height_copy[i]
costs.append(cost)
# print(costs)
print(min(costs))
|
s392517256 | p03752 | u705857261 | 1584205141 | Python | PyPy3 (2.4.0) | py | Runtime Error | 170 | 38384 | 2670 | #!/usr/bin/env python3
N, K = map(int, input().split())
l_height = list(map(int, input().split()))
# print(N, K)
# print(l_height)
costs = []
if N == K:
cost = 0
max_height = l_height[0]
for i in range(1, N):
if max_height >= l_height[i]:
cost += (max_height + 1) - l_height[i]
l_height[i] = max_height + 1
max_height = l_height[i]
costs.append(cost)
else:
for bits in range(2 ** N):
buildings = []
# bit立っている建物の番号のリストを求める
for i in range(N):
if bits & (1 << i):
buildings.append(i)
l_height_copy = l_height[:]
cost = 0
# K色の色を見えるようにしたときのcostを求める
if len(buildings) == K:
print(f"\nbits: {bin(bits)}")
print(f"buildings: {buildings}")
max_height = l_height_copy[0]
for i in range(1, N):
if i in buildings:
# print(f"i: {i} is in buildings")
# print(f"buildings: {buildings}")
# print(f"l_height_copy: {l_height_copy}")
# print(f"max_height: {max_height}")
# print(f"l_height_copy[i]: {l_height_copy[i]}")
# 建物iの高さを増やす必要があるとき
if max_height >= l_height_copy[i]:
# print("max_height >= l_height[i]")
# print(f"diff: {(max_height + 1) - l_height_copy[i]}")
cost += (max_height + 1) - l_height_copy[i]
# print(f"cost: {cost}")
l_height_copy[i] = max_height + 1
max_height = l_height_copy[i]
# print(f"updated max_height: {max_height}")
else:
max_height = l_height_copy[i]
else:
if l_height_copy[i] > max_height:
# print(f"updated max_height: {max_height}")
max_height = l_height_copy[i]
costs.append(cost)
print(costs)
print(min(costs))
# ----- 方針 -----
# N > Kとする。
# i個目の建物高さを変更するとき1が立つN個のbitsを考える。
# bitが立っている建物の番号のリストを以下で求める。
# buildings = []
# for i in range(N):
# if bits & (1 << i):
# buildings.append(i)
# bitsのうち、K個bitが立っているものを考える。
# bitが立っている番号の建物が必ず見えるように高さを増やしたときのcostを求める。
|
s266500653 | p03752 | u707444776 | 1583995052 | Python | Python (3.4.3) | py | Runtime Error | 44 | 3064 | 665 | from bisect import bisect_left
def dfs(index):
global ans
if index == N:
if blst.count(1) == K:
tmp = a[bisect_left(blst, 1)]
anstmp = 0
for i in range(N):
if blst[i] == 0:continue
if tmp >= a[i]:
anstmp += tmp - a[i] + 1
tmp += 1
else:
tmp = a[i]
ans = min(ans, anstmp)
return
for i in range(2):
blst[index] = i
dfs(index + 1)
return
N, K = map(int, input().split())
a = list(map(int, input().split()))
blst = [0] * N
ans = float('inf')
dfs(0)
print(ans - K) |
s517015685 | p03752 | u261103969 | 1582926918 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 38640 | 1045 | # import math
# import bisect
#import numpy as np
import itertools
import copy
import sys
input = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
cmb = list(itertools.combinations([i for i in range(1, n)], k-1))
ans = INF
if k > 1:
for ele in cmb:
prc = 0
prev = a[0]
acp = a.copy()
for idx in ele:
if acp[idx] - prev <= 0:
prc += prev - acp[idx] + 1
acp[idx] = prev + 1
prev = acp[idx]
cnt = 1
mh = acp[0]
for i in range(1, n):
if mh < acp[i]:
cnt += 1
mh = acp[i]
if cnt >= k:
ans = min(ans, prc)
else:
ans = 0
print(ans)
if __name__ == '__main__':
main() |
s236207188 | p03752 | u261103969 | 1582924578 | Python | PyPy3 (2.4.0) | py | Runtime Error | 186 | 39864 | 681 | # import math
# import bisect
import numpy as np
import itertools
# import copy
import sys
input = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
cmb = list(itertools.combinations([i for i in range(1, n)], k-1))
ans = INF
for ele in cmb:
prc = 0
prev = a[0]
for idx in ele:
cur = a[idx]
if cur - prev <= 0:
prc += prev - cur + 1
cur = prev + 1
prev = cur
ans = min(ans, prc)
print(ans)
if __name__ == '__main__':
main()
|
s307189899 | p03752 | u886747123 | 1582557311 | Python | Python (3.4.3) | py | Runtime Error | 39 | 3444 | 850 | # B - Buildings are Colorful!
import sys
input = sys.stdin.buffer.readline
import itertools
N, K = map(int, input().split())
original_a = list(map(int, input().split()))
if K == 1:
print(0)
exit()
ans = float("inf")
for visible_building_indices in list(itertools.combinations(list(range(N)), K)):
a = original_a.copy()
tmp = 0
for i in range(visible_building_indices[0]):
if a[i] >= a[visible_building_indices[i]]:
tmp += a[i] - a[visible_building_indices[i]] + 1
for i in range(len(visible_building_indices)-1):
if a[visible_building_indices[i]] >= a[visible_building_indices[i+1]]:
tmp += a[visible_building_indices[i]] - a[visible_building_indices[i+1]] + 1
a[visible_building_indices[i+1]] = a[visible_building_indices[i]] + 1
ans = min(ans, tmp)
print(ans) |
s079521208 | p03752 | u644907318 | 1582492063 | Python | PyPy3 (2.4.0) | py | Runtime Error | 162 | 38256 | 478 | import ipdb
from itertools import combinations
N,K = map(int,input().split())
A = list(map(int,input().split()))
cmin = 10**12
for x in combinations(range(1,N),K-1):
C = A[:]
B = [0]
B += x
B = sorted(B)
cnt = 0
for i in range(1,K):
j0 = B[i-1]
j1 = B[i]
h = 0
for j in range(j0,j1):
h = max(h,C[j])
if C[j1]<=h:
cnt += h+1-C[j1]
C[j1] = h+1
cmin = min(cmin,cnt)
print(cmin) |
s660924513 | p03753 | u024612773 | 1492799497 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1065 | 156420 | 949 | n,m,q=map(int,input().split())
a=list(map(int,input().split()))
def count_group(size):
cc = [False]*size
for i in range(q):
j = 0
while a[i]+m*j < size:
cc[a[i]+m*j] = True
j += 1
gg = [0]*size
ox = [-1, 0, 1, 0]
oy = [0, -7, 0, 7]
def dfs(i, g):
if cc[i] or gg[i] != 0: return
gg[i] = g
for t in range(4):
if i % 7 == 0 and ox[t] == -1: continue
if (i+1) % 7 == 0 and ox[t] == 1: continue
j = i+ox[t]+oy[t]
if 0 <= j < size:
dfs(j, g)
maxg = 0
for i in range(size):
if not cc[i] and gg[i] == 0:
maxg += 1
dfs(i, maxg)
return maxg
block = (m+7)//7*7*7
if n <= block:
print(count_group(n*7))
exit(0)
c1 = count_group(block)
c2 = count_group(block*2)
c3 = count_group(block+((n*7)%block))
print(c1 + ((n*7-block)//block)*(c2-c1) + (c3-c1))
|
s692202673 | p03754 | u227082700 | 1591558297 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1063 | 126976 | 1502 | def main():
import sys
input=sys.stdin.readline
n=int(input())
identify=0
edges = [[] for _ in range(n)]
indexedges = [[] for _ in range(n)]
for _ in range(n-1):
u,v=map(int,input().split())
u-=1
v-=1
indexedges[v].append(len(edges[u]))
indexedges[u].append(len(edges[v]))
edges[u].append(v)
edges[v].append(u)
dp = [identify]*n
subdp = [len(edges[i])*[identify] for i in range(n)]
parents = [-1]*n
order = [0]
for node in order:
for mode in edges[node]:
if mode == parents[node]:
continue
order.append(mode)
parents[mode] = node
for node in order[::-1]:
parent = parents[node]
ans = identify
indexparent = -1
for j in range(len(edges[node])):
mode = edges[node][j]
if parent == mode:
indexparent = j
continue
ans += subdp[node][j]
if len(edges[node])==1:subdp[parent][indexedges[node][indexparent]]=1
else:subdp[parent][indexedges[node][indexparent]]=1+ans/(len(edges[node])-1)
for node in order:
b = [identify]*len(edges[node])
for i in range(len(edges[node])-1,0,-1):
b[i-1] = b[i]+subdp[node][i]
bb = identify
for i in range(len(edges[node])):
ans = bb+b[i]
if len(edges[node])==1:subdp[edges[node][i]][indexedges[node][i]]=ans+1
else:subdp[edges[node][i]][indexedges[node][i]]=ans/(len(edges[node])-1)+1
bb += subdp[node][i]
dp[node]=bb/len(edges[node])
print(*dp)
if __name__ == "__main__":
main()
|
s533380013 | p03754 | u227082700 | 1591558129 | Python | PyPy3 (2.4.0) | py | Runtime Error | 338 | 116472 | 1460 | def main():
n,*uv=map(int,open(0).read().split())
identify=0
edges = [[] for _ in range(n)]
indexedges = [[] for _ in range(n)]
for i in range(n-1):
u,v=uv[i*2],uv[i*2+1]
indexedges[v].append(len(edges[u]))
indexedges[u].append(len(edges[v]))
edges[u].append(v)
edges[v].append(u)
dp = [identify]*n
subdp = [len(edges[i])*[identify] for i in range(n)]
parents = [-1]*n
order = [0]
for node in order:
for mode in edges[node]:
if mode == parents[node]:
continue
order.append(mode)
parents[mode] = node
for node in order[::-1]:
parent = parents[node]
ans = identify
indexparent = -1
for j in range(len(edges[node])):
mode = edges[node][j]
if parent == mode:
indexparent = j
continue
ans += subdp[node][j]
if len(edges[node])==1:subdp[parent][indexedges[node][indexparent]]=1
else:subdp[parent][indexedges[node][indexparent]]=1+ans/(len(edges[node])-1)
for node in order:
b = [identify]*len(edges[node])
for i in range(len(edges[node])-1,0,-1):
b[i-1] = b[i]+subdp[node][i]
bb = identify
for i in range(len(edges[node])):
ans = bb+b[i]
if len(edges[node])==1:subdp[edges[node][i]][indexedges[node][i]]=ans+1
else:subdp[edges[node][i]][indexedges[node][i]]=ans/(len(edges[node])-1)+1
bb += subdp[node][i]
dp[node]=bb/len(edges[node])
print(*dp)
if __name__ == "__main__":
main()
|
s939606680 | p03754 | u487523716 | 1588299274 | Python | Python (3.4.3) | py | Runtime Error | 1061 | 93616 | 6494 | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_A&lang=jp
#http://penguinshunya.hatenablog.com/entry/2019/07/09/003006
#https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_d?lang=ja
inpPh = 0
debug = True
#debug = False
if not debug:
inpPh = 0
input1 ='''
4
1 2
2 3
2 4
'''[1:]
input2 ='''
4
1 2
2 4
4 3
'''[1:]
def file_intake():
try:
f = open('in32.txt')
except:
return None
nl ='''
'''
ret = ''.join( f.readlines() )
f.close()
return ret
input1a = file_intake()
input1bk ='''
4
0 1 2
1 2 1
1 3 3
'''[1:]
#input1 = input2
output1_2='''
2.0
1.0
2.0
2.0
3.0
1.5
3.0
1.5
'''
inputXs = [input1, input2,None]
if debug:
try:
inputXs.append(inputA0)
except:
pass
else:
pass
inploc = inpPh - 1 #0,1,2
if inpPh > 0:
#print('selected_input:\n'+inputXs[inploc])
#print('')
pass
inpX_lst = []
if debug and inpPh > 0:
inpX_lst = inputXs[inploc].splitlines()
if inpPh ==0:
n = int(input())
else:
n = int(inpX_lst.pop(0) )
st_list = []
noe_vwise = [0 for _ in range(n)]
for i in range(n-1):
if inpPh ==0:
si,ti = tuple(map(lambda x: int(x), input().split() ) )
else:
si,ti = tuple(map(lambda x: int(x), inpX_lst.pop(0).split() ) )
noe_vwise[si-1] += 1
noe_vwise[ti-1] += 1
st_list.append((si-1,ti-1))
from collections import namedtuple
INF = float('inf')
Edge = namedtuple('Edge', ['to', 'value'])
def reroot(root0,n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise):
def dfs1(v,v_par):
nonlocal es_vwise, dp_es_vwise, e_init, vpar_v, noe_vwise
ret_return = e_init
ret_return = None
stack = [(v, v_par, 0, e_init)]
while stack:
(v, v_par, i, ret_onloop ) = stack.pop()
if ( i == len(es_vwise[v]) ):
ret_return = ret_onloop
continue
e_local = es_vwise[v][i]
if ( e_local[0] == v_par):
print('v_par, not-to-see?')
vpar_v[v] = i
stack.append((v, v_par, i+1, ret_onloop))
continue
if ret_return is None:
stack.append( (v, v_par, i, ret_onloop) )
stack.append( (e_local[0], v, 0, e_init) )
continue
elif ret_return is not None:
dp_es_vwise[v][i] = lift(ret_return, e_local[1])
ret_return = None
ret_onloop = merge(ret_onloop, dp_es_vwise[v][i])
stack.append((v, v_par, i+1, ret_onloop ) )
return ret_return
def dfs2(v, t):
nonlocal ans, es_vwise, dp_es_vwise, vpar_v, e_init, noe_vwise
nonlocal pe_vwise
stack = [(v,t,None,None,None,-INF)]
while (stack):
v,t, dpl, dpr, i, imax = stack.pop()
if (vpar_v[v] is not None):
dp_es_vwise[v][vpar_v[v]] = lift(t,es_vwise[v][vpar_v[v]][1] )
if ( i == None):
l = len(es_vwise[v])
dpl = [e_init for i in range(l+1) ]
dpr = [e_init for i in range(l+1) ]
if (pe_vwise[v] is not None):
v0, v1, w = pe_vwise[v]
dpr[l] = lift(t,w)
for i in range(l):
dpl[i+1] = merge(dpl[i], dp_es_vwise[v][i])
for i in range(l-1,-1,-1):
dpr[i] = merge(dpr[i+1], dp_es_vwise[v][i])
#l: 0->1, l-1->l
#r: l->l-1, 1->0
stack.append((v, t, dpl, dpr, 0, l-1))
ans[v] = dpr[0]
else:
if (imax < i):
continue
if ( i == vpar_v[v]):
stack.append((v, t, dpl, dpr, i+1, imax ))
continue
u = es_vwise[v][i][0]
stack.append((v, t, dpl, dpr, i+1, imax ))
stack.append((u, merge(dpl[i], dpr[i+1]), None, None, None, -INF ))
def lift(a,w):
if a[1] == 0:
return (w,1)
return ( (a[0] / a[1]) + w, 1)
def merge(a,b):
# print("merge:",a,b)
return ((a[0] + b[0], a[1]+b[1]) )
nov = n
vpar_v = [None for i in range(nov)]
vpar_v0 = [None for i in range(nov)]
ans = [Edge(0,0) for i in range(nov)]
dfs1(root0,None) #print(ans)
dfs2(root0,None)
for i in range(n):
#print(f"i:{i}",ans[i])
pass
ret = 0
for i in range(len(ans)):
#print(f'i:{i} ans:{ans[i]}')
print(float(ans[i][0] / ans[i][1]))
#print((ans[i][0] , ans[i][1]))
return ans
def virtual_undirected(n,st_list): # undirected, quasi-directed
#print('arg:',n,st_list)
edst_vwise0 = edge_dst_s_vwise0 = [ [] for i in range(n)]
edst_vwise1 = [ [] for i in range(n)]
seen = [False for _ in range(n)]
vmin = INF
for st in st_list:
s,t = st
edst_vwise0[s].append(t)
edst_vwise0[t].append(s)
vmin = min(vmin,s,t)
seen[vmin] = True
stack = [vmin]
while(stack):
vcur = stack.pop()
for vnext in edst_vwise0[vcur]:
if (seen[vnext]):
continue
stack.append(vnext)
edst_vwise1[vcur].append(vnext)
seen[vnext] = True
#print('edst_vwise',edst_vwise0,edst_vwise1)
st_list1 = [ ]
for s in range(n):
for t in edst_vwise1[s]:
#print('s,t',s,t)
st_list1.append((s,t))
return vmin,st_list1
def main():
es_vwise = [ [] for i in range(n)]
dp_es_vwise = [ [] for i in range(n)]
pe_vwise = [ None for i in range(n)]
edges_vwise = es_vwise ; parental_edge_vwise = pe_vwise
def v_add_edge(v,u,w):
es_vwise[v].append((u,w))
dp_es_vwise[v].append((0, -INF))
vmin, st_list1 = virtual_undirected(n,st_list)
for st in st_list:
s,t = st
#print(stw)
v_add_edge(s,t,1)
pe_vwise[t] = (s,t,1)
e_init = (0,0)
reroot(vmin,n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise)
main()
|
s322797787 | p03754 | u487523716 | 1588224088 | Python | Python (3.4.3) | py | Runtime Error | 1063 | 119796 | 5302 | #recursion-version
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_A&lang=jp
#http://penguinshunya.hatenablog.com/entry/2019/07/09/003006
import sys
sys.setrecursionlimit(1000000)
inpPh = 0
debug = True
#debug = False
if not debug:
inpPh = 0
input1 ='''
4
1 2
2 3
2 4
'''[1:]
input2 ='''
7
1 2
1 3
2 4
2 5
3 6
3 7
'''[1:]
input1bk ='''
4
1 2
2 3
2 4
'''[1:]
#input1 = input2
output1_2='''
5 7
'''
inputXs = [input1, input2,None]
if debug:
try:
inputXs.append(inputA0)
except:
pass
else:
pass
inploc = inpPh - 1 #0,1,2
if inpPh > 0:
#print('selected_input:\n'+inputXs[inploc])
#print('')
pass
inpX_lst = []
if debug and inpPh > 0:
inpX_lst = inputXs[inploc].splitlines()
if inpPh ==0:
n = int(input())
else:
n = int(inpX_lst.pop(0) )
st_list = []
noe_vwise = [0 for _ in range(n)]
for i in range(n-1):
if inpPh ==0:
si,ti = tuple(map(lambda x: int(x), input().split() ) )
else:
si,ti = tuple(map(lambda x: int(x), inpX_lst.pop(0).split() ) )
noe_vwise[si-1] += 1
#noe_vwise[ti-1] += 1
st_list.append((si-1,ti-1))
#print(st_list)
from collections import namedtuple
INF = float('inf')
Edge = namedtuple('Edge', ['to', 'value'])
def Edge(x,y):
return (x,y)
def reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise):
def dfs1(v,v_par):
nonlocal es_vwise, dp_es_vwise, e_init, vpar_v
stack = [(v,v_par)]
while stack:
(v,v_par) = stack.pop()
#print('es_vwise[v]',v,es_vwise[v])
ret = e_init
#ret = Edge(-INF,-INF)
for i in range(len(es_vwise[v]) ):
e_local = es_vwise[v][i]
if (e_local[0] == v_par):
print('this-part should not be printed')
vpar_v[v] = i
continue
dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
#dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
ret = merge(ret, dp_es_vwise[v][i] )
return ret
def dfs2(v, t):
# bundlable_parental_edge = t
nonlocal ans, es_vwise, dp_es_vwise, vpar_v, e_init
nonlocal pe_vwise
if (vpar_v[v] is not None):
pass
#lift(parental_edge, gparental_edge)
#dp_es_vwise[v][vpar_v[v]] = lift(t,es_vwise[v][vpar_v[v]][1] )
l = len(es_vwise[v])
dpl = [e_init for i in range(l+1) ]
dpr = [e_init for i in range(l+1) ]
if (pe_vwise[v] is not None):
v0, v1, w = pe_vwise[v]
dpr[l] = lift(t,w)
for i in range(l):
dpl[i+1] = merge(dpl[i], dp_es_vwise[v][i])
for i in range(l-1,-1,-1):
dpr[i] = merge(dpr[i+1], dp_es_vwise[v][i])
#l: 0->1, l-1->l
#r: l->l-1, 1->0
ans[v] = dpr[0]
for i in range(l):
if (i == vpar_v[v]):
print('continue, l',0)
continue
u = es_vwise[v][i][0]
dfs2(u, merge(dpl[i], dpr[i+1]) )
def lift(a,w):
if a[1] == 0:
return (w,1)
return ( (a[0] / a[1]) + w, 1)
def merge(a,b):
# print("merge:",a,b)
return (a[0] + b[0], a[1]+b[1])
nov = n
vpar_v = [None for i in range(nov)]
vpar_v0 = [None for i in range(nov)]
for i in range(len(es_vwise)):
for e in es_vwise[i]:
vpar_v0[e[0]] = i
ans = [Edge(0,-INF) for i in range(nov)]
dfs1(0,None)
#0 must be root?
#print('1->2',dp_es_vwise)
dfs2(0,None)
ret = 0
for i in range(len(ans)):
#print(f'i:{i} ans:{ans[i]}')
print(float(ans[i][0] / ans[i][1]))
return ans
def virtual_undirected(n,st_list): # undirected, quasi-directed
edst_vwise0 = edge_dst_s_vwise0 = [ [] for i in range(n)]
edst_vwise1 = [ [] for i in range(n)]
seen = [False for _ in range(n)]
vmin = INF
for st in st_list:
s,t = st
edst_vwise0[s].append(t)
edst_vwise0[t].append(s)
vmin = min(vmin,s,t)
seen[vmin] = True
stack = [vmin]
while(stack):
vcur = stack.pop()
for vnext in edst_vwise0[vcur]:
if (seen[vnext]):
continue
stack.append(vnext)
edst_vwise1[vcur].append(vnext)
seen[vnext] = True
#print('edst_vwise',edst_vwise0,edst_vwise1)
st_list1 = [ ]
for s in range(n):
for t in edst_vwise1[s]:
st_list1.append((s,t))
return st_list1
def main():
es_vwise = [ [] for i in range(n)]
dp_es_vwise = [ [] for i in range(n)]
pe_vwise = [ None for i in range(n)]
edges_vwise = es_vwise ; parental_edge_vwise = pe_vwise
def v_add_edge(v,u,w):
es_vwise[v].append((u,w))
dp_es_vwise[v].append((0, -INF))
st_list1 = virtual_undirected(n,st_list)
for st in st_list:
s,t = st
#print(stw)
v_add_edge(s,t,1)
pe_vwise[t] = (s,t,1)
e_init = (0,0)
reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise)
main() |
s550343921 | p03754 | u487523716 | 1588207596 | Python | Python (3.4.3) | py | Runtime Error | 1066 | 154992 | 4823 | #recursion-version
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_A&lang=jp
#http://penguinshunya.hatenablog.com/entry/2019/07/09/003006
import sys
sys.setrecursionlimit(1000000)
inpPh = 0
debug = True
#debug = False
if not debug:
inpPh = 0
input1 ='''
12
1 2
2 3
2 4
4 5
5 6
5 7
6 8
8 9
2 10
10 11
11 12
'''[1:]
input2 ='''
7
1 2
1 3
2 4
2 5
3 6
3 7
'''[1:]
input1bk ='''
4
1 2
2 3
2 4
'''[1:]
#input1 = input2
output1_2='''
5 7
'''
inputXs = [input1, input2,None]
if debug:
try:
inputXs.append(inputA0)
except:
pass
else:
pass
inploc = inpPh - 1 #0,1,2
if inpPh > 0:
#print('selected_input:\n'+inputXs[inploc])
#print('')
pass
inpX_lst = []
if debug and inpPh > 0:
inpX_lst = inputXs[inploc].splitlines()
if inpPh ==0:
n = int(input())
else:
n = int(inpX_lst.pop(0) )
st_list = []
noe_vwise = [0 for _ in range(n)]
for i in range(n-1):
if inpPh ==0:
si,ti = tuple(map(lambda x: int(x), input().split() ) )
else:
si,ti = tuple(map(lambda x: int(x), inpX_lst.pop(0).split() ) )
noe_vwise[si-1] += 1
#noe_vwise[ti-1] += 1
st_list.append((si-1,ti-1))
#print(st_list)
from collections import namedtuple
INF = float('inf')
Edge = namedtuple('Edge', ['to', 'value'])
def Edge(x,y):
return (x,y)
def reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise):
def dfs1(v,v_par):
nonlocal es_vwise, dp_es_vwise, e_init, vpar_v
stack = [(v,v_par)]
while stack:
(v,v_par) = stack.pop()
#print('es_vwise[v]',v,es_vwise[v])
ret = e
#ret = Edge(-INF,-INF)
ret = (0, 0)
for i in range(len(es_vwise[v]) ):
e_local = es_vwise[v][i]
if (e_local[0] == v_par):
print('this-part should not be printed')
vpar_v[v] = i
continue
dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
#dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
ret = merge(ret, dp_es_vwise[v][i] )
return ret
def dfs2(v, t):
# bundlable_parental_edge = t
nonlocal ans, es_vwise, dp_es_vwise, vpar_v, e_init
nonlocal pe_vwise
if (vpar_v[v] is not None):
pass
#lift(parental_edge, gparental_edge)
#dp_es_vwise[v][vpar_v[v]] = lift(t,es_vwise[v][vpar_v[v]][1] )
l = len(es_vwise[v])
dpl = [e_init for i in range(l+1) ]
dpr = [e_init for i in range(l+1) ]
if (pe_vwise[v] is not None):
v0, v1, w = pe_vwise[v]
dpr[l] = lift(t,w)
for i in range(l):
dpl[i+1] = merge(dpl[i], dp_es_vwise[v][i])
for i in range(l-1,-1,-1):
dpr[i] = merge(dpr[i+1], dp_es_vwise[v][i])
#l: 0->1, l-1->l
#r: l->l-1, 1->0
ans[v] = dpr[0]
for i in range(l):
if (i == vpar_v[v]):
print('continue, l',0)
continue
u = es_vwise[v][i][0]
dfs2(u, merge(dpl[i], dpr[i+1]) )
def lift(a,w):
if a[1] == 0:
return (w,1)
return ( (a[0] / a[1]) + w, 1)
def merge(a,b):
# print("merge:",a,b)
return (a[0] + b[0], a[1]+b[1])
nov = n
vpar_v = [None for i in range(nov)]
vpar_v0 = [None for i in range(nov)]
for i in range(len(es_vwise)):
for e in es_vwise[i]:
vpar_v0[e[0]] = i
ans = [Edge(0,-INF) for i in range(nov)]
dfs1(0,None)
#0 must be root?
dfs2(0,None)
ret = 0
for i in range(len(ans)):
#print(f'i:{i} ans:{ans[i]}')
print(float(ans[i][0] / ans[i][1]))
return ans
class reroot_init:
def __init__(self,n,noe_vwise):
self.n = n
self.es_vwise = [ [] for i in range(n)]
self.dp_es_vwise = [ [] for i in range(n)]
self.pe_vwise = [ None for i in range(n)]
parental_edge_vwise = self.pe_vwise
def movemain(self):
reroot(n,self.es_vwise, self.dp_es_vwise, (-INF,-INF), noe_vwise, {})
def main():
rri = reroot_init(n, noe_vwise)
es_vwise = [ [] for i in range(n)]
dp_es_vwise = [ [] for i in range(n)]
pe_vwise = [ None for i in range(n)]
edges_vwise = es_vwise ; parental_edge_vwise = pe_vwise
def v_add_edge(v,u,w):
es_vwise[v].append((u,w))
dp_es_vwise[v].append((0, -INF))
for st in st_list:
s,t = st
#print(stw)
v_add_edge(s,t,1)
pe_vwise[t] = (s,t,1)
e_init = (0,0)
reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise)
main() |
s421417099 | p03754 | u487523716 | 1588205023 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1064 | 128844 | 4789 | #recursion-version
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_A&lang=jp
#http://penguinshunya.hatenablog.com/entry/2019/07/09/003006
import sys
sys.setrecursionlimit(10000)
inpPh = 0
debug = True
#debug = False
if not debug:
inpPh = 0
input1 ='''
4
1 2
2 3
2 4
'''[1:]
input2 ='''
7
1 2
1 3
2 4
2 5
3 6
3 7
'''[1:]
input1bk ='''
4
0 1 2
1 2 1
1 3 3
'''[1:]
#input1 = input2
output1_2='''
5 7
'''
inputXs = [input1, input2,None]
if debug:
try:
inputXs.append(inputA0)
except:
pass
else:
pass
inploc = inpPh - 1 #0,1,2
if inpPh > 0:
#print('selected_input:\n'+inputXs[inploc])
#print('')
pass
inpX_lst = []
if debug and inpPh > 0:
inpX_lst = inputXs[inploc].splitlines()
if inpPh ==0:
n = int(input())
else:
n = int(inpX_lst.pop(0) )
st_list = []
noe_vwise = [0 for _ in range(n)]
for i in range(n-1):
if inpPh ==0:
si,ti = tuple(map(lambda x: int(x), input().split() ) )
else:
si,ti = tuple(map(lambda x: int(x), inpX_lst.pop(0).split() ) )
noe_vwise[si-1] += 1
#noe_vwise[ti-1] += 1
st_list.append((si-1,ti-1))
#print(st_list)
from collections import namedtuple
INF = float('inf')
Edge = namedtuple('Edge', ['to', 'value'])
def Edge(x,y):
return (x,y)
def reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise):
def dfs1(v,v_par):
nonlocal es_vwise, dp_es_vwise, e_init, vpar_v
stack = [(v,v_par)]
while stack:
(v,v_par) = stack.pop()
#print('es_vwise[v]',v,es_vwise[v])
ret = e
#ret = Edge(-INF,-INF)
ret = (0, 0)
for i in range(len(es_vwise[v]) ):
e_local = es_vwise[v][i]
if (e_local[0] == v_par):
print('this-part should not be printed')
vpar_v[v] = i
continue
dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
#dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
ret = merge(ret, dp_es_vwise[v][i] )
return ret
def dfs2(v, t):
# bundlable_parental_edge = t
nonlocal ans, es_vwise, dp_es_vwise, vpar_v, e_init
nonlocal pe_vwise
if (vpar_v[v] is not None):
pass
#lift(parental_edge, gparental_edge)
#dp_es_vwise[v][vpar_v[v]] = lift(t,es_vwise[v][vpar_v[v]][1] )
l = len(es_vwise[v])
dpl = [e_init for i in range(l+1) ]
dpr = [e_init for i in range(l+1) ]
if (pe_vwise[v] is not None):
v0, v1, w = pe_vwise[v]
dpr[l] = lift(t,w)
for i in range(l):
dpl[i+1] = merge(dpl[i], dp_es_vwise[v][i])
for i in range(l-1,-1,-1):
dpr[i] = merge(dpr[i+1], dp_es_vwise[v][i])
#l: 0->1, l-1->l
#r: l->l-1, 1->0
ans[v] = dpr[0]
for i in range(l):
if (i == vpar_v[v]):
print('continue, l',0)
continue
u = es_vwise[v][i][0]
dfs2(u, merge(dpl[i], dpr[i+1]) )
def lift(a,w):
if a[1] == 0:
return (w,1)
return ( (a[0] / a[1]) + w, 1)
def merge(a,b):
# print("merge:",a,b)
return (a[0] + b[0], a[1]+b[1])
nov = n
vpar_v = [None for i in range(nov)]
vpar_v0 = [None for i in range(nov)]
for i in range(len(es_vwise)):
for e in es_vwise[i]:
vpar_v0[e[0]] = i
ans = [Edge(0,-INF) for i in range(nov)]
dfs1(0,None)
#0 must be root?
dfs2(0,None)
ret = 0
for i in range(len(ans)):
#print(f'i:{i} ans:{ans[i]}')
print(float(ans[i][0] / ans[i][1]))
return ans
class reroot_init:
def __init__(self,n,noe_vwise):
self.n = n
self.es_vwise = [ [] for i in range(n)]
self.dp_es_vwise = [ [] for i in range(n)]
self.pe_vwise = [ None for i in range(n)]
parental_edge_vwise = self.pe_vwise
def movemain(self):
reroot(n,self.es_vwise, self.dp_es_vwise, (-INF,-INF), noe_vwise, {})
def main():
rri = reroot_init(n, noe_vwise)
es_vwise = [ [] for i in range(n)]
dp_es_vwise = [ [] for i in range(n)]
pe_vwise = [ None for i in range(n)]
edges_vwise = es_vwise ; parental_edge_vwise = pe_vwise
def v_add_edge(v,u,w):
es_vwise[v].append((u,w))
dp_es_vwise[v].append((0, -INF))
for st in st_list:
s,t = st
#print(stw)
v_add_edge(s,t,1)
pe_vwise[t] = (s,t,1)
e_init = (0,0)
reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise)
main() |
s525843842 | p03754 | u487523716 | 1588204872 | Python | Python (3.4.3) | py | Runtime Error | 1065 | 141600 | 4789 | #recursion-version
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_A&lang=jp
#http://penguinshunya.hatenablog.com/entry/2019/07/09/003006
import sys
sys.setrecursionlimit(10000)
inpPh = 0
debug = True
#debug = False
if not debug:
inpPh = 0
input1 ='''
4
1 2
2 3
2 4
'''[1:]
input2 ='''
7
1 2
1 3
2 4
2 5
3 6
3 7
'''[1:]
input1bk ='''
4
0 1 2
1 2 1
1 3 3
'''[1:]
#input1 = input2
output1_2='''
5 7
'''
inputXs = [input1, input2,None]
if debug:
try:
inputXs.append(inputA0)
except:
pass
else:
pass
inploc = inpPh - 1 #0,1,2
if inpPh > 0:
#print('selected_input:\n'+inputXs[inploc])
#print('')
pass
inpX_lst = []
if debug and inpPh > 0:
inpX_lst = inputXs[inploc].splitlines()
if inpPh ==0:
n = int(input())
else:
n = int(inpX_lst.pop(0) )
st_list = []
noe_vwise = [0 for _ in range(n)]
for i in range(n-1):
if inpPh ==0:
si,ti = tuple(map(lambda x: int(x), input().split() ) )
else:
si,ti = tuple(map(lambda x: int(x), inpX_lst.pop(0).split() ) )
noe_vwise[si-1] += 1
#noe_vwise[ti-1] += 1
st_list.append((si-1,ti-1))
#print(st_list)
from collections import namedtuple
INF = float('inf')
Edge = namedtuple('Edge', ['to', 'value'])
def Edge(x,y):
return (x,y)
def reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise):
def dfs1(v,v_par):
nonlocal es_vwise, dp_es_vwise, e_init, vpar_v
stack = [(v,v_par)]
while stack:
(v,v_par) = stack.pop()
#print('es_vwise[v]',v,es_vwise[v])
ret = e
#ret = Edge(-INF,-INF)
ret = (0, 0)
for i in range(len(es_vwise[v]) ):
e_local = es_vwise[v][i]
if (e_local[0] == v_par):
print('this-part should not be printed')
vpar_v[v] = i
continue
dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
#dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
ret = merge(ret, dp_es_vwise[v][i] )
return ret
def dfs2(v, t):
# bundlable_parental_edge = t
nonlocal ans, es_vwise, dp_es_vwise, vpar_v, e_init
nonlocal pe_vwise
if (vpar_v[v] is not None):
pass
#lift(parental_edge, gparental_edge)
#dp_es_vwise[v][vpar_v[v]] = lift(t,es_vwise[v][vpar_v[v]][1] )
l = len(es_vwise[v])
dpl = [e_init for i in range(l+1) ]
dpr = [e_init for i in range(l+1) ]
if (pe_vwise[v] is not None):
v0, v1, w = pe_vwise[v]
dpr[l] = lift(t,w)
for i in range(l):
dpl[i+1] = merge(dpl[i], dp_es_vwise[v][i])
for i in range(l-1,-1,-1):
dpr[i] = merge(dpr[i+1], dp_es_vwise[v][i])
#l: 0->1, l-1->l
#r: l->l-1, 1->0
ans[v] = dpr[0]
for i in range(l):
if (i == vpar_v[v]):
print('continue, l',0)
continue
u = es_vwise[v][i][0]
dfs2(u, merge(dpl[i], dpr[i+1]) )
def lift(a,w):
if a[1] == 0:
return (w,1)
return ( (a[0] / a[1]) + w, 1)
def merge(a,b):
# print("merge:",a,b)
return (a[0] + b[0], a[1]+b[1])
nov = n
vpar_v = [None for i in range(nov)]
vpar_v0 = [None for i in range(nov)]
for i in range(len(es_vwise)):
for e in es_vwise[i]:
vpar_v0[e[0]] = i
ans = [Edge(0,-INF) for i in range(nov)]
dfs1(0,None)
#0 must be root?
dfs2(0,None)
ret = 0
for i in range(len(ans)):
#print(f'i:{i} ans:{ans[i]}')
print(float(ans[i][0] / ans[i][1]))
return ans
class reroot_init:
def __init__(self,n,noe_vwise):
self.n = n
self.es_vwise = [ [] for i in range(n)]
self.dp_es_vwise = [ [] for i in range(n)]
self.pe_vwise = [ None for i in range(n)]
parental_edge_vwise = self.pe_vwise
def movemain(self):
reroot(n,self.es_vwise, self.dp_es_vwise, (-INF,-INF), noe_vwise, {})
def main():
rri = reroot_init(n, noe_vwise)
es_vwise = [ [] for i in range(n)]
dp_es_vwise = [ [] for i in range(n)]
pe_vwise = [ None for i in range(n)]
edges_vwise = es_vwise ; parental_edge_vwise = pe_vwise
def v_add_edge(v,u,w):
es_vwise[v].append((u,w))
dp_es_vwise[v].append((0, -INF))
for st in st_list:
s,t = st
#print(stw)
v_add_edge(s,t,1)
pe_vwise[t] = (s,t,1)
e_init = (0,0)
reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise)
main() |
s148600452 | p03754 | u487523716 | 1587319846 | Python | Python (3.4.3) | py | Runtime Error | 1066 | 141624 | 4883 | #recursion-version
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_A&lang=jp
#http://penguinshunya.hatenablog.com/entry/2019/07/09/003006
import sys
sys.setrecursionlimit(10000)
inpPh = 0
debug = True
#debug = False
if not debug:
inpPh = 0
input1 ='''
4
1 2
2 3
2 4
'''[1:]
input2 ='''
4
1 2
2 4
4 3
'''[1:]
input1bk ='''
4
0 1 2
1 2 1
1 3 3
'''[1:]
#input1 = input2
output1_2='''
5 7
'''
inputXs = [input1, input2,None]
if debug:
try:
inputXs.append(inputA0)
except:
pass
else:
pass
inploc = inpPh - 1 #0,1,2
if inpPh > 0:
#print('selected_input:\n'+inputXs[inploc])
#print('')
pass
inpX_lst = []
if debug and inpPh > 0:
inpX_lst = inputXs[inploc].splitlines()
if inpPh ==0:
n = int(input())
else:
n = int(inpX_lst.pop(0) )
st_list = []
noe_vwise = [0 for _ in range(n)]
for i in range(n-1):
if inpPh ==0:
si,ti = tuple(map(lambda x: int(x), input().split() ) )
else:
si,ti = tuple(map(lambda x: int(x), inpX_lst.pop(0).split() ) )
noe_vwise[si-1] += 1
#noe_vwise[ti-1] += 1
st_list.append((si-1,ti-1))
#print(st_list)
from collections import namedtuple
INF = float('inf')
Edge = namedtuple('Edge', ['to', 'value'])
def Edge(x,y):
return (x,y)
def reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise):
def dfs1(v,v_par):
nonlocal es_vwise, dp_es_vwise, e_init, vpar_v, noe_vwise
stack = [(v,v_par)]
while stack:
(v,v_par) = stack.pop()
#print('es_vwise[v]',v,es_vwise[v])
ret = e
#ret = Edge(-INF,-INF)
ret = (0, 0)
for i in range(len(es_vwise[v]) ):
e_local = es_vwise[v][i]
if (e_local[0] == v_par):
print('this-part should not be printed')
vpar_v[v] = i
continue
dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
#dp_es_vwise[v][i] = lift(dfs1(e_local[0], v), e_local[1] )
ret = merge(ret, dp_es_vwise[v][i] )
return ret
def dfs2(v, t):
# bundlable_parental_edge = t
nonlocal ans, es_vwise, dp_es_vwise, vpar_v, e_init, noe_vwise
nonlocal pe_vwise
if (vpar_v[v] is not None):
pass
#lift(parental_edge, gparental_edge)
#dp_es_vwise[v][vpar_v[v]] = lift(t,es_vwise[v][vpar_v[v]][1] )
l = len(es_vwise[v])
dpl = [e_init for i in range(l+1) ]
dpr = [e_init for i in range(l+1) ]
if (pe_vwise[v] is not None):
v0, v1, w = pe_vwise[v]
dpr[l] = lift(t,w)
for i in range(l):
dpl[i+1] = merge(dpl[i], dp_es_vwise[v][i])
for i in range(l-1,-1,-1):
dpr[i] = merge(dpr[i+1], dp_es_vwise[v][i])
#l: 0->1, l-1->l
#r: l->l-1, 1->0
ans[v] = dpr[0]
for i in range(l):
if (i == vpar_v[v]):
print('continue, l',0)
continue
u = es_vwise[v][i][0]
dfs2(u, merge(dpl[i], dpr[i+1]) )
def lift(a,w):
if a[1] == 0:
return (w,1)
return ( (a[0] / a[1]) + w, 1)
#w is 1, though...
#return Edge(max(0,a[0]) +w, -INF)
def merge(a,b):
# print("merge:",a,b)
return (a[0] + b[0], a[1]+b[1])
nov = n
vpar_v = [None for i in range(nov)]
vpar_v0 = [None for i in range(nov)]
for i in range(len(es_vwise)):
for e in es_vwise[i]:
vpar_v0[e[0]] = i
ans = [Edge(0,-INF) for i in range(nov)]
dfs1(0,None)
#0 must be root?
dfs2(0,None)
ret = 0
for i in range(len(ans)):
#print(f'i:{i} ans:{ans[i]}')
print(float(ans[i][0] / ans[i][1]))
return ans
class reroot_init:
def __init__(self,n,noe_vwise):
self.n = n
self.es_vwise = [ [] for i in range(n)]
self.dp_es_vwise = [ [] for i in range(n)]
self.pe_vwise = [ None for i in range(n)]
parental_edge_vwise = self.pe_vwise
def movemain(self):
reroot(n,self.es_vwise, self.dp_es_vwise, (-INF,-INF), noe_vwise, {})
def main():
rri = reroot_init(n, noe_vwise)
es_vwise = [ [] for i in range(n)]
dp_es_vwise = [ [] for i in range(n)]
pe_vwise = [ None for i in range(n)]
edges_vwise = es_vwise ; parental_edge_vwise = pe_vwise
def v_add_edge(v,u,w):
es_vwise[v].append((u,w))
dp_es_vwise[v].append((0, -INF))
for st in st_list:
s,t = st
#print(stw)
v_add_edge(s,t,1)
pe_vwise[t] = (s,t,1)
e_init = (0,0)
reroot(n, es_vwise, dp_es_vwise, e_init, noe_vwise, pe_vwise)
main() |
s567020473 | p03759 | u568426505 | 1600136522 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8924 | 74 | a,b,c=map(int,input().split(" "))
print("YES") if b-a==c-b else print("NO) |
s996982119 | p03759 | u886902015 | 1599852957 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8956 | 83 | a,b,c=int(input().split())
if (b-a)==(c-b):
print("YES")
else:
print("NO")
|
s996589877 | p03759 | u886902015 | 1599852899 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9076 | 78 | a,b,c=int(input().split())
if b-a==c-b:
print("YES")
else:
print("NO") |
s682555770 | p03759 | u011872685 | 1599356121 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8872 | 85 | #58
a,b,c=map(int,input().split())
if b-a=c-b:
print('YES')
else:
print('NO') |
s564877121 | p03759 | u011872685 | 1599356087 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8948 | 85 | #58
a,b,c=map(int,input().split())
if b-a=c-b:
print('Yes')
else:
print('No') |
s848797160 | p03759 | u074220993 | 1599338010 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8944 | 69 | a, b = input().split()
print('H' if (a == 'H') ^ (b == 'D') else 'D') |
s291937032 | p03759 | u693566873 | 1599254787 | Python | PyPy3 (7.3.0) | py | Runtime Error | 87 | 74744 | 81 | a, b, c = map(int, input())
if b - a == c - b:
print('YES')
else:
print('NO') |
s075716596 | p03759 | u612975321 | 1599131479 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8944 | 82 | a, b, c = = map(int,input().split())
print('YES') if a == b == c else print('NO') |
s097213047 | p03759 | u708211626 | 1598900388 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8908 | 90 | a=list(map(int,input().split()))
if a[0]+a[2]=2*a[1]:
print('YES')
else:
print('NO') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.