input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [list([int(n)-1 for n in input().split()]) for i in range(N)]
cur = [0 for i in range(N)]
que = [i for i in range(N)]
ans = 0
while len(que) > 0:
done = {}
que2 = []
for n in que:
if done.get(n):
continue
pair = A[n][cur[n]]
if done.get(pair):
continue
if n == A[pair][cur[pair]]:
cur[n] += 1
cur[pair] += 1
done[n] = True
done[pair] = True
if cur[n] < N-1:
que2.append(n)
if cur[pair] < N-1:
que2.append(pair)
if len(done) > 0:
ans += 1
que = que2
ok = True
for i in range(N):
if cur[i] < N-1:
ok = False
if ok:
print(ans)
else:
print((-1))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N = int(eval(input()))
A = [list([int(n)-1 for n in input().split()]) for i in range(N)]
cur = [0 for i in range(N)]
que = [i for i in range(N)]
ans = 0
while len(que) > 0:
done = {}
que2 = []
for n in que:
if done.get(n):
continue
pair = A[n][cur[n]]
if done.get(pair):
continue
if n == A[pair][cur[pair]]:
cur[n] += 1
cur[pair] += 1
done[n] = True
done[pair] = True
if cur[n] < N-1:
que2.append(n)
if cur[pair] < N-1:
que2.append(pair)
if len(done) > 0:
ans += 1
que = que2
ok = True
for i in range(N):
if cur[i] < N-1:
ok = False
if ok:
print(ans)
else:
print((-1))
| p02925 |
import sys
sys.setrecursionlimit(10**7)
def dfs(v,s):
global c
seen[v]=True
for nv in G[v]:
if seen[nv]:
if nv in s:
c=True
continue
dfs(nv,s|{v})
srted.append(v)
def setID():
t=0
ID=[[None]*N for i in range(N)]
for i in range(N):
for j in range(i+1,N):
ID[i][j]=t
t+=1
for i in range(N):
for j in range(N-1):
a,b=i,A[i][j]
if(a>b):
a,b=b,a
A[i][j]=ID[a][b]
return t
N=int(eval(input()))
A=[list([int(x)-1 for x in input().split()]) for i in range(N)]
P=setID()
G=[[] for i in range(P)]
for i in range(N):
for j in range(N-2):
G[A[i][j]].append(A[i][j+1])
c=False
seen=[False]*P
srted=[]
for i in range(P):
if not seen[i]:
dfs(i,set())
if c:
print((-1))
exit()
dp=[1]*P
for v in reversed(srted):
for nv in G[v]:
dp[nv]=max(dp[nv],dp[v]+1)
print((max(dp))) | import sys
sys.setrecursionlimit(10**7)
def dfs(v,s):
global c
if c:
return
seen[v]=True
for nv in G[v]:
if seen[nv]:
if nv in s:
c=True
return
continue
dfs(nv,s|{v})
srted.append(v)
def setID():
t=0
ID=[[None]*N for i in range(N)]
for i in range(N):
for j in range(i+1,N):
ID[i][j]=t
t+=1
for i in range(N):
for j in range(N-1):
a,b=i,A[i][j]
if(a>b):
a,b=b,a
A[i][j]=ID[a][b]
return t
N=int(eval(input()))
A=[list([int(x)-1 for x in input().split()]) for i in range(N)]
P=setID()
G=[[] for i in range(P)]
for i in range(N):
for j in range(N-2):
G[A[i][j]].append(A[i][j+1])
c=False
seen=[False]*P
srted=[]
for i in range(P):
if not seen[i]:
dfs(i,set())
if c:
print((-1))
exit()
dp=[1]*P
for v in reversed(srted):
for nv in G[v]:
dp[nv]=max(dp[nv],dp[v]+1)
print((max(dp))) | p02925 |
"""
最長経路問題として解く。
各試合のノードを作成。
各試合ノードごとに、「この試合が終わったら、次はこの試合ができるようになる。」という対応関係を作っていく。
"""
def main():
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [[0]*(N)]
for _ in range(N):
A.append([0]+list(map(int,input().split())))
#選手iにとって、選手jが何番目の相手かを逆引きするメモを用意しておく。
reverseMemo = {i:{} for i in range(1,N+1)}
for i in range(1,N+1):
for j in range(1,N):
a = A[i][j]
reverseMemo[i][a] = j
matchs = []
for i in range(1,N+1):
for j in range(i+1,N+1):
matchs.append((i,j))
edges = {}
for match in matchs:
edges[match] = []
i,j = match
if reverseMemo[i][j] != N-1:
nx = A[i][reverseMemo[i][j]+1]
edges[match].append((min(i,nx),max(i,nx)))
if reverseMemo[j][i] != N-1:
nx = A[j][reverseMemo[j][i]+1]
edges[match].append((min(j,nx),max(j,nx)))
stepMemo = {}
def dfs(i,j,cnt):
if cnt > N*N:
print((-1))
exit()
#i,jの試合日を含めて、あと何日必要なのかを返す。
if (i,j) not in stepMemo:
res = 1
for a,b in edges[(i,j)]:
res = max(res,dfs(a,b,cnt+1)+1)
stepMemo[(i,j)] = res
return stepMemo[(i,j)]
ans = 0
for i in range(1,N+1):
for j in range(i+1,N+1):
ans = max(ans,dfs(i,j,1))
print(ans)
main()
| """
最長経路問題として解く。
各試合のノードを作成。
各試合ノードごとに、「この試合が終わったら、次はこの試合ができるようになる。」という対応関係を作っていく。
"""
def main():
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [[0]*(N)]
for _ in range(N):
A.append([0]+list(map(int,input().split())))
#選手iにとって、選手jが何番目の相手かを逆引きするメモを用意しておく。
reverseMemo = {i:{} for i in range(1,N+1)}
for i in range(1,N+1):
for j in range(1,N):
a = A[i][j]
reverseMemo[i][a] = j
matchs = []
for i in range(1,N+1):
for j in range(i+1,N+1):
matchs.append((i,j))
edges = {}
for match in matchs:
edges[match] = []
i,j = match
if reverseMemo[i][j] != N-1:
nx = A[i][reverseMemo[i][j]+1]
edges[match].append((min(i,nx),max(i,nx)))
if reverseMemo[j][i] != N-1:
nx = A[j][reverseMemo[j][i]+1]
edges[match].append((min(j,nx),max(j,nx)))
stepMemo = {}
def dfs(i,j,cnt):
if cnt > len(matchs):
print((-1))
exit()
#i,jの試合日を含めて、あと何日必要なのかを返す。
if (i,j) not in stepMemo:
res = 1
for a,b in edges[(i,j)]:
res = max(res,dfs(a,b,cnt+1)+1)
stepMemo[(i,j)] = res
return stepMemo[(i,j)]
ans = 0
for i in range(1,N+1):
for j in range(i+1,N+1):
ans = max(ans,dfs(i,j,1))
print(ans)
main() | p02925 |
def main():
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [[]]
for _ in range(N):
A.append([0]+list(map(int,input().split())))
#AR[i][j] => iにとって選手jとの試合が何番目か
AR = [[]]
for i in range(1,N+1):
AR.append([0]*(N+1))
for j in range(1,N):
b = A[i][j]
AR[i][b] = j
edges = {}
for i in range(1,N+1):
for j in range(i+1,N+1):
edges[(i,j)] = []
jForI = AR[i][j]
if jForI < N-1:
nxForI = A[i][jForI+1]
edges[(i,j)].append((min(i,nxForI),max(i,nxForI)))
iForJ = AR[j][i]
if iForJ < N-1:
nxForJ = A[j][iForJ+1]
edges[(i,j)].append((min(j,nxForJ),max(j,nxForJ)))
steps = {}
def dfs(i,j):
#iとjの試合を1日目とし、試合終了まで何日かかるかを返す。
if (i,j) not in steps:
steps[(i,j)] = 0
res = 1
for a,b in edges[(i,j)]:
res = max(res,dfs(a,b)+1)
steps[(i,j)] = res
elif steps[(i,j)] == 0:
print((-1))
exit()
return steps[(i,j)]
ans = 0
for i in range(1,N+1):
for j in range(i+1,N+1):
ans = max(ans,dfs(i,j))
print(ans)
main() | def main():
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [[]]
for _ in range(N):
A.append([0]+list(map(int,input().split())))
#AR[i][j] => iにとって選手jとの試合が何番目か
AR = [[]]
for i in range(1,N+1):
AR.append([0]*(N+1))
for j in range(1,N):
b = A[i][j]
AR[i][b] = j
edges = {}
for i in range(1,N+1):
for j in range(i+1,N+1):
edges[(i,j)] = []
jForI = AR[i][j]
if jForI < N-1:
nxForI = A[i][jForI+1]
edges[(i,j)].append((min(i,nxForI),max(i,nxForI)))
iForJ = AR[j][i]
if iForJ < N-1:
nxForJ = A[j][iForJ+1]
edges[(i,j)].append((min(j,nxForJ),max(j,nxForJ)))
del A
del AR
steps = {}
def dfs(i,j):
#iとjの試合を1日目とし、試合終了まで何日かかるかを返す。
if (i,j) not in steps:
steps[(i,j)] = 0
res = 1
for a,b in edges[(i,j)]:
res = max(res,dfs(a,b)+1)
steps[(i,j)] = res
elif steps[(i,j)] == 0:
print((-1))
exit()
return steps[(i,j)]
ans = 0
for i in range(1,N+1):
for j in range(i+1,N+1):
ans = max(ans,dfs(i,j))
print(ans)
main() | p02925 |
N=int(eval(input()))
a=[[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
line=list(map(int,input().split()))
for j in range(N-1):
a[i][j]=line[j]-1
a[i]=a[i][::-1]
from collections import deque
q=deque()
#seen=[[False for j in range(N)] for i in range(N)]
# 選手nが試合できるならqueに入れる
def check(i):
if len(a[i])==0:
return False
j=a[i][-1]
if a[j][-1]==i:
q.append([i,j])
for i in range(N):
check(i)
from collections import defaultdict
day=0
while q:
day+=1
q=sorted(q)
prevQ=q.copy()
q=deque()
matched=defaultdict(list)
for p in prevQ:
i=p[0]
j=p[1]
if i>j:
i,j=j,i
if matched[i]:
continue
a[i].pop()
a[j].pop()
check(i)
check(j)
matched[i].append(j)
for i in range(N):
if len(a[i])!=0:
print((-1))
break
else:
print(day) | N=int(eval(input()))
a=[[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
line=list(map(int,input().split()))
for j in range(N-1):
a[i][j]=line[j]-1
a[i]=a[i][::-1]
q=[]
#seen=[[False for j in range(N)] for i in range(N)]
# 選手nが試合できるならqueに入れる
def check(i):
if len(a[i])==0:
return False
j=a[i][-1]
if a[j][-1]==i:
q.append([i,j])
for i in range(N):
check(i)
from collections import defaultdict
day=0
while q:
day+=1
# q=sorted(q)
prevQ=q.copy()
q=[]
matched=defaultdict(list)
for p in prevQ:
i=p[0]
j=p[1]
if i>j:
i,j=j,i
if matched[i]:
continue
a[i].pop()
a[j].pop()
check(i)
check(j)
matched[i].append(j)
for i in range(N):
if len(a[i])!=0:
print((-1))
break
else:
print(day)
| p02925 |
N=int(eval(input()))
a=[[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
line=list(map(int,input().split()))
for j in range(N-1):
a[i][j]=line[j]-1
a[i]=a[i][::-1]
q=[]
#seen=[[False for j in range(N)] for i in range(N)]
# 選手nが試合できるならqueに入れる
def check(i):
if len(a[i])==0:
return False
j=a[i][-1]
if a[j][-1]==i:
q.append([i,j])
for i in range(N):
check(i)
from collections import defaultdict
day=0
while q:
day+=1
# q=sorted(q)
prevQ=q.copy()
q=[]
matched=defaultdict(list)
for p in prevQ:
i=p[0]
j=p[1]
if i>j:
i,j=j,i
if matched[i]:
continue
a[i].pop()
a[j].pop()
check(i)
check(j)
matched[i].append(j)
for i in range(N):
if len(a[i])!=0:
print((-1))
break
else:
print(day)
| N=int(eval(input()))
a=[[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
line=list(map(int,input().split()))
for j in range(N-1):
a[i][j]=line[j]-1
a[i]=a[i][::-1]
stack=[]
def addmatch(i):
if len(a[i])==0:
return
j=a[i][-1]
if a[j][-1]==i:
stack.append([i,j])
for i in range(N):
addmatch(i)
day=0
while stack:
day+=1
member=set()
for i in range(len(stack)):
g=stack.pop()
y=g[0]
x=g[1]
if len(a[y])>0 and a[y][-1]==x:
a[y].pop()
a[x].pop()
member.add(y)
member.add(x)
for m in member:
addmatch(m)
for i in range(len(a)):
if len(a[i])>0:
print((-1))
break
else:
print(day) | p02925 |
import sys
readline = sys.stdin.readline
N = int(readline())
A = [None] * N
for i in range(N):
# 後ろからpopできるように逆順リストで持つ
A[i] = list([x - 1 for x in list(map(int,readline().split()))])[::-1]
# 今日試合ができる可能性がある人リスト
candi = set(range(N))
day = 0
while True:
day += 1
nex = set()
done = set()
for player in candi:
if player in done:
continue
# player が試合できるかチェック
if not A[player]:
continue
rival = A[player][-1]
if rival in done:
continue
if A[rival][-1] == player:
# 試合できる
A[player].pop()
A[rival].pop()
if A[player]:
nex.add(player)
done.add(player)
if A[rival]:
nex.add(rival)
done.add(rival)
else:
# 試合できないが、明日も試合できる状態
nex.add(player)
if len(done) == 0:
# 一試合もできなかった
print((-1))
exit(0)
if len(nex) == 0:
print(day)
exit(0)
candi = nex | import sys
readline = sys.stdin.readline
N = int(readline())
A = [None] * N
for i in range(N):
# 後ろからpopできるように逆順リストで持つ
A[i] = list([x - 1 for x in list(map(int,readline().split()))])[::-1]
# 今日試合ができる可能性がある人リスト
candi = set(range(N))
day = 0
while candi:
day += 1
nex = set()
done = set()
for player in candi:
if player in done:
continue
# player が試合できるかチェック
if len(A[player]) == 0:
continue
rival = A[player][-1]
if rival in done:
continue
if A[rival][-1] == player:
# 試合できる
A[player].pop()
A[rival].pop()
if A[player]:
nex.add(player)
done.add(player)
if A[rival]:
nex.add(rival)
done.add(rival)
if len(done) == 0:
# 一試合もできなかった
print((-1))
exit(0)
candi = nex
print(day) | p02925 |
import sys
from collections import deque
input = sys.stdin.readline
n = int(eval(input()))
a = [deque([x for x in list(map(int, input().split()))]) for _ in range(n)]
nokori_games = n * (n - 1) / 2
day = 1
r5000 = list(range(5000))
player_in_this_game = set()
rn = list(range(n))
for _ in r5000:
for m in rn: #選手ごとに判定
#整合性のある対戦組み合わせがあれば配列から消す
#全員の判定が終わって試合が残っていたら1日増やす
if m in player_in_this_game:
#自分が既に試合が組まれている
continue
la = len(a[m])
if la: #選手に試合予定が残っている
teki = a[m][0] #対戦相手
jibun = m + 1 #自分
teki_idx = teki - 1
if teki_idx in player_in_this_game:
#相手が既に試合に組まれている
continue
if a[teki_idx][0] == jibun: #対戦相手の予定も自分でかつ相手がこのターンで試合中ではない
a[m].popleft() #自分の予定を消す
a[teki_idx].popleft() #相手の予定を消す
player_in_this_game.add(m) #自分を試合中にする
player_in_this_game.add(teki_idx) #相手を試合中にする
nokori_games -= 1 #残り試合予定を1つ減らす
if nokori_games: #残り試合があるのに
if not len(player_in_this_game): #今回対戦が組まれなければ残りの予定が不整合なのでエラー
print((-1))
sys.exit()
else: #誰も残り試合予定がなければ終了
print(day)
sys.exit()
day += 1
player_in_this_game.clear()
| import sys
import time
from collections import deque
start = time.time()
input = sys.stdin.readline
n = int(eval(input()))
a = [deque([x for x in list(map(int, input().split()))]) for _ in range(n)]
nokori_games = n * (n - 1) / 2
day = 1
r5000 = list(range(5000))
player_in_this_game = set()
rn = list(range(n))
for _ in r5000:
for m in rn: #選手ごとに判定
#整合性のある対戦組み合わせがあれば配列から消す
#全員の判定が終わって試合が残っていたら1日増やす
if m in player_in_this_game:
#自分が既に試合が組まれている
continue
la = len(a[m])
if la: #選手に試合予定が残っている
teki = a[m][0] #対戦相手
jibun = m + 1 #自分
teki_idx = teki - 1
if teki_idx in player_in_this_game:
#相手が既に試合に組まれている
continue
if a[teki_idx][0] == jibun: #対戦相手の予定も自分でかつ相手がこのターンで試合中ではない
a[m].popleft() #自分の予定を消す
a[teki_idx].popleft() #相手の予定を消す
player_in_this_game.add(m) #自分を試合中にする
player_in_this_game.add(teki_idx) #相手を試合中にする
nokori_games -= 1 #残り試合予定を1つ減らす
if nokori_games: #残り試合があるのに
if not len(player_in_this_game): #今回対戦が組まれなければ残りの予定が不整合なのでエラー
print((-1))
sys.exit()
else: #誰も残り試合予定がなければ終了
print(day)
sys.exit()
day += 1
player_in_this_game.clear()
elapsed_time = time.time() - start
if elapsed_time > 1:
print((n*(n-1)//2))
exit()
| p02925 |
import sys
input = sys.stdin.readline
N=int(eval(input()))
xs = [None]
for _ in range(N):
xs.append(list(map(int, input().split()))[::-1])
tops = [None] * (N+1)
for i in range(N):
i += 1
tops[i] = xs[i].pop()
cc = 0
rr = 0
while True:
vs = set()
nn = False
for i in range(N):
i += 1
j = tops[i]
if j == None:
continue
if i in vs or j in vs:
continue
if tops[j] == i:
nn = True
if len(xs[i]):
tops[i] = xs[i].pop()
else:
tops[i] = None
cc += 1
if len(xs[j]):
tops[j] = xs[j].pop()
else:
tops[j] = None
cc += 1
vs.add(i)
vs.add(j)
rr += 1
if cc == N:
break
if not nn:
rr = -1
break
print(rr)
| import sys
input = sys.stdin.readline
N=int(eval(input()))
xs = [None]
for _ in range(N):
xs.append(list(map(int, input().split()))[::-1])
tops = [None] * (N+1)
for i in range(N):
i += 1
tops[i] = xs[i].pop()
cc = 0
rr = 0
ns = [i+1 for i in range(N)]
while True:
vs = set()
nn = False
nns = []
for i in ns:
j = tops[i]
if j == None:
continue
if i in vs or j in vs:
continue
if tops[j] == i:
nn = True
if len(xs[i]):
tops[i] = xs[i].pop()
else:
tops[i] = None
cc += 1
if len(xs[j]):
tops[j] = xs[j].pop()
else:
tops[j] = None
cc += 1
vs.add(i)
vs.add(j)
nns.append(i)
nns.append(j)
ns = nns
rr += 1
if cc == N:
break
if not nn:
rr = -1
break
print(rr)
| p02925 |
N = int(eval(input()))
A = []
for i in range(N):
l = list(map(int,input().split()))
A.append([i-1 for i in l])
match_num = [0 for i in range(N)]
match_dict = {}
idx = 0
for i in range(N-1):
for j in range(i+1, N):
match_dict[(i,j)] = idx
idx += 1
M = idx
edge = [[] for i in range(M)]
parent = [[] for i in range(M)]
for i in range(N):
for j in range(N-2):
a = A[i][j]
a_nxt = A[i][j+1]
x,y = min(i,a), max(i,a)
z,w = min(i,a_nxt), max(i,a_nxt)
m1 = match_dict[(x,y)]
m2 = match_dict[(z,w)]
edge[m1].append(m2)
parent[m2].append(m1)
finish = [False for i in range(M)]
candidate = [i for i in range(M) if len(parent[i]) == 0]
depth = [-1 for i in range(M)]
# circuit check
search = [c for c in candidate]
edge_copy = [[e for e in edge[i]] for i in range(M)]
parent_copy = [[p for p in parent[i]] for i in range(M)]
while len(search) > 0:
s = search.pop()
del_list = []
for e in edge_copy[s]:
parent_copy[e].remove(s)
if len(parent_copy[e]) == 0:
search.append(e)
del_list.append(e)
for e in del_list:
edge_copy[s].remove(e)
if sum([len(parent_copy[i]) for i in range(M)]) > 0:
print((-1))
exit()
day = 0
while len(candidate) > 0:
new_candidate = []
for c in candidate:
for e in edge[c]:
parent[e].remove(c)
if len(parent[e]) == 0:
new_candidate.append(e)
edge[c] = []
candidate = new_candidate
day += 1
print(day) | N = int(eval(input()))
A = []
for i in range(N):
l = list(map(int,input().split()))
A.append([i-1 for i in l])
match_num = [0 for i in range(N)]
match_dict = {}
idx = 0
for i in range(N-1):
for j in range(i+1, N):
match_dict[(i,j)] = idx
idx += 1
M = idx
edge = [[] for i in range(M)]
parent = [[] for i in range(M)]
for i in range(N):
for j in range(N-2):
a = A[i][j]
a_nxt = A[i][j+1]
x,y = min(i,a), max(i,a)
z,w = min(i,a_nxt), max(i,a_nxt)
m1 = match_dict[(x,y)]
m2 = match_dict[(z,w)]
edge[m1].append(m2)
parent[m2].append(m1)
finish = [False for i in range(M)]
candidate = [i for i in range(M) if len(parent[i]) == 0]
depth = [-1 for i in range(M)]
day = 0
while len(candidate) > 0:
new_candidate = []
for c in candidate:
finish[c] = True
for e in edge[c]:
parent[e].remove(c)
if len(parent[e]) == 0:
new_candidate.append(e)
edge[c] = []
candidate = new_candidate
day += 1
print((day if all(finish) else -1)) | p02925 |
#!/usr/bin/env python3
import sys
from collections import deque
INF = float("inf")
def Topological_sorting(E):
N = len(E)
in_deg = [0]*N
for i in range(N): # ２重ループでO(E)
for to_ in E[i]:
in_deg[to_] += 1
ans = [v for v in range(N) if in_deg[v] == 0]
deq = deque(ans)
while deq: # O(V+E)
v = deq.popleft()
for t in E[v]:
in_deg[t] -= 1
if in_deg[t] == 0:
ans.append(t)
deq.append(t)
if len(ans) != N:
return False
return ans
def main():
N = int(eval(input()))
A = [None]*N
for i in range(N):
A[i] = list([int(x)-1 for x in input().split()])
def f(i, j):
# 0<=i<j<Nを満たすi,jの組を整数へ対応付ける
if i > j:
i, j = j, i
return j-1 + (N-2)*i-i*(i-1)//2
out = [[] for _ in range(N*(N-1)//2)]
# 対戦カードをノードとみなし、閉路検出と最長パス探索を行う
for i in range(N):
for j in range(N-2):
out[f(i, A[i][j])].append(f(i, A[i][j+1]))
# 閉路検出
M = (N*(N-1)//2)
order = Topological_sorting(out)
if order is False:
print((-1))
return
# 最長パスを得る
# パスは自分より下位の情報が必要なので、post_orderで見る
depth = [-1]*M
longest = -1
for i in reversed(order):
if depth[i] == -1:
depth[i] = 1
for u in out[i]:
depth[i] = max(depth[i], 1+depth[u])
longest = max(depth[i], longest)
print(longest)
# print(depth)
return
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
from collections import deque
def Topological_sorting(E):
N = len(E)
in_deg = [0]*N
for i in range(N): # ２重ループでO(E)
for to_ in E[i]:
in_deg[to_] += 1
ans = [v for v in range(N) if in_deg[v] == 0]
deq = deque(ans)
while deq: # O(V+E)
v = deq.popleft()
for t in E[v]:
in_deg[t] -= 1
if in_deg[t] == 0:
ans.append(t)
deq.append(t)
if len(ans) != N:
return False
return ans
def main():
N = int(eval(input()))
A = [None]*N
for i in range(N):
A[i] = list([int(x)-1 for x in input().split()])
# 0<=i<j<Nを満たすi,jの組を整数へ対応付ける
MP = [[0]*N for _ in range(N)]
cnt = 0
for i in range(N):
for j in range(i+1, N):
MP[i][j] = cnt
MP[j][i] = cnt
cnt += 1
out = [[] for _ in range(N*(N-1)//2)]
# 対戦カードをノードとみなし、閉路検出と最長パス探索を行う
for i in range(N):
for j in range(N-2):
out[MP[i][A[i][j]]].append(MP[i][A[i][j+1]])
# 閉路検出
M = N*(N-1)//2
order = Topological_sorting(out)
if order is False:
print((-1))
return
# 最長パスを得る
# 枝の格納方法から、パスは自分の下位の情報から作る。
# post_order-likeに見る
depth = [1]*M
longest = 1
for i in reversed(order):
for u in out[i]:
depth[i] = max(depth[i], 1+depth[u])
longest = max(depth[i], longest)
print(longest)
return
if __name__ == '__main__':
main()
| p02925 |
# -*- coding: utf-8 -*-
from sys import stdin
# import numpy as np
from collections import deque
# import sys
# sys.setrecursionlimit(10**4)
def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list([int(x)-1 for x in stdin.readline().split()])
def _lf(): return list(map(float, stdin.readline().split()))
def _ls(): return stdin.readline().split()
def _i(): return int(stdin.readline())
def _f(): return float(stdin.readline())
def _s(): return stdin.readline()[:-1]
N = _i()
move_in = [[[] for i in range(N)] for j in range(N)]
move_out = [[[] for i in range(N)] for j in range(N)]
cost = [[0] * N for _ in range(N)]
start_pair = []
for i in range(N):
a_list = _li_()
start_pair.append(a_list[0])
for j in range(N-2):
start = [min(i, a_list[j]), max(i, a_list[j])]
end = [min(i, a_list[j+1]), max(i, a_list[j+1])]
move_in[end[0]][end[1]].append((start[0], start[1]))
move_out[start[0]][start[1]].append((end[0], end[1]))
count = 0
stack = deque([])
for i in range(N):
pair = start_pair[i]
if i < pair and i == start_pair[pair]:
stack.append((i, start_pair[i])) # 3つ目は距離
cost[i][start_pair[i]] = 1
count += 1
ans = 0
while stack:
cand = stack.pop()
for dest in move_out[cand[0]][cand[1]]:
cost[dest[0]][dest[1]] = max(cost[dest[0]][dest[1]],
cost[cand[0]][cand[1]] + 1)
in_list = move_in[dest[0]][dest[1]]
if in_list[0] == cand:
del in_list[0]
else:
del in_list[1]
if len(in_list) == 0:
count += 1
if len(move_out[dest[0]][dest[1]]) == 0:
ans = max(ans, cost[dest[0]][dest[1]])
else:
stack.append(dest)
if count == (N * (N-1) // 2):
print(ans)
else:
print((-1))
| from sys import stdin
# import numpy as np
from collections import deque
# import sys
# sys.setrecursionlimit(10**4)
def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list([int(x)-1 for x in stdin.readline().split()])
def _lf(): return list(map(float, stdin.readline().split()))
def _ls(): return stdin.readline().split()
def _i(): return int(stdin.readline())
def _f(): return float(stdin.readline())
def _s(): return stdin.readline()[:-1]
N = _i()
move_in = [[[] for i in range(N)] for j in range(N)]
move_out = [[[] for i in range(N)] for j in range(N)]
cost = [[0] * N for _ in range(N)]
start_pair = []
for i in range(N):
a_list = _li_()
start_pair.append(a_list[0])
for j in range(N-2):
start = [min(i, a_list[j]), max(i, a_list[j])]
end = [min(i, a_list[j+1]), max(i, a_list[j+1])]
move_in[end[0]][end[1]].append((start[0], start[1]))
move_out[start[0]][start[1]].append((end[0], end[1]))
count = 0
stack = deque([])
for i in range(N):
pair = start_pair[i]
if i < pair and i == start_pair[pair]:
stack.append((i, start_pair[i]))
cost[i][start_pair[i]] = 1
count += 1
ans = 0
while stack:
cand = stack.pop()
for dest in move_out[cand[0]][cand[1]]:
cost[dest[0]][dest[1]] = max(cost[dest[0]][dest[1]],
cost[cand[0]][cand[1]] + 1)
in_list = move_in[dest[0]][dest[1]]
if in_list[0] == cand:
del in_list[0]
else:
del in_list[1]
if len(in_list) == 0:
count += 1
if len(move_out[dest[0]][dest[1]]) == 0:
ans = max(ans, cost[dest[0]][dest[1]])
else:
stack.append(dest)
if count == (N * (N-1) // 2):
print(ans)
else:
print((-1))
| p02925 |
import sys
read = sys.stdin.buffer.read
def main():
N, *X = list(map(int, read().split()))
A = [0] * N
for i in range(N):
A[i] = X[(N - 1) * i : (N - 1) * (i + 1)]
M = N * (N - 1) // 2
total_mathces = 0
for day in range(M):
matches = 0
played = [False] * N
for i in range(N - 1):
if played[i] or not A[i]:
continue
j = A[i][-1] - 1
if not played[j] and i + 1 == A[j][-1]:
played[i] = played[j] = True
A[i].pop()
A[j].pop()
matches += 1
if matches == 0:
ans = -1
break
total_mathces += matches
if total_mathces == M:
ans = day + 1
break
print(ans)
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
A = [0] * N
for i in range(N):
A[i] = [int(s) - 1 for s in readline().split()]
M = N * (N - 1) // 2
total_mathces = 0
changed = set(range(N))
for day in range(M):
matches = 0
changed_prev, changed = changed, set()
for i in changed_prev:
if i in changed or not A[i]:
continue
j = A[i][-1]
if j not in changed and i == A[j][-1]:
changed.add(i)
changed.add(j)
A[i].pop()
A[j].pop()
matches += 1
if matches == 0:
ans = -1
break
total_mathces += matches
if total_mathces == M:
ans = day + 1
break
print(ans)
return
if __name__ == '__main__':
main()
| p02925 |
from collections import deque
n=int(eval(input()))
al=[deque(list(map(int,input().split()))) for _ in range(n)]
m=n*(n-1)//2
tn=[n-1]*n
for i in range(m+1):
flg=True
s=0
ts=set()
for j in range(n):
if tn[j]>0 and j not in ts:
t=al[j][0]-1
if t not in ts:
if al[t][0]==j+1:
al[t].popleft()
tn[t]-=1
ts.add(t)
al[j].popleft()
tn[j]-=1
flg=False
ts.add(j)
s+=tn[j]
if s==0:
print((i+1))
exit()
if flg:
print((-1))
exit() | import time
n=int(eval(input()))
al=[list(map(int,input().split())) for _ in range(n)]
m=n*(n-1)//2
tn=[n-1]*n
start=time.time()
for i in range(m+1):
flg=True
s=0
ts=set()
for j in range(n):
if tn[j]>0 and j not in ts:
t=al[j][0]-1
if t not in ts:
if al[t][0]==j+1:
al[t].pop(0)
tn[t]-=1
ts.add(t)
al[j].pop(0)
tn[j]-=1
flg=False
ts.add(j)
s+=tn[j]
if s==0:
print((i+1))
exit()
if flg:
print((-1))
exit()
now=time.time()
if (now-start)>1.8:
print(m)
exit() | p02925 |
import time
n=int(eval(input()))
al=[list(map(int,input().split())) for _ in range(n)]
m=n*(n-1)//2
tn=[n-1]*n
start=time.time()
for i in range(m+1):
flg=True
s=0
ts=set()
for j in range(n):
if tn[j]>0 and j not in ts:
t=al[j][0]-1
if t not in ts:
if al[t][0]==j+1:
al[t].pop(0)
tn[t]-=1
ts.add(t)
al[j].pop(0)
tn[j]-=1
flg=False
ts.add(j)
s+=tn[j]
if s==0:
print((i+1))
exit()
if flg:
print((-1))
exit()
now=time.time()
if (now-start)>1.8:
print(m)
exit() | import time
n=int(eval(input()))
al=[list(map(int,input().split())) for _ in range(n)]
m=n*(n-1)//2
tn=[n-1]*n
start=time.time()
for i in range(m+1):
flg=True
s=0
ts=set()
for j in range(n):
if tn[j]>0 and j not in ts:
t=al[j][0]-1
if t not in ts:
if al[t][0]==j+1:
al[t].pop(0)
tn[t]-=1
ts.add(t)
al[j].pop(0)
tn[j]-=1
flg=False
ts.add(j)
s+=tn[j]
if s==0:
print((i+1))
exit()
if flg:
print((-1))
exit()
now=time.time()
if (now-start)>1.6:
print(m)
exit() | p02925 |
import pprint
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
day = 0
while True:
end = 1
game = list()
for i in range(n):
if a[i] != []:
end = 0
if a[a[i][0]-1] != []:
if a[a[i][0]-1][0]-1 == i:
game.append(i)
if end == 0:
if game == []:
print((-1))
exit()
else:
for i in game:
a[i].pop(0)
else:
print(day)
exit()
day += 1 | import pprint
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
day = 0
check = set(range(n))
while True:
end = 1
game = set()
for i in check:
if a[i] != []:
end = 0
if a[a[i][0]-1] != []:
if a[a[i][0]-1][0]-1 == i:
game.add(i)
game.add(a[i][0]-1)
if end == 0:
if game == set():
print((-1))
exit()
else:
for i in game:
a[i].pop(0)
else:
print(day)
exit()
day += 1
check = game | p02925 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [list(map(int, input().split()))[::-1] for _ in range(N)]
ans = 0
match = N*(N-1)//2
player = set(range(N))
seen = [False]*N
while True:
update = False
checked = seen[::]
ans += 1
for x in player:
if checked[x] or not A[x]:
continue
y = A[x][-1] - 1
if A[y][-1]-1 == x and not checked[y]:
A[x].pop()
A[y].pop()
checked[x] = True
checked[y] = True
update = True
match -= 1
if match <= 0:
break
if not update:
ans = -1
break
print(ans)
| import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
pair = N * (N - 1) // 2
ptoi = dict()
i = 0
for x in range(1, N):
for y in range(x + 1, N + 1):
ptoi[(x, y)] = i
ptoi[(y, x)] = i
i += 1
edge = [[] for _ in range(pair)]
indeg = [0] * pair
for i in range(1, N+1):
inp = list(map(int, input().split()))
for s, t in zip(inp[:-1], inp[1:]):
edge[ptoi[(i, s)]].append(ptoi[(i, t)])
indeg[ptoi[(i, t)]] += 1
now = [i for i, d in enumerate(indeg) if d == 0]
day = 0
while now:
nxt = []
while now:
s = now.pop()
for t in edge[s]:
if indeg[t] <= 0:
continue
indeg[t] -= 1
if indeg[t] == 0:
nxt.append(t)
day += 1
now = nxt
if all(i <= 0 for i in indeg):
print(day)
else:
print((-1)) | p02925 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
if P[-1] == N:
tmp = P[-1]
P[-1] = P[-2]
P[-2] = tmp
ans += 1
for i in range(N-1):
if P[i] == i+1:
tmp = P[i]
P[i] = P[i+1]
P[i+1] = tmp
ans += 1
for i in range(N):
if P[i] == i+1:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
i = 0
while i < N:
if P[i] == i + 1:
ans += 1
i += 1
i += 1
print(ans)
| p03612 |
# ARC082D - Derangement
def main():
N = int(eval(input()))
P = tuple(map(int, input().split()))
A = [1 if i == j else 0 for i, j in enumerate(P, 1)]
ans, cur = 0, 0
for i in A:
if i:
cur += 1
else:
ans += (cur + 1) // 2
cur = 0
ans += (cur + 1) // 2
print(ans)
if __name__ == "__main__":
main() | # ARC082D - Derangement (ABC072D)
def main():
N = int(eval(input()))
P = tuple(map(int, input().split()))
ans, cur = 0, 0
for i, j in enumerate(P, 1):
if i == j: # subsequence which needs to replace
cur += 1
elif i != j and cur:
ans += (cur + 1) // 2
cur = 0
ans += (cur + 1) // 2
print(ans)
if __name__ == "__main__":
main() | p03612 |
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
P = [0] + list(map(int, input().split()))
same = deque()
for i in range(1, N + 1):
if i == P[i]: same.append(i)
if not same:
print((0))
return
ans = 0
x = same.popleft()
if not same:
print((1))
return
while same:
if same[0] - x == 1:
same.popleft()
ans += 1
if same:
x = same.popleft()
if not same:
ans += 1
break
else:
ans += 1
x = same.popleft()
if not same:
ans += 1
break
print(ans)
if __name__ == "__main__":
main()
| import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
P = [0] + list(map(int, input().split()))
ans = 0
for i in range(1, N):
if i == P[i]:
P[i + 1] = P[i]
ans += 1
if N == P[N]: ans += 1
print(ans)
if __name__ == "__main__":
main()
| p03612 |
n = int(eval(input()))
a = list(map(int,input().split()))
res = 0
i = 1
while i < n+1:
if a[i-1] == i:
res += 1
i+=2
else:
i+=1
print(res) | n = int(eval(input()))
p = list(map(int,input().split()))
i = 1
res = 0
while i < n+1:
if p[i-1] == i:
res += 1
i += 1
i += 1
print(res) | p03612 |
n = int(eval(input()))
p = list([int(x)-1 for x in input().split()])
ans = 0
for i in range(n-1):
if p[i]==i:
p[i],p[i+1] = p[i+1],p[i]
ans += 1
if p[-1]==n-1:ans+=1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(n):
if p[i]-1==i:
if i<n-1:p[i],p[i+1] = p[i+1],p[i]
ans += 1
print(ans) | p03612 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: list(map(int, INPUT().split()))
S_MAP = lambda: list(map(str, INPUT().split()))
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
def main():
N = INT()
P = LIST()
P.append(-1)
cnt = 0
i = 0
while i < N:
if P[i] == i + 1:
cnt += 1
i += (P[i+1] == i + 2)
i += 1
print(cnt)
if __name__ == '__main__':
main()
| import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: list(map(int, INPUT().split()))
S_MAP = lambda: list(map(str, INPUT().split()))
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
def main():
N = INT()
P = LIST()
P.append(-1)
cnt = 0
for i in range(N):
if P[i] == i + 1:
cnt += 1
P[i+1] = P[i]
print(cnt)
if __name__ == '__main__':
main()
| p03612 |
n=int(eval(input()))
arr=list(map(int,input().split()))
ans=0
for i in range(n-2):
if arr[i]==i+1:
arr[i],arr[i+1]=arr[i+1],arr[i]
ans+=1
elif arr[i+1]==i+1:
arr[i+1],arr[i+2]=arr[i+2],arr[i+1]
if arr[-1]==n or arr[-2]==n-1:
ans+=1
print(ans)
| n=int(eval(input()))
arr=list(map(int,input().split()))
ans=0
for i in range(n-1,-1,-1):
if arr[i]==i+1:
arr[i],arr[i-1]=arr[i-1],arr[i]
ans+=1
print(ans) | p03612 |
N = int(eval(input()))
p = list(map(int,input().split()))
import queue
from math import ceil
que = queue.Queue()
ans = 0
for i in range(N):
if p[i]==i+1:
que.put(i)
else:
ans+=ceil(que.qsize()/2)
que = queue.Queue()
ans+=ceil(que.qsize()/2)
print(ans) | N = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
i = 0
while i < N:
if p[i] == i+1:
ans += 1
if i+1 < N and p[i+1]==i+2:
i += 1
i += 1
print(ans) | p03612 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
increased = False
for i in range(n):
if increased:
increased = False
continue
if p[i] == i+1:
cnt += 1
i += 1
increased = True
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
increased = False
for i in range(n):
if increased:
increased = False
elif p[i] == i+1:
cnt += 1
increased = True
print(cnt)
| p03612 |
n = int(eval(input()))
l = list(map(int, input().split()))
l = [x-1 for x in l]
ans = 0
for i in range(n):
if l[i] == i:
ans += 1
if i != n-1:
l[i+1] = l[i]
print(ans)
| n = int(eval(input()))
P = list(map(int, input().split()))
P = [p-1 for p in P]
ans = 0
for i in range(n):
if P[i] == i:
if i != n-1:
ans += 1
P[i+1] = P[i]
else:
ans += 1
print(ans)
| p03612 |
n = int(eval(input()))
P = list(map(int, input().split()))
P = [p-1 for p in P]
ans = 0
for i in range(n):
if P[i] == i:
if i != n-1:
ans += 1
P[i+1] = P[i]
else:
ans += 1
print(ans)
| n = int(eval(input()))
P = list(map(int, input().split()))
P = [p-1 for p in P]
ans = 0
for i in range(n):
if i != n-1:
if P[i] == i:
ans += 1
P[i+1] = P[i]
else:
if P[i] == i:
ans += 1
print(ans) | p03612 |
N=int(eval(input()))
alist=[0]+list(map(int,input().split()))
answer=0
if alist[N]==N:
alist[N-1],alist[N]=alist[N],alist[N-1]
answer+=1
for i in range(1,N+1):
if alist[i]==i:
alist[i],alist[i+1]=alist[i+1],alist[i]
answer+=1
print(answer) | N=int(eval(input()))
alist=[0]+list(map(int,input().split()))
answer=0
for i in range(1,N):
if alist[i]==i:
alist[i],alist[i+1]=alist[i+1],alist[i]
answer+=1
if alist[N]==N:
print((answer+1))
else:
print(answer) | p03612 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n):
a[i]-=1
ans=0
for i in range(n-1):
if a[i]==i and a[i+1]==i+1:
ans+=1
a[i],a[i+1]=i+1,i
if a[i]==i:
ans+=1
if a[-1]==n-1:
ans+=1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
if a[i]==i+1:
a[i],a[i+1]=a[i+1],a[i]
ans+=1
if a[-1]==n:
ans+=1
print(ans) | p03612 |
N = int(eval(input()))
p = [int(x) for x in input().split()]
ans = 0
for i in range(N):
if i < N - 1 and p[i] == i + 1:
p[i] = p[i+1]
p[i+1] = i+1
ans += 1
elif i == N -1 and p[i] == i+1:
p[i] = p[i-1]
p[i-1] = i + 1
ans += 1
print(ans) | N = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(N):
if p[i]-1 == i:
if i + 1 <= N-1:
p[i] = p[i+1]
p[i+1] = i + 1
ans += 1
elif i - 1 >= 0:
p[i] = p[i-1]
p[i-1] = i + 1
ans += 1
print(ans) | p03612 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
i = 0
ans = 0
while i < n:
if i < n - 1:
if p[i] == i + 1:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
i += 1
print(ans)
| n = int(eval(input()))
p = [int(i) for i in input().split()]
ans = 0
for i in range(n):
if i < n - 1:
if p[i] == i + 1:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
print(ans)
| p03612 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
while True:
for i in range(N-1):
if i + 1 == P[i]:
P[i], P[i+1] = P[i+1], P[i]
count += 1
flag = True
for i in range(1, N+1):
if i == P[i-1]:
flag = False
break
if flag:
break
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(N-1):
if i + 1 == P[i]:
P[i], P[i+1] = P[i+1], P[i]
count += 1
if N == P[N-1]:
count += 1
print(count) | p03612 |
N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
if p[0] == 1:
tmp = p[1]
p[1] = p[0]
p[0] = tmp
cnt += 1
for i in range(N - 1, -1, -1):
if i + 1 == p[i]:
tmp = p[i]
p[i] = p[i - 1]
p[i - 1] = tmp
cnt += 1
print(cnt) | N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
#if p[0] == 1:
# tmp = p[1]
# p[1] = p[0]
# p[0] = tmp
# cnt += 1
for i in range(N - 1, -1, -1):
if i + 1 == p[i]:
tmp = p[i]
p[i] = p[i - 1]
p[i - 1] = tmp
cnt += 1
print(cnt) | p03612 |
#!/usr/bin/env python3
import sys
def solve(N: int, p: "List[int]"):
ans = 0
for i in range(N-1):
if(i+1 == p[i]):
p[i],p[i+1] = p[i+1],p[i]
ans += 1
for i in range(N-1,-1,-1):
if(i+1 == p[i]):
p[i],p[i-1] = p[i-1],p[i]
ans += 1
print(ans)
return
# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
p = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, p)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, p: "List[int]"):
ans = 0
for i in range(N-1):
if(i+1 == p[i]):
p[i],p[i+1] = p[i+1],p[i]
ans += 1
if(N == p[N-1]):
ans += 1
print(ans)
# for i in range(N-1):
# if(i+1 == p[i]):
# p[i],p[i+1] = p[i+1],p[i]
# ans += 1
# for i in range(N-1,-1,-1):
# if(i+1 == p[i]):
# p[i],p[i-1] = p[i-1],p[i]
# ans += 1
# print(ans)
return
# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
p = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, p)
if __name__ == '__main__':
main()
| p03612 |
N = int(eval(input()))
P = list([int(a) - 1 for a in input().split()])
ans = 0
for i in range(N):
p = P[i]
if p == i:
if i < N - 1:
P[i], P[i + 1] = P[i + 1], P[i]
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
if P[i] == i + 1:
if i + 1 < N:
P[i], P[i + 1] = P[i + 1], P[i]
ans += 1
print(ans)
| p03612 |
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
tmp = [-1,-1]
for i in range(n):
if p[i] == i+1:
if i+1 == tmp[0]+1 and p[i]==tmp[1]+1:
cnt+=0
tmp = [-1, -1]
else:
cnt+=1
tmp = [i+1,p[i]]
# print(p[i],tmp,cnt)
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
tmp = -1
for i in range(n):
if p[i] == i+1:
if i+1 == tmp+1:
cnt+=0
tmp = -1
else:
cnt+=1
tmp = i+1
print(cnt) | p03612 |
N = int(eval(input()))
p = tuple(map(int, input().split()))
a = list(p)
b = list(p)
c = 0
for i in range(N):
if i+1 == a[i] and i == N-1:
c += 1
elif i+1 == a[i]:
a[i], a[i+1] = a[i+1], a[i]
c += 1
cc = 0
for i in range(N)[::-1]:
if i+1 == b[i] and i == 0:
cc += 1
if i+1 == b[i]:
b[i], b[i-1] = b[i-1], b[i]
cc += 1
print((min(c,cc))) | N = int(eval(input()))
p = tuple(map(int, input().split()))
a = list(p)
b = list(p)
c = 0
for i in range(N):
if i+1 == a[i] and i == N-1:
c += 1
elif i+1 == a[i]:
a[i], a[i+1] = a[i+1], a[i]
c += 1
cc = 0
for i in range(N)[::-1]:
if i+1 == b[i] and i == 0:
cc += 1
elif i+1 == b[i]:
b[i], b[i-1] = b[i-1], b[i]
cc += 1
print((min(c,cc))) | p03612 |
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10
def main():
N = int(eval(input()))
p_list = list(map(int, input().split()))
a_list = list(range(1, N + 1))
ans = 0
i = 0
while i < N:
if i + 1 < N and p_list[i] == a_list[i] and p_list[i + 1] == a_list[i + 1]:
ans += 1
i += 2
elif p_list[i] == a_list[i]:
ans += 1
i += 2
else:
i += 1
print(ans)
if __name__ == '__main__':
main()
| from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10
def main():
N = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 0
i = 0
while i < N:
if p_list[i] == i + 1:
ans += 1
i += 2
else:
i += 1
print(ans)
if __name__ == '__main__':
main()
| p03612 |
n = int(eval(input()))
p = list(map(int, input().split()))
temp = []
for i in range(n):
# print(i, p[i])
if p[i] == i+1:
temp.append('y')
continue
# if p[i] == i+1:
# if p[i-1] == i:
# del temp[-1]
# temp.append('x')
# else:
# temp.append('y')
# continue
temp.append(p[i])
idx = 1
while True:
if idx > len(temp) - 1:
break
if temp[idx] == 'y' and temp[idx-1] == 'y':
temp[idx-1] = 'x'
del temp[idx]
# del temp[idx-1]
# temp.append('x')
idx += 1
#print(temp)
ans = temp.count('x') + temp.count('y')
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
temp = []
for i in range(n):
# print(i, p[i])
if p[i] == i+1:
temp.append('y')
continue
temp.append(p[i])
a = []
idx = 1
while True:
if idx > len(temp) - 1:
break
if temp[idx] == 'y' and temp[idx-1] == 'y':
temp[idx-1] = 'x'
temp[idx] = 'x'
#del temp[idx]
# del temp[idx-1]
# temp.append('x')
idx += 1
#print(a)
ans = temp.count('x')//2 + temp.count('y')
print(ans)
'''
9
1 2 4 9 5 8 7 3 6
'''
| p03612 |
import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
P = [int(p) for p in input().split()]
count = 0
now = 0
while now < N:
if P[now] == now + 1:
count += 1
if now < N - 1:
if P[now + 1] == now + 2: now += 1
now += 1
print(count)
return 0
if __name__ == "__main__":
solve() | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
P = [int(p) for p in input().split()]
swap = 0
for i in range(N):
if P[i] == i + 1:
if i < N - 1: P[i], P[i+1] = P[i+1], P[i]
swap += 1
print(swap)
return 0
if __name__ == "__main__":
solve() | p03612 |
# ABC 072 D
N = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
r = [0 for k in range(N)]
for k in range(N):
if p[k] == k+1:
r[k] = 1
for k in range(1,N):
if r[k] > 0:
r[k] += r[k-1]
r = r + [0]
for k in range(1,N+1):
if r[k] == 0:
ans += (r[k-1]+1)//2
print(ans)
| N = int(eval(input()))
p = list(map(int,input().split()))
l = [0 for k in range(N+2)]
for k in range(N):
if p[k] == k+1:
l[k+1] = 1
t = 0
ans = 0
for e in l:
if e == 1:
t += 1
else:
ans += (t+1)//2
t = 0
print(ans)
| p03612 |
N=int(eval(input()))
P=list(map(int,input().split()))
S=[]
for x,y in zip(P, list(range(1,N+1))):
if x==y: S.append(y)
S.append('$')
L=len(S)
lake=[]
lake.append(S[0])
i=1
a=0
while i<L:
if S[i]=='$':
a+=1
elif lake[0]+1!=S[i]:
a+=1
lake=[]
lake.append(S[i])
else:
lake.append(S[i])
i+=1
print(a) | N=int(eval(input()))
S=[]
for x,y in zip(list(map(int,input().split())), list(range(1,N+1))):
if x==y: S.append(y)
S.append('$')
L=len(S)
l=[S[0]]
i=1
a=0
while i<L:
if S[i]=='$':a+=1
elif l[0]+1!=S[i]:
a+=1
l=[S[i]]
else:l.append(S[i])
i+=1
print(a) | p03612 |
N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(N):
if P[i] == i+1:
if i != N - 1:
t = P[i]
P[i] = P[i+1]
P[i+1] = t
c += 1
else:
t = P[i]
P[i] = P[i-1]
P[i-1] = t
c += 1
print(c) | N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(N):
f = 1
if P[i] == i+1:
if i != N - 1:
if P[i+1] != i+1:
t = P[i]
P[i] = P[i+1]
P[i+1] = t
c += 1
else:
if P[i-1] != i+1:
t = P[i]
P[i] = P[i-1]
P[i-1] = t
c += 1
print(c)
| p03612 |
import itertools
def solve():
N = int(eval(input()))
p = list(map(int, input().split()))
chk = ""
for i in range(N):
if p[i] == i + 1:
chk += "1"
else:
chk += "0"
chk_splited = chk.split('0')
cnt = 0
for c in chk_splited:
if len(c) % 2 == 0:
cnt += len(c) / 2
else:
cnt += len(c) //2 + 1
print((int(cnt)))
if __name__ == '__main__':
solve()
| import itertools
def solve():
N = int(eval(input()))
p = list(map(int, input().split()))
one_cnt = 0
swap_cnt = 0
for i in range(N):
if p[i] == i + 1:
one_cnt += 1
else:
if one_cnt % 2 == 0:
swap_cnt += one_cnt / 2
else:
swap_cnt += one_cnt // 2 + 1
one_cnt = 0
else:
if one_cnt % 2 == 0:
swap_cnt += one_cnt / 2
else:
swap_cnt += one_cnt // 2 + 1
print((int(swap_cnt)))
if __name__ == '__main__':
solve()
| p03612 |
def check(n,p):
for i in range(n):
if (i+1) == p[i]:
return False
return True
def solve(n,p):
memo = {}
items = [(0,p)]
result = 0
while items:
step, p = items.pop(0)
if check(n,p):
result = step
break
else:
for i in range(n-1):
candidate = tuple( p[:i] +[ p[i+1] ,p[i]] + p[i+2:] )
if not candidate in memo:
items.append([step +1 , list(candidate)])
memo[candidate] = step + 1
return result
if __name__ == '__main__':
n = int(eval(input()))
p = list(map(int, input().split(" ")))
print((solve(n, p)))
| def solve(n, p):
result = 0
for i in range(n-1):
if (i+1) == p[i]:
p[i], p[i+1] = p[i+1],p[i]
result += 1
i = n - 1
if (i+1) == p[i]:
p[i-1], p[i] = p[i],p[i-1]
result += 1
return result
if __name__ == '__main__':
n = int(eval(input()))
p = list(map(int, input().split(" ")))
print((solve(n, p)))
| p03612 |
# sys.stdin.readline()
import sys
input = sys.stdin.readline
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if i+1 == p[i]:
if p[i]+1 == p[i+1]:
p[i+1] = p[i]
ans += 1
if p[n-1] == n:
ans += 1
print(ans) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, *p = list(map(int, read().split()))
p += [0]
cnt = 0
for i, pp in enumerate(p):
if (i + 1) == pp:
p[i + 1] = 0
cnt += 1
print(cnt)
| p03612 |
n = int(eval(input()))
cnt = 0
p = list(map(int,input().split()))
for i in range(n):
if p[i]==i+1:
if i==0:
p[i+1],p[i] = p[i],p[i+1]
cnt+=1
elif i==n-1:
cnt+=1
break
elif p[i]==i+2:
p[i-1],p[i] = p[i],p[i-1]
cnt+=1
else:
p[i],p[i+1] = p[i+1],p[i]
cnt+=1
print(cnt) | def solve():
n = int(eval(input()))
l = list(map(int,input().split()))
res = 0
for i in range(n-1):
if l[i]==i+1:
l[i],l[i+1]=l[i+1],l[i]
res+=1
if l[n-1]==n:
res+=1
print(res)
if __name__=='__main__':
solve() | p03612 |
N = int(eval(input()))
P = list(map(int,input().split()))
ls = [""] * N
cnt = 0
for i in range(N):
if P[i] == i + 1:
ls[i] = "#"
else:
ls[i] = "."
if ls[-1] == "#":
if ls[-2] == "#":
ls[-1], ls[-2] = ".", "."
else:
ls[-1] = "."
cnt += 1
for j in range(N-1):
if ls[j] == "#":
if ls[j+1] == "#":
ls[j+1] = "."
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
if P[-1] == N:
ans += 1
P[-1] = -1
if P[-2] == N - 1:
P[-2] = -1
for i in range(N-1):
if P[i] == i + 1:
ans += 1
if P[i+1] == i + 2:
P[i+1] = -1
print(ans) | p03612 |
N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
i = 0
while i < N:
if i + 1 == p[i]:
c = 1
for j in range(i + 1, N):
if j+1 != p[j]:
i = j
break
else:
c += 1
i = j
cnt += (c+1)//2
i += 1
print(cnt)
| N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
i = 0
while i < N:
if i + 1 == p[i]:
c = 1
j = i+1
while j < N:
if j+1 != p[j]:
i = j
break
else:
c += 1
j += 1
else:
i = j
cnt += (c+1)//2
i += 1
print(cnt)
| p03612 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
t = 'o' if P[0] == 1 else 'x'
j = 0 if t == 'o' else 1
L = []
for i, p in enumerate(P):
s = 'o' if p == (i + 1) else 'x'
if s == t:
cnt += 1
else:
L.append(cnt)
cnt = 1
t = s
L.append(cnt)
ans = 0
for i, n in enumerate(L):
if i % 2 == j:
ans += (n + 2 - 1) // 2
print(ans)
| N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
ans = 0
t = 'o' if P[0] == 1 else 'x'
for i, p in enumerate(P):
s = 'o' if p == (i + 1) else 'x'
if s == t:
cnt += 1
else:
if t == 'o':
ans += (cnt + 2 - 1) // 2
cnt = 1
t = s
else:
if t == 'o':
ans += (cnt + 2 - 1) // 2
print(ans)
| p03612 |
n=int(eval(input()))
p=[int(i) for i in input().split()]
cnt=0
for i in range(n-1):
if p[i]==i+1:
p[i],p[i+1]=p[i+1],p[i]
cnt+=1
if p[-1]==n:cnt+=1
print(cnt) | n,*p=list(map(int,open(0).read().split()))
i=c=0
while i<n:
if p[i]==i+1:
i+=1
c+=1
i+=1
print(c) | p03612 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for n in range(N-1):
if P[n]==n+1 and P[n+1]==n+2:
ans+=1
P[n+1] = n+1
elif P[n]==n+1 and P[n+1]!=n+2:
ans+=1
if P[-1]==N:
print((ans+1))
else:
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
c = 0
for n in range(N-1):
if P[n]==n+1:
P[n],P[n+1] = P[n+1],P[n]
c+=1
if P[-1]==N:
print((c+1))
else:
print(c) | p03612 |
n = int(eval(input()))
p = list(map(int, input().split()))
x = []
for i in range(n):
if p[i] - 1 == i:
x.append('x')
else:
x.append('o')
cnt = 0
for i in range(n-1):
if x[i] == "x" and x[i+1] == 'o':
cnt += 1
elif x[i] == "x" and x[i+1] == 'x':
cnt += 1
x[i+1] = 'o'
if x[n-1] == "x":
cnt += 1
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if p[i]-1 == i:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
if p[-1] == n:
ans+=1
print(ans) | p03612 |
from itertools import groupby
n = eval(input())
li = list(map(int, input().split()))
lii = [val == (itr + 1) for itr, val in enumerate(li)]
gbli = [[key, len(list(group))] for key, group in groupby(lii)]
ans = 0
for key, val in gbli:
if key:
ans += (val - 1) // 2 + 1
print(ans)
| from itertools import groupby
n = int(eval(input()))
P = list(map(int, input().split()))
T = [val == (itr + 1) for itr, val in enumerate(P)]
ans = 0
for k, v in groupby(T):
if k == True:
ans += (sum(v) - 1) // 2 + 1
print(ans) | p03612 |
n = int(eval(input()))
temp = list(map(int, input().split()))
l = [0]*n
ans = 0
for i in range(n):
if temp[i] == i+1:
l[i] = 0
else:
l[i] = 1
for i in range(n):
if l[i] == 0 and i == n-1:
ans += 1
if l[i] == 0 and not i == n-1:
l[i] = 1
l[i+1] = 1
ans += 1
print(ans) | n = int(eval(input()))
l = list(map(int, input().split()))
ans = 0
for i in range(n):
if l[i] == i + 1 and i == n-1:
ans += 1
if l[i] == i + 1 and not i == n-1:
l[i], l[i+1] = l[i+1], l[i]
ans += 1
print(ans) | p03612 |
N=int(eval(input()))
p=list(map(int,input().split()))
count=0
import collections
s=collections.deque()
for i in range(N):
if p[i]==i+1:
s.append(i)
ans=0
while(s):
x=s.popleft()
if x+1 in s:
s.popleft()
ans+=1
print(ans)
| N=int(eval(input()))
p=list(map(int,input().split()))
count=0
t=set()
for i in range(N):
if p[i]==i+1:
t.add(i)
ans=0
id=0
while(id<N):
if id in t:
if id+1 in t:
id+=1
ans+=1
id+=1
print(ans)
| p03612 |
n = int(eval(input()))
l = list(map(int,input().split()))
ans = 0
for i in range(n):
if i != n-1:
if i+1 == l[i]:
a = l[i]
b = l[i+1]
l[i]=b
l[i+1]=a
ans += 1
else:
if i+1 == l[i]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(n-1):
if i+1 == p[i]:
p[i+1] = p[i]
ans += 1
if p[n-1] == n:
ans += 1
print(ans) | p03612 |
from math import ceil
n=int(eval(input()))
p=list(map(int,input().split()))
m=[]
l=[0]*n
for i in range(n):
if p[i]==i+1:
l[i]=1
# print(l)
t=0
for i in range(n):
if i==n-1:
if l[i]==1:
t+=1
m.append(t)
break
if l[i]==1:
t+=1
if l[i+1]==1:
continue
m.append(t)
t=0
# print(m)
ans=0
for mm in m:
ans+=ceil(mm/2)
print(ans)
| n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
for i in range(n-1):
if p[i]==i+1:
ans+=1
x,y=p[i+1],p[i]
p[i+1],p[i]=y,x
if i==n-2:
if p[-1]==n:
ans+=1
print(ans)
| p03612 |
n = int(eval(input()))
p = [int(x) for x in input().split()]
cnt = 0
for i in range(n):
if p[i] == i + 1:
cnt += 1
if i != n - 1:
p[i], p[i+1] = p[i+1], p[i]
else:
print(cnt) | n = int(eval(input()))
p = [int(x) for x in input().split()]
skip = False
cnt = 0
for i in range(n):
if skip:
skip = False
elif p[i] == i + 1:
cnt += 1
skip = True
else:
print(cnt) | p03612 |
import copy
n=int(eval(input()))
f1=list(map(int,input().split()))
f2=copy.deepcopy(f1)
c=0
for i in range(n-1):
if f1[i]==i+1:
c+=1
f1[i],f1[i+1]=f1[i+1],f1[i]
for i in range(n-1,0,-1):
#print(d)
if f1[i]==i+1:
c+=1
f1[i],f1[i-1]=f1[i-1],f1[i]
print(c)
| n=int(eval(input()))
f=list(map(int,input().split()))
c=0
for i in range(n-1):
if f[i]==i+1:
c+=1
f[i],f[i+1]=f[i+1],f[i]
if f[n-1]==n:
f[n-2],f[n-1]=f[n-1],f[n-2]
c+=1
print(c) | p03612 |
n = int(eval(input()))
p = list(map(int, input().split())) + [0]
cnt = 0
j = False
for i in range(n):
if p[i] == i + 1:
cnt += 1
if p[i + 1] == i + 2:
if j == False:
cnt -= 1
j = True
else:
j = False
else:
j = False
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split())) + [0]
cnt = 0
i = 0
while i < n:
if p[i] == i + 1:
cnt += 1
i += 1
i += 1
print(cnt) | p03612 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
K = I()
A = [i for i in range(1,100)] # Snuke数の候補
for i in range(13):
for j in range(100,1000):
A.append(j*10**i+10**i-1)
A.sort(reverse=True)
B = []
m = 10**18
for a in A:
x = a/sum(int(i) for i in list(str(a)))
if x <= m:
B.append(a)
m = x
B.reverse()
print(*B[:K],sep='\n')
| import sys
K = int(sys.stdin.readline().rstrip())
ANS = [1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1099, 1199, 1299, 1399, 1499, 1599, 1699, 1799, 1899, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 10999, 11999, 12999, 13999, 14999, 15999, 16999, 17999, 18999, 19999, 20999, 21999, 22999, 23999, 24999, 25999, 26999, 27999, 28999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 109999, 119999, 129999, 139999, 149999, 159999, 169999, 179999, 189999, 199999, 209999, 219999, 229999, 239999, 249999, 259999, 269999, 279999, 289999, 299999, 309999, 319999, 329999, 339999, 349999, 359999, 369999, 379999, 389999, 399999, 499999, 599999, 699999, 799999, 899999, 999999, 1099999, 1199999, 1299999, 1399999, 1499999, 1599999, 1699999, 1799999, 1899999, 1999999, 2099999, 2199999, 2299999, 2399999, 2499999, 2599999, 2699999, 2799999, 2899999, 2999999, 3099999, 3199999, 3299999, 3399999, 3499999, 3599999, 3699999, 3799999, 3899999, 3999999, 4099999, 4199999, 4299999, 4399999, 4499999, 4599999, 4699999, 4799999, 4899999, 4999999, 5999999, 6999999, 7999999, 8999999, 9999999, 10999999, 11999999, 12999999, 13999999, 14999999, 15999999, 16999999, 17999999, 18999999, 19999999, 20999999, 21999999, 22999999, 23999999, 24999999, 25999999, 26999999, 27999999, 28999999, 29999999, 30999999, 31999999, 32999999, 33999999, 34999999, 35999999, 36999999, 37999999, 38999999, 39999999, 40999999, 41999999, 42999999, 43999999, 44999999, 45999999, 46999999, 47999999, 48999999, 49999999, 50999999, 51999999, 52999999, 53999999, 54999999, 55999999, 56999999, 57999999, 58999999, 59999999, 69999999, 79999999, 89999999, 99999999, 109999999, 119999999, 129999999, 139999999, 149999999, 159999999, 169999999, 179999999, 189999999, 199999999, 209999999, 219999999, 229999999, 239999999, 249999999, 259999999, 269999999, 279999999, 289999999, 299999999, 309999999, 319999999, 329999999, 339999999, 349999999, 359999999, 369999999, 379999999, 389999999, 399999999, 409999999, 419999999, 429999999, 439999999, 449999999, 459999999, 469999999, 479999999, 489999999, 499999999, 509999999, 519999999, 529999999, 539999999, 549999999, 559999999, 569999999, 579999999, 589999999, 599999999, 609999999, 619999999, 629999999, 639999999, 649999999, 659999999, 669999999, 679999999, 689999999, 699999999, 799999999, 899999999, 999999999, 1099999999, 1199999999, 1299999999, 1399999999, 1499999999, 1599999999, 1699999999, 1799999999, 1899999999, 1999999999, 2099999999, 2199999999, 2299999999, 2399999999, 2499999999, 2599999999, 2699999999, 2799999999, 2899999999, 2999999999, 3099999999, 3199999999, 3299999999, 3399999999, 3499999999, 3599999999, 3699999999, 3799999999, 3899999999, 3999999999, 4099999999, 4199999999, 4299999999, 4399999999, 4499999999, 4599999999, 4699999999, 4799999999, 4899999999, 4999999999, 5099999999, 5199999999, 5299999999, 5399999999, 5499999999, 5599999999, 5699999999, 5799999999, 5899999999, 5999999999, 6099999999, 6199999999, 6299999999, 6399999999, 6499999999, 6599999999, 6699999999, 6799999999, 6899999999, 6999999999, 7099999999, 7199999999, 7299999999, 7399999999, 7499999999, 7599999999, 7699999999, 7799999999, 7899999999, 7999999999, 8999999999, 9999999999, 10999999999, 11999999999, 12999999999, 13999999999, 14999999999, 15999999999, 16999999999, 17999999999, 18999999999, 19999999999, 20999999999, 21999999999, 22999999999, 23999999999, 24999999999, 25999999999, 26999999999, 27999999999, 28999999999, 29999999999, 30999999999, 31999999999, 32999999999, 33999999999, 34999999999, 35999999999, 36999999999, 37999999999, 38999999999, 39999999999, 40999999999, 41999999999, 42999999999, 43999999999, 44999999999, 45999999999, 46999999999, 47999999999, 48999999999, 49999999999, 50999999999, 51999999999, 52999999999, 53999999999, 54999999999, 55999999999, 56999999999, 57999999999, 58999999999, 59999999999, 60999999999, 61999999999, 62999999999, 63999999999, 64999999999, 65999999999, 66999999999, 67999999999, 68999999999, 69999999999, 70999999999, 71999999999, 72999999999, 73999999999, 74999999999, 75999999999, 76999999999, 77999999999, 78999999999, 79999999999, 80999999999, 81999999999, 82999999999, 83999999999, 84999999999, 85999999999, 86999999999, 87999999999, 88999999999, 89999999999, 99999999999, 109999999999, 119999999999, 129999999999, 139999999999, 149999999999, 159999999999, 169999999999, 179999999999, 189999999999, 199999999999, 209999999999, 219999999999, 229999999999, 239999999999, 249999999999, 259999999999, 269999999999, 279999999999, 289999999999, 299999999999, 309999999999, 319999999999, 329999999999, 339999999999, 349999999999, 359999999999, 369999999999, 379999999999, 389999999999, 399999999999, 409999999999, 419999999999, 429999999999, 439999999999, 449999999999, 459999999999, 469999999999, 479999999999, 489999999999, 499999999999, 509999999999, 519999999999, 529999999999, 539999999999, 549999999999, 559999999999, 569999999999, 579999999999, 589999999999, 599999999999, 609999999999, 619999999999, 629999999999, 639999999999, 649999999999, 659999999999, 669999999999, 679999999999, 689999999999, 699999999999, 709999999999, 719999999999, 729999999999, 739999999999, 749999999999, 759999999999, 769999999999, 779999999999, 789999999999, 799999999999, 809999999999, 819999999999, 829999999999, 839999999999, 849999999999, 859999999999, 869999999999, 879999999999, 889999999999, 899999999999, 909999999999, 919999999999, 929999999999, 939999999999, 949999999999, 959999999999, 969999999999, 979999999999, 989999999999, 999999999999, 1099999999999, 1199999999999, 1299999999999, 1399999999999, 1499999999999, 1599999999999, 1699999999999, 1799999999999, 1899999999999, 1999999999999, 2099999999999, 2199999999999, 2299999999999, 2399999999999, 2499999999999, 2599999999999, 2699999999999, 2799999999999, 2899999999999, 2999999999999, 3099999999999, 3199999999999, 3299999999999, 3399999999999, 3499999999999, 3599999999999, 3699999999999, 3799999999999, 3899999999999, 3999999999999, 4099999999999, 4199999999999, 4299999999999, 4399999999999, 4499999999999, 4599999999999, 4699999999999, 4799999999999, 4899999999999, 4999999999999, 5099999999999, 5199999999999, 5299999999999, 5399999999999, 5499999999999, 5599999999999, 5699999999999, 5799999999999, 5899999999999, 5999999999999, 6099999999999, 6199999999999, 6299999999999, 6399999999999, 6499999999999, 6599999999999, 6699999999999, 6799999999999, 6899999999999, 6999999999999, 7099999999999, 7199999999999, 7299999999999, 7399999999999, 7499999999999, 7599999999999, 7699999999999, 7799999999999, 7899999999999, 7999999999999, 8099999999999, 8199999999999, 8299999999999, 8399999999999, 8499999999999, 8599999999999, 8699999999999, 8799999999999, 8899999999999, 8999999999999, 9099999999999, 9199999999999, 9299999999999, 9399999999999, 9499999999999, 9599999999999, 9699999999999, 9799999999999, 9899999999999, 9999999999999, 10999999999999, 11999999999999, 12999999999999, 13999999999999, 14999999999999, 15999999999999, 16999999999999, 17999999999999, 18999999999999, 19999999999999, 20999999999999, 21999999999999, 22999999999999, 23999999999999, 24999999999999, 25999999999999, 26999999999999, 27999999999999, 28999999999999, 29999999999999, 30999999999999, 31999999999999, 32999999999999, 33999999999999, 34999999999999, 35999999999999, 36999999999999, 37999999999999, 38999999999999, 39999999999999, 40999999999999, 41999999999999, 42999999999999, 43999999999999, 44999999999999, 45999999999999, 46999999999999, 47999999999999, 48999999999999, 49999999999999, 50999999999999, 51999999999999, 52999999999999, 53999999999999, 54999999999999, 55999999999999, 56999999999999, 57999999999999, 58999999999999, 59999999999999, 60999999999999, 61999999999999, 62999999999999, 63999999999999, 64999999999999, 65999999999999, 66999999999999, 67999999999999, 68999999999999, 69999999999999, 70999999999999, 71999999999999, 72999999999999, 73999999999999, 74999999999999, 75999999999999, 76999999999999, 77999999999999, 78999999999999, 79999999999999, 80999999999999, 81999999999999, 82999999999999, 83999999999999, 84999999999999, 85999999999999, 86999999999999, 87999999999999, 88999999999999, 89999999999999, 90999999999999, 91999999999999, 92999999999999, 93999999999999, 94999999999999, 95999999999999, 96999999999999, 97999999999999, 98999999999999, 99999999999999, 100999999999999, 101999999999999, 102999999999999, 103999999999999, 104999999999999, 105999999999999, 106999999999999, 107999999999999, 108999999999999, 109999999999999, 119999999999999, 129999999999999, 139999999999999, 149999999999999, 159999999999999, 169999999999999, 179999999999999, 189999999999999, 199999999999999, 209999999999999, 219999999999999, 229999999999999, 239999999999999, 249999999999999, 259999999999999, 269999999999999, 279999999999999, 289999999999999, 299999999999999, 309999999999999, 319999999999999, 329999999999999, 339999999999999, 349999999999999, 359999999999999, 369999999999999, 379999999999999, 389999999999999, 399999999999999, 409999999999999, 419999999999999, 429999999999999, 439999999999999, 449999999999999, 459999999999999, 469999999999999, 479999999999999, 489999999999999, 499999999999999, 509999999999999, 519999999999999, 529999999999999, 539999999999999, 549999999999999, 559999999999999, 569999999999999, 579999999999999, 589999999999999, 599999999999999, 609999999999999, 619999999999999, 629999999999999, 639999999999999, 649999999999999, 659999999999999, 669999999999999, 679999999999999, 689999999999999, 699999999999999, 709999999999999, 719999999999999, 729999999999999, 739999999999999, 749999999999999, 759999999999999, 769999999999999, 779999999999999, 789999999999999, 799999999999999, 809999999999999, 819999999999999, 829999999999999, 839999999999999, 849999999999999, 859999999999999, 869999999999999, 879999999999999, 889999999999999, 899999999999999, 909999999999999, 919999999999999, 929999999999999, 939999999999999, 949999999999999, 959999999999999, 969999999999999, 979999999999999, 989999999999999, 999999999999999]
print(*ANS[:K],sep='\n')
| p03318 |
def f(n):
s=str(n)
return sum([int(s[i]) for i in range(len(s))])
sunuke=[]
for i in range(16):
for j in range(1,500):
sunuke.append(j*(10**i)-1)
sunuke=list(set(sunuke))
sunuke.sort()
sunuke.pop(0)
L=len(sunuke)
tmp1,tmp2=sunuke[L-1],f(sunuke[L-1])
ans=[sunuke[L-1]]
for i in range(len(sunuke)-2,-1,-1):
x=sunuke[i]
if x*tmp2<=tmp1*f(x):
ans.append(x)
tmp1,tmp2=x,f(x)
ans.sort()
for i in range(int(eval(input()))):
print((ans[i])) | def f(n):
s=str(n)
return sum([int(s[i]) for i in range(len(s))])
sunuke=[]
for i in range(16):
for j in range(1,200):
sunuke.append(j*(10**i)-1)
sunuke=list(set(sunuke))
sunuke.sort()
sunuke.pop(0)
L=len(sunuke)
tmp1,tmp2=sunuke[L-1],f(sunuke[L-1])
ans=[sunuke[L-1]]
for i in range(len(sunuke)-2,-1,-1):
x=sunuke[i]
if x*tmp2<=tmp1*f(x):
ans.append(x)
tmp1,tmp2=x,f(x)
ans.sort()
for i in range(int(eval(input()))):
print((ans[i])) | p03318 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
sys.setrecursionlimit(10000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
def S(n):
s = 0
while n != 0:
s += n % 10
n //= 10
return s
# @mt
def slv(K):
ans = [(i, i/S(i)) for i in range(1, 10)]
for i in range(16):
a = i
if a > 5:
a = 5
for j in range(1, 10**a):
b = (10**(i-a+1))*j + (10**(i-a+1)-1)
s = S(b)
while ans[-1][1] > b/s or ans[-1][0] == b:
ans.pop()
ans.append((b, b/s))
# print(ans[-1])
# error_print(len(ans))
# for r in ans:
# error_print(r)
error_print(len(ans))
return '\n'.join(map(str, map(lambda x: x[0], ans[:K])))
def main():
K = read_int()
print(slv(K))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
sys.setrecursionlimit(10000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
def S(n):
s = 0
while n != 0:
s += n % 10
n //= 10
return s
# @mt
def slv(K):
ans = [(i, i/S(i)) for i in range(1, 10)]
for i in range(16):
a = i
if a > 4:
a = 4
for j in range(1, 10**a):
b = (10**(i-a+1))*j + (10**(i-a+1)-1)
if b < 10**(i-1):
continue
s = S(b)
while ans[-1][1] > b/s or ans[-1][0] == b:
(ans.pop())
ans.append((b, b/s))
# print(ans[-1])
# error_print(len(ans))
# for r in ans:
# error_print(r)
error_print(len(ans))
return '\n'.join(map(str, map(lambda x: x[0], ans[:K])))
def main():
K = read_int()
print(slv(K))
if __name__ == '__main__':
main()
| p03318 |
import math
# import datetime
def s(n):
sum = 0
for c in str(n):
sum += int(c)
return sum
k = int(eval(input()))
found=0
def next_sunuke(n, s_n, s_n_div):
global found
if n == 1:
return
log_n = int(math.log(n,10))
m = n - 10 ** int(log_n // 1.25)
# m = n - 1
while m >= 1:
s_m = s(m)
s_mplus1 = s(m + 1)
# if (s_m < s_mplus1 or (s_n - s_m != 1 and s_n - s_m != -8)) and m > 9:
if (s_m < s_mplus1) and m > 9:
m -= 10 ** int(log_n // 1.25)
continue
# print("check: " + str(m))
s_m_div = m / s(m)
if s_m_div <= s_n_div:
next_sunuke(m, s_m, s_m_div)
if found >= k:
return
found += 1
# print("{0:d}".format(m), "{0:+d}".format(n-m), "{0:d}".format(s_m), s_m_div)
print(m)
break
# else:
# log_m = int(math.log(m,10))
# if (m + 1) / (10 ** (log_m - 1)) == 19:
# print ("skip: " + str(m) + " to " + str(10 ** log_m - 1))
# m = 10 ** log_m - 1
# s_mplus1 = s(m+1)
# continue
m -= 10 ** int(log_n // 1.25)
# 適当な大きいスヌケ数
current_sunuke = 999999999999999
s_current_sunuke = s(current_sunuke)
s_current_sunuke_div = current_sunuke / s_current_sunuke
# start = datetime.datetime.now()
next_sunuke(current_sunuke, s_current_sunuke, s_current_sunuke_div)
if found < k:
print(current_sunuke)
# end = datetime.datetime.now()
# print(str(end-start))
# sunukes=[]
# n = current_sunuke - 1
# while(n >= 1):
# s_n = n / s(n)
# if s_n <= current_sunuke_n:
# #sunukes.insert(0,n)
# sunukes.append(n)
# current_sunuke = n
# current_sunuke_n = s_n
# n -= 1
# for n in sunukes:
# print (n)
| import math
# import datetime
def s(n):
sum = 0
for c in str(n):
sum += int(c)
return sum
k = int(eval(input()))
found=0
def next_sunuke(n, s_n, s_n_div):
global found
if n == 1:
return
log_n = int(math.log(n,10))
m = n - 10 ** int(log_n // 1.25)
while m >= 1:
s_m = s(m)
s_mplus1 = s(m + 1)
if (s_m < s_mplus1 or (s_n - s_m != 1 and s_n - s_m != -8 and s_n - s_m != -17)) and m > 9:
m -= 10 ** int(log_n // 1.25)
continue
# print("check: " + str(m))
s_m_div = m / s(m)
if s_m_div <= s_n_div:
next_sunuke(m, s_m, s_m_div)
if found >= k:
return
found += 1
# print("{0:d}".format(m), "{0:+d}".format(n-m), "{0:d}".format(s_m), s_m_div)
print(m)
break
m -= 10 ** int(log_n // 1.25)
# 適当な大きいスヌケ数
current_sunuke = 999999999999999
s_current_sunuke = s(current_sunuke)
s_current_sunuke_div = current_sunuke / s_current_sunuke
# start = datetime.datetime.now()
next_sunuke(current_sunuke, s_current_sunuke, s_current_sunuke_div)
if found < k:
print(current_sunuke)
# end = datetime.datetime.now()
# print(str(end-start))
| p03318 |
def main():
s=set()
for digit in range(16):
for i in range(1,1000):
c=i*10**digit+int('9'*digit or 0)
if c<10**15:
s.add(c)
c=sorted(s)
for i,n in enumerate(c):
sn=n/sum(map(int,str(n)))
for m in c[i+1:i+50]:
sm=m/sum(map(int,str(m)))
if sm<sn:
s.remove(n)
break
print(*sorted(s)[:int(input())],sep='\n')
main()
| def main():
s=set()
for digit in range(16):
for i in range(1,1000):
c=i*10**digit+int('9'*digit or 0)
if c<10**15:
s.add(c)
c=sorted(s)
for i,n in enumerate(c):
sn=n/sum(map(int,str(n)))
for m in c[i+1:i+20]:
sm=m/sum(map(int,str(m)))
if sm<sn:
s.remove(n)
break
print(*sorted(s)[:int(input())],sep='\n')
main()
| p03318 |
#!/usr/bin/env python
# coding: utf-8
def ri():
return int(eval(input()))
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def calc(n):
s = sum(map(int, str(n)))
return n / s
def f(n):
ld = list(map(int, str(n)))
cand = []
for i in range(len(ld)-1):
d = len(ld)-1-i
ld[d] = 9
for i in range(1, 10):
if i < ld[d-1]:
continue
ld[d-1] = i
p = int("".join(map(str, ld)))
cand.append((calc(p), p))
cand.sort()
return cand[0][1]
MAX = 10**15
def main():
k = ri()
cand = list(range(1, 10))
n = 10
while True:
if n > MAX:
break
p = f(n)
cand.append(p)
n = p+1
print(("\n".join(map(str, cand[:k]))))
if __name__ == '__main__':
main()
| #!/usr/bin/env python
# coding: utf-8
def ri():
return int(eval(input()))
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def calc(n):
s = sum(map(int, str(n)))
return n / s
def main():
k = ri()
cand = list(range(1, 10))
last = 9
for n in range(1, 15):
pow10n = pow(10, n)
for d in range(1, 10):
lim = (d+1)*pow10n
e = 0
while True:
e1 = d*pow10n+e*(last+1)+last
if e1 >= lim:
break
e2 = e1 + (last+1)
if calc(e1) > calc(e2):
last = last*10+9
e = 0
continue
cand.append(e1)
e += 1
cand = sorted(list(set(cand)))
print(("\n".join(map(str, cand[:k]))))
if __name__ == '__main__':
main()
"""
1 1.0
2 1.0
3 1.0
4 1.0
5 1.0
6 1.0
7 1.0
8 1.0
9 1.0
19 1.9
29 2.6363636363636362
39 3.25
49 3.769230769230769
59 4.214285714285714
69 4.6
79 4.9375
89 5.235294117647059
99 5.5
199 10.473684210526315
299 14.95
399 19.0
499 22.681818181818183
599 26.043478260869566
699 29.125
799 31.96
899 34.57692307692308
999 37.0
1099 57.8421052631579
1199 59.95
1299 61.857142857142854
1399 63.59090909090909
1499 65.17391304347827
1599 66.625
1699 67.96
1799 69.1923076923077
1899 70.33333333333333
1999 71.39285714285714
2999 103.41379310344827
3999 133.3
4999 161.25806451612902
5999 187.46875
6999 212.0909090909091
7999 235.26470588235293
8999 257.1142857142857
9999 277.75
10999 392.82142857142856
11999 413.7586206896552
12999 433.3
13999 451.5806451612903
14999 468.71875
15999 484.8181818181818
16999 499.97058823529414
17999 514.2571428571429
18999 527.75
19999 540.5135135135135
20999 724.1034482758621
21999 733.3
22999 741.9032258064516
23999 749.96875
24999 757.5454545454545
25999 764.6764705882352
26999 771.4
27999 777.75
28999 783.7567567567568
29999 789.4473684210526
39999 1025.6153846153845
49999 1249.975
59999 1463.3902439024391
69999 1666.642857142857
79999 1860.4418604651162
89999 2045.4318181818182
99999 2222.2
109999 2972.945945945946
119999 3157.8684210526317
129999 3333.3076923076924
139999 3499.975
149999 3658.512195121951
159999 3809.5
169999 3953.4651162790697
179999 4090.8863636363635
189999 4222.2
199999 4347.804347826087
209999 5526.289473684211
219999 5641.0
229999 5749.975
239999 5853.634146341464
249999 5952.357142857143
259999 6046.488372093023
269999 6136.340909090909
279999 6222.2
289999 6304.326086956522
299999 6382.95744680851
309999 7948.692307692308
319999 7999.975
329999 8048.756097560976
339999 8095.214285714285
349999 8139.511627906977
359999 8181.795454545455
369999 8222.2
379999 8260.847826086956
389999 8297.851063829787
399999 8333.3125
499999 10204.061224489797
599999 11999.98
699999 13725.470588235294
799999 15384.596153846154
899999 16981.11320754717
999999 18518.5
"""
| p03318 |
K = int(eval(input()))
def ns(n):
return sum([int(c) for c in str(n)])
ans, base = 0, 1
for _ in range(K):
ans += base
print(ans)
if (ans + base) / ns(ans + base) > (ans + 10 * base) / ns(ans + 10 * base):
base *= 10 | K = int(eval(input()))
def ns(n):
ret, tmp = 0, n
while tmp > 0:
tmp, r = divmod(tmp, 10)
ret += r
return ret
ans, base = 0, 1
for _ in range(K):
ans += base
print(ans)
if (ans + base) / ns(ans + base) > (ans + 10 * base) / ns(ans + 10 * base):
base *= 10 | p03318 |
K = int(eval(input()))
def ns(n):
ret, tmp = 0, n
while tmp > 0:
tmp, r = divmod(tmp, 10)
ret += r
return ret
ans, base = 0, 1
for _ in range(K):
ans += base
print(ans)
if (ans + base) / ns(ans + base) > (ans + 10 * base) / ns(ans + 10 * base):
base *= 10 | K = int(eval(input()))
def ns(n):
ret, tmp = 0, n
while tmp > 0:
# tmp, r = divmod(tmp, 10)
r = tmp % 10
tmp //= 10
ret += r
return ret
ans, base = 0, 1
for _ in range(K):
ans += base
print(ans)
if (ans + base) / ns(ans + base) > (ans + 10 * base) / ns(ans + 10 * base):
base *= 10 | p03318 |
from math import log, floor
from itertools import islice
k = int(eval(input()))
def s(n):
return n / sum(map(int, str(n)))
def f(n):
ds = list(range(int(log(n+1, 10))+2))
xs = [(10**(d+1))*floor(n/(10**(d+1)) + 1) - 1 for d in ds]
return min(xs, key=s)
def g():
for n in range(1, 10):
yield n
while True:
n = f(n+1)
yield n
for x in islice(g(), k):
print(x) | from math import log, floor
from itertools import accumulate, chain, islice, repeat
k = int(eval(input()))
def f(n):
ds = list(range(int(log(n+1, 10))+2))
xs = [(10**(d+1))*floor(n/(10**(d+1)) + 1) - 1 for d in ds]
return min(xs, key=lambda n:(n / sum(map(int, str(n))), n))
snukes = chain(list(range(1, 9)), accumulate(repeat(9), lambda x,_:f(x+1)))
for x in islice(snukes, k):
print(x) | p03318 |
def S(i):
ans = 0
while i // 10 > 0:
ans += i % 10
i //= 10
ans += i
return ans
K = int(eval(input()))
Ans, count, N = [], 0, 1
while count < K:
N2, Nd = N, 1
while N2//10 > 0:
Nd += 1
N2 //= 10
minX, X = N/S(N), N
for i in range(Nd+2):
x = (N//10**(i+1) + 1) * 10**(i+1) -1
if minX > x/S(x):
minX, X = x/S(x), x
Ans.append((minX, X))
count += 1
N = X+1
for i in range(K):
print((Ans[i][1])) | def S(i):
ans = 0
while i // 10 > 0:
ans += i % 10
i //= 10
ans += i
return ans
K = int(eval(input()))
count, N = 0, 1
while count < K:
N2, Nd = N, 1
while N2//10 > 0:
Nd += 1
N2 //= 10
minX, X = N/S(N), N
for i in range(Nd+2):
x = (N//10**(i+1) + 1) * 10**(i+1) -1
if minX > x/S(x):
minX, X = x/S(x), x
print(X)
count += 1
N = X+1 | p03318 |
K = int(eval(input()))
P = [n for n in range(1, 10)]
Q = [n for n in range(1, 10)]
for d in range(20):
if d < 8:
for m in range(10, 100):
P.append(int(str(m)+"9"*d))
Q.append(m//10+m%10+9*d)
else:
for m in range(100, 1000):
P.append(int(str(m)+"9"*(d-1)))
Q.append(sum([int(s) for s in str(m)])+9*(d-1))
L = len(P)
c = 0
for i, (p, q) in enumerate(zip(P, Q)):
ok = True
for j in range(i+1, L):
np, nq = P[j], Q[j]
if np*q < nq*p:
ok = False
break
if ok:
print(p)
c += 1
if c == K:
break
"""
import matplotlib.pyplot as plt
A = []
B = []
for n in range(-1+10**10, 10**15, 10**10):
m = sum([int(s) for s in str(n)])
A.append(n)
B.append(n/m)
plt.plot(A, B)
plt.show()
""" | K = int(eval(input()))
P = [n for n in range(1, 10)]
Q = [n for n in range(1, 10)]
for d in range(20):
if d < 12:
for m in range(10, 100):
P.append(int(str(m)+"9"*d))
Q.append(m//10+m%10+9*d)
else:
for m in range(100, 1000):
P.append(int(str(m)+"9"*(d-1)))
Q.append(sum([int(s) for s in str(m)])+9*(d-1))
L = len(P)
c = 0
for i, (p, q) in enumerate(zip(P, Q)):
ok = True
for j in range(i+1, L):
np, nq = P[j], Q[j]
if np*q < nq*p:
ok = False
break
if ok:
print(p)
c += 1
if c == K:
break
"""
import matplotlib.pyplot as plt
A = []
B = []
for n in range(-1+10**10, 10**14, 10**10):
m = sum([int(s) for s in str(n)])
A.append(n)
B.append(n/m)
plt.plot(A, B)
plt.show()
""" | p03318 |
k = int(eval(input()))
z=1
n=1
while z<=k:
a=1
l=len(str(n))
s = str(n)
x = list(map(int, list(s)))
while a<=l:
if x[0]==1 and l>3:
if l-a-1==0:
print(n)
a=a+100
z=z+1
elif n==19:
print((19))
a=a+100
z=z+1
elif x[l-a]==9:
a=a+1
else:
a=a+100
else:
if a-l==0:
print(n)
a=a+100
z=z+1
elif n==19:
print((19))
a=a+100
z=z+1
elif x[l-a]==9:
a=a+1
else:
a=a+100
n=n+1 | k = int(eval(input()))
n=0
a=1
b=0
if a==1 and n<9:
while n<9 and b<k:
n+=1
print(n)
b+=1
a+=1
if a==2:
while n<90 and b<k:
n+=10
print(n)
b+=1
a+=1
while b<k:
n+=10**(a-1)
print(n)
b+=1
if (n>((a-1)*10**a-10**(a-1)) and a<12) or (n>((a-2)*10**a-10**(a-1)) and a>=12):
a+=1 | p03318 |
k = eval(input())
K = int(k)
j = 1
count = 0
while True:
a = 0
j = str(j)
for i in range(len(j)):
a += int(j[i:i+1])
j = int(j)
if j/a < 2:
print(j)
count += 1
if count == K:
break
j += 1 | K = int(eval(input()))
a = 1
b = 0
def snk(n):
s = 0
for i in str(n):
s += int(i)
return(n/s)
count = 0
while True:
print(a)
count += 1
if snk(a + 10 ** b) > snk(a + 10 ** (b + 1)):
b += 1
a += 10 ** b
if count == K:
break | p03318 |
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=lambda x:int(math.floor(x)),lambda x:int(math.ceil(x))
from functools import reduce;gcd=lambda*x:reduce(math.gcd,x);lcm=lambda*x:reduce(lambda x,y:(x*y)//gcd(x,y),x,1)
from collections import deque
Yes=lambda b:print("Yes"if b else"No");YES=lambda b:print("YES"if b else"NO")
is_even=lambda x:True if x%2==0 else False
def main():
s=input()
t=input()
n=len(s)
flg=0
for i in range(n):
if s[i]!=t[i]:
flg=1
Yes(flg==0)
if __name__ == '__main__':
main()
| import sys;input=lambda:sys.stdin.readline().rstrip()
Yes=lambda b:print("Yes"if b else"No")
s,t=input(),input()
Yes(s==t[:-1])
| p02681 |
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import itertools
import math
import sys
INF = float('inf')
YES = "Yes" # type: str
NO = "No" # type: str
def solve(S: str, T: str):
return [NO, YES][len(S)+1 == len(T) and S == T[:-1]]
def main():
sys.setrecursionlimit(10 ** 6)
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = next(tokens) # type: str
T = next(tokens) # type: str
print((solve(S, T)))
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import itertools
import math
import sys
INF = float('inf')
YES = "Yes" # type: str
NO = "No" # type: str
def solve(S: str, T: str):
return [NO, YES][S == T[:-1]]
def main():
sys.setrecursionlimit(10 ** 6)
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = next(tokens) # type: str
T = next(tokens) # type: str
print((solve(S, T)))
if __name__ == '__main__':
main()
| p02681 |
import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
import string
def main():
s = input().rstrip()
t = input().rstrip()
for i in range(len(s)):
if s[i] != t[i]:
print("No")
exit()
if len(t) == len(s) +1:
print("Yes")
else:
print("No")
if __name__=="__main__":
main()
| import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
import string
def main():
s = input().rstrip()
t = input().rstrip()
t = t[0:-1]
if s == t:
print("Yes")
else:
print("No")
if __name__=="__main__":
main()
| p02681 |
n, a, b = list(map(int, input().split()))
s_t = set()
for i in range(n):
s_t.add(int(eval(input())))
print((len(s_t.difference(set(range(a, b))))))
| n, a, b = list(map(int, input().split()))
s_t = set()
for i in range(n):
s_t.add(int(eval(input())))
answer = 0
for s in s_t:
if a <= s < b:
pass
else:
answer += 1
print(answer)
| p03975 |
n, a ,b = list(map(int, input().split()))
c = 0
for i in range(n):
t = eval(input())
if not t in range(a,b):
c += 1
print(c) | n, a ,b = list(map(int, input().split()))
c = 0
for i in range(n):
t = eval(input())
if not a <= t < b:
c += 1
print(c) | p03975 |
# -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 2016-10-07
#
# Usage
#
"""
def read():
"""Read like as below.
N A B
t_1
t_n
"""
line_1 = input().split(" ")
num_of_class = int(line_1[0])
blocked_class = line_1[1:2]
blocked_class = list(range(int(line_1[1]), int(line_1[2])))
following_class = [int(eval(input())) for _ in range(num_of_class)]
return following_class, blocked_class
def check_available_class(following_class, blocked_class):
"""Check how many class you can attend.
>>> check_available_class([4,3,6,9,1], [5,6,7,8])
4
>>> check_available_class([5,6,7,8,9], [4,5,6,7,8])
1
"""
return len(set(following_class).difference(set(blocked_class)))
if __name__ == "__main__":
f, b = read()
print(check_available_class(f,b))
| # -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 2016-10-07
#
# Usage
#
"""
def read():
"""Read like as below.
N A B
t_1
t_n
"""
line_1 = input().split(" ")
num_of_class = int(line_1[0])
blocked_class = line_1[1:2]
blocked_class = list(range(int(line_1[1]), int(line_1[2])))
following_class = {int(eval(input())) for _ in range(num_of_class)}
return following_class, blocked_class
def check_available_class(following_class, blocked_class):
"""Check how many class you can attend.
>>> check_available_class([4,3,6,9,1], [5,6,7,8])
4
>>> check_available_class([5,6,7,8,9], [4,5,6,7,8])
1
"""
return len(set(following_class).difference(blocked_class))
if __name__ == "__main__":
f, b = read()
print((check_available_class(f,b)))
| p03975 |
import copy
n = int(eval(input()))
a = list(map(int,input().split()))
b = [0]
for i in range(len(a)):
b.append(b[i] + a[i])
del b[0]
c = copy.copy(b)
first_minus = 0
first_plus = 0
for i in range(len(b)):
if(i%2 == 0):
if (b[i] >= 0):
diff = abs(b[i]) + 1
first_minus = first_minus + diff
b = list([x - diff for x in b])
if (c[i] <= 0):
diff = abs(c[i]) + 1
first_plus = first_plus + diff
c = list([x + diff for x in c])
else:
if (b[i] <= 0):
diff = abs(b[i]) + 1
first_minus = first_minus + diff
b = list([x + diff for x in b])
if (c[i] >= 0):
diff = abs(c[i]) + 1
first_plus = first_plus + diff
c = list([x - diff for x in c])
print((min(first_minus,first_plus))) | import copy
n = int(eval(input()))
a = list(map(int,input().split()))
sum = 0
ans_a = 0
for i in range(len(a)):
sum += a[i]
if(i%2 == 0):
if(sum >= 0):
ans_a += sum + 1
sum = -1
else:
if(sum <= 0):
ans_a += 1 - sum
sum = 1
sum = 0
ans_b = 0
for i in range(len(a)):
sum += a[i]
if(i%2 == 0):
if(sum <= 0):
ans_b += 1 - sum
sum = 1
else:
if(sum >= 0):
ans_b += sum + 1
sum = -1
print((min(ans_a,ans_b))) | p03739 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
b.append(a[i])
ct1=0
if a[0]<=0:
a[0]=1
ct1+=1-a[0]
for i in range(1,n):
if i%2==1:
if sum(a[0:i+1])>=0:
ct1+=sum(a[0:i+1])+1
a[i]=-sum(a[0:i])-1
else:
if sum(a[0:i+1])<=0:
ct1+=1-sum(a[0:i+1])
a[i]=-sum(a[0:i])+1
ct2=0
if b[0]>=0:
b[0]=-1
ct2+=b[0]-1
for i in range(1,n):
if i%2==0:
if sum(b[0:i+1])>=0:
ct2+=sum(b[0:i+1])+1
b[i]=-sum(b[0:i])-1
else:
if sum(b[0:i+1])<=0:
ct2+=1-sum(b[0:i+1])
b[i]=-sum(b[0:i])+1
print((min(ct1,ct2))) | n=int(eval(input()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
b.append(a[i])
ct1=0
if a[0]<=0:
ct1+=1-a[0]
a[0]=1
x=a[0]
for i in range(1,n):
y=x+a[i]
if i%2==1:
if y>=0:
ct1+=y+1
a[i]=-x-1
else:
if y<=0:
ct1+=1-y
a[i]=-x+1
x+=a[i]
ct2=0
if b[0]>=0:
ct2+=b[0]+1
b[0]=-1
x=b[0]
for i in range(1,n):
y=x+b[i]
if i%2==0:
if y>=0:
ct2+=y+1
b[i]=-x-1
else:
if y<=0:
ct2+=1-y
b[i]=-x+1
x+=b[i]
print((min(ct1,ct2))) | p03739 |
nums = int(eval(input()))
ary = list(map(int,input().split()))
#puls no toki
count = 0
sum = ary[0]
if ary[0] < 0 :
count += abs(ary[0])+1
sum = 1
elif ary[0] == 0:
sum = 1
count += 1
for i in range (1,nums):
sum += ary[i]
if i % 2 == 1:
if sum > 0 :
count += abs(sum)+1
sum = -1
elif sum == 0:
sum = -1
count += 1
elif i % 2 == 0:
if sum < 0:
count += abs(sum)+1
sum = 1
elif sum == 0:
sum = 1
count += 1
result_plus = count
#minus no toki
count = 0
sum = ary[0]
if ary[0] > 0:
count += abs(ary[0]) +1
sum = -1
elif ary[0] == 0:
sum = -1
count += 1
for i in range(1,nums):
sum += ary[i]
if i % 2 == 1:
if sum < 0:
count += abs(sum)+1
sum = 1
elif sum == 0:
count += 1
sum = 1
if i % 2 == 0:
if sum > 0:
count += abs(sum)+1
sum = -1
elif sum == 0:
count += 1
sum = -1
result_minus = count
if result_plus > result_minus:
print(result_minus)
else:
print(result_plus) | n = int(eval(input()))
a = list(map(int,input().split()))
count = 0
check = 0
for i in range(n):
check += a[i]
if i%2==0 and check <= 0:
count += 1-check
check = 1
elif i%2==1 and check >= 0:
count += 1+check
check = -1
ans = count
count = 0
check = 0
for i in range(n):
check += a[i]
if i%2==0 and check >= 0:
count += 1+check
check = -1
if i%2==1 and check <= 0:
count += 1-check
check = 1
print((ans if ans < count else count)) | p03739 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
"""
if a[0] == 0:
#a[1] とa[0]を足して|1|かつa[0]とa[1]+a[0]の符号を逆にしたい
if a[1] > 0:
a[0] = 1 - a[1]
elif a[1] < 0:
a[0] = -1 - a[1]
else: # a[0] a[1] 共に0の場合、a[2]に依存する -> 両方やればいい
奇数番目と偶数ばんめのどちらを＋にするか
"""
ans_odd = 0
total_odd = 0
ans_even = 0
total_even = 0
for i in range(n):
if (i+1) % 2 == 1: #奇数ばんめ
#奇数番目を＋、偶数番目を-にするパターン
total_odd += a[i]
if total_odd <= 0:
ans_odd += abs(total_odd) + 1
total_odd = 1
#偶数番目を＋、奇数番目を-にするパターン
total_even += a[i]
if total_even >= 0:
ans_even += (abs(total_even)+1)
total_even = -1
else: #偶数番目
#奇数番目を＋、偶数番目を-にするパターン
total_odd += a[i]
if total_odd >= 0:
ans_odd += abs(total_odd)+1
total_odd = -1
#偶数番目を＋、奇数番目を-にするパターン
total_even += a[i]
if total_even <= 0:
ans_even += abs(total_even)+1
total_even = 1
"""
print("total,ans_odd")
print(total_odd)
print(ans_odd)
print("total,ans_even")
print(total_even)
print(ans_even)
"""
print((min([ans_odd, ans_even])))
#print() |
N = int(eval(input()))
A = list(map(int, input().split()))
#奇数番目を負にする場合
odd = 0
total = 0
for i in range(N):
total += A[i]
if i % 2 == 0: #奇数番目の場合
if total > -1:
odd += 1 + total
total = -1
else:
if total < 1:
odd += 1 - total
total = 1
#偶数番目を負にする場合
even = 0
total = 0
for i in range(N):
total += A[i]
if i % 2 == 0: #奇数番目の場合
if total < 1:
even += 1 - total
total = 1
else:
if total > -1:
even += 1 + total
total = -1
print((min(odd, even)))
| p03739 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
b = a[:]
acc = 0
for i in range(n):
if i%2==0:
if acc+b[i]<=0:
b[i] += 1-(acc+b[i])
else:
if acc+b[i]>=0:
b[i] -= acc+b[i]+1
acc += b[i]
c = a[:]
acc = 0
for i in range(n):
if i%2==0:
if acc+c[i]>=0:
c[i] -= acc+c[i]+1
else:
if acc+c[i]<=0:
c[i] += 1-(acc+c[i])
acc += c[i]
ans = min(sum(abs(ai-bi) for ai, bi in zip(a, b)), sum(abs(ai-ci) for ai, ci in zip(a, c)))
print(ans) | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
cnt1, now = 0, 0
for i in range(n):
now += a[i]
if i%2==0:
if now<=0:
cnt1 += 1-now
now = 1
else:
if now>=0:
cnt1 += now+1
now = -1
cnt2, now = 0, 0
for i in range(n):
now += a[i]
if i%2==1:
if now<=0:
cnt2 += 1-now
now = 1
else:
if now>=0:
cnt2 += now+1
now = -1
print((min(cnt1, cnt2))) | p03739 |
import copy
n = int(eval(input()))
a = list(map(int, input().split()))
def judge_pm(a,b):
if a*b<0:
return True
else:
return False
a1 = copy.deepcopy(a)
tmp_sum = a1[0]
operate_num1 = 0
for i in range(1, n):
if judge_pm(tmp_sum, tmp_sum+a1[i]):
pass
elif tmp_sum<0:
tmp_operate_num1 = - tmp_sum + 1 - a1[i]
operate_num1 += tmp_operate_num1
a1[i] += tmp_operate_num1
else:
tmp_operate_num1 = tmp_sum + 1 + a1[i]
operate_num1 += tmp_operate_num1
a1[i] -= tmp_operate_num1
tmp_sum += a1[i]
a2 = copy.deepcopy(a)
tmp_sum = a2[0]
operate_num2 = 0
for i in range(1, n):
if judge_pm(tmp_sum, tmp_sum+a2[i]):
pass
elif tmp_sum<0:
tmp_operate_num2 = - tmp_sum + 1 - a2[i]
operate_num2 += tmp_operate_num2
a2[i-1] -= tmp_operate_num2
tmp_sum -= tmp_operate_num2
else:
tmp_operate_num2 = tmp_sum + 1 + a2[i]
operate_num2 += tmp_operate_num2
a2[i-1] += tmp_operate_num2
tmp_sum += tmp_operate_num2
tmp_sum += a2[i]
print((min(operate_num1, operate_num2)))
| import copy
n = int(eval(input()))
a = list(map(int, input().split()))
def judge_pm(a,b):
if a*b<0:
return True
else:
return False
a1 = copy.deepcopy(a)
operate_num1 = 0
if a1[0]==0:
a1[0] = 1
operate_num1 += 1
tmp_sum = a1[0]
for i in range(1, n):
if judge_pm(tmp_sum, tmp_sum+a1[i]):
pass
elif tmp_sum<0:
tmp_operate_num = - tmp_sum + 1 - a1[i]
operate_num1 += tmp_operate_num
a1[i] += tmp_operate_num
else:
tmp_operate_num = tmp_sum + 1 + a1[i]
operate_num1 += tmp_operate_num
a1[i] -= tmp_operate_num
tmp_sum += a1[i]
a2 = copy.deepcopy(a)
operate_num2 = 0
if a2[0]<0:
operate_num2 += 1 - a2[0]
a2[0] += operate_num2
else:
operate_num2 += a2[0] + 1
a2[0] -= operate_num2
tmp_sum = a2[0]
for i in range(1, n):
if judge_pm(tmp_sum, tmp_sum+a2[i]):
pass
elif tmp_sum<0:
tmp_operate_num = - tmp_sum + 1 - a2[i]
operate_num2 += tmp_operate_num
a2[i] += tmp_operate_num
else:
tmp_operate_num = tmp_sum + 1 + a2[i]
operate_num2 += tmp_operate_num
a2[i] -= tmp_operate_num
tmp_sum += a2[i]
print((min(operate_num1, operate_num2)))
| p03739 |
N = int(eval(input()))
arr = list(map(int,input().split()))
def S1(a,b):
c,last,ans = 0,0,0
for t in range(N):
c += 1
if c % 2 == a:
while last+arr[t] <= 0:
ans += 1
last += 1
elif c % 2 == b:
while last +arr[t] >= 0:
ans +=1
last -= 1
last += arr[t]
return ans
aa = S1(1,0)
bb = S1(0,1)
print((min(aa,bb))) | N = int(eval(input()))
arr = list(map(int,input().split()))
def S1(a,b):
c,total,ans = 0,0,0
for t in arr:
c += 1
if c % 2 == a:
if total+t <= 0:
ans += abs(total+t)+1
total = 1
continue
elif c % 2 == b:
if total+t >= 0:
ans += abs(total+t)+1
total = -1
continue
total += t
return ans
print((min(S1(1,0),S1(0,1)))) | p03739 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = [a_ for a_ in a]
ans = 10**14
for a0 in [-1,a[0],1]:
if a0 == 0:
continue
ans_ = abs(a[0]-a0)
b[0] = a0
sign = b[0] > 0
for i in range(1,n):
b[i] = a[i]+b[i-1]
if sign:
if b[i] >= 0:
ans_ += b[i]+1
b[i] = -1
else:
if b[i] <= 0:
ans_ += 1-b[i]
b[i] = 1
sign = not sign
ans = min(ans, ans_)
print(ans) | n = int(eval(input()))
A = list(map(int, input().split()))
def adj(n, a ,flag):
na = 0
cnt = 0
for i in range(n):
na += a[i]
if flag == 1:
if na <= 0:
cnt += 1 - na
na = 1
flag = -1
elif flag == -1:
if na >= 0:
cnt += na + 1
na = -1
flag = 1
return cnt
print((min(adj(n, A, 1),adj(n, A, -1)))) | p03739 |
n=int(eval(input()))
a=list(map(int, input().split()))
sum_now=a[0]
sum_before=-a[0]
count_1=0
count_2=0
for i in range(n):
while sum_now*sum_before>=0:
if sum_before==0:
sum_now=-a[1]/abs(a[1])
count_1+=1
else:
count_1+=abs(int(sum_now))+1
sum_now=-sum_before/abs(sum_before)
if i!=n-1:
sum_before=sum_now
sum_now=sum_now+a[i+1]
sum_now=a[0]
sum_before=-a[0]
if sum_before==0:
sum_now=a[1]/abs(a[1])
sum_before=-sum_now
count_2+=1
else:
count_2+=abs(int(sum_now))+1
sum_now=-sum_now/abs(sum_now)
sum_before=-sum_now
for i in range(n):
while sum_now*sum_before>=0:
if sum_before==0:
sum_now=a[1]/abs(a[1])
count_2+=1
else:
count_2+=abs(int(sum_now))+1
sum_now=-sum_before/abs(sum_before)
if i!=n-1:
sum_before=sum_now
sum_now=sum_now+a[i+1]
print((min(count_1, count_2))) | n=int(eval(input()))
a=list(map(int, input().split()))
sum_now=a[0]
sum_before=-a[0]
count_1=0
count_2=0
for i in range(n):
if sum_now*sum_before>=0:
if sum_before==0:
sum_now=-a[1]/abs(a[1])
count_1+=1
else:
count_1+=abs(int(sum_now))+1
sum_now=-sum_before/abs(sum_before)
if i!=n-1:
sum_before=sum_now
sum_now=sum_now+a[i+1]
sum_now=a[0]
sum_before=-a[0]
if sum_before==0:
sum_now=a[1]/abs(a[1])
sum_before=-sum_now
count_2+=1
else:
count_2+=abs(int(sum_now))+1
sum_now=-sum_now/abs(sum_now)
sum_before=-sum_now
for i in range(n):
if sum_now*sum_before>=0:
if sum_before==0:
sum_now=a[1]/abs(a[1])
count_2+=1
else:
count_2+=abs(int(sum_now))+1
sum_now=-sum_before/abs(sum_before)
if i!=n-1:
sum_before=sum_now
sum_now=sum_now+a[i+1]
print((min(count_1, count_2))) | p03739 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = A.copy()
gokei = 0
ans1 = 0
for i in range(N):
gokei = sum(A[:i+1])
# 偶数番目を負に
if i % 2 == 0:
if gokei >= 0:
ans1 += abs(-1 - gokei)
A[i] -= abs(-1 - gokei)
if i % 2 == 1:
if gokei <= 0:
ans1 += 1 - gokei
A[i] += (1 - gokei)
gokei = 0
ans2 = 0
for i in range(N):
gokei = sum(B[:i+1])
# 偶数番目を正に
if i % 2 == 0:
if gokei <= 0:
ans2 += 1 - gokei
B[i] += (1 - gokei)
else:
if gokei >= 0:
ans2 += abs(-1 - gokei)
B[i] -= abs(-1 - gokei)
print((min(ans1, ans2))) | N = int(eval(input()))
A = list(map(int, input().split()))
gokei = 0
ans1 = 0
for i in range(N):
gokei += A[i]
# 偶数番目を負に
if i % 2 == 0:
if gokei >= 0:
ans1 += abs(-1 - gokei)
gokei -= abs(-1 - gokei)
if i % 2 == 1:
if gokei <= 0:
ans1 += 1 - gokei
gokei += (1 - gokei)
gokei = 0
ans2 = 0
for i in range(N):
gokei += A[i]
# 偶数番目を正に
if i % 2 == 0:
if gokei <= 0:
ans2 += 1 - gokei
gokei += (1 - gokei)
else:
if gokei >= 0:
ans2 += abs(-1 - gokei)
gokei -= abs(-1 - gokei)
print((min(ans1, ans2))) | p03739 |
N = int(eval(input()))
A = list(map(int, input().split()))
gokei = 0
ans1 = 0
for i in range(N):
gokei += A[i]
# 偶数番目を負に
if i % 2 == 0:
if gokei >= 0:
ans1 += abs(-1 - gokei)
gokei -= abs(-1 - gokei)
if i % 2 == 1:
if gokei <= 0:
ans1 += 1 - gokei
gokei += (1 - gokei)
gokei = 0
ans2 = 0
for i in range(N):
gokei += A[i]
# 偶数番目を正に
if i % 2 == 0:
if gokei <= 0:
ans2 += 1 - gokei
gokei += (1 - gokei)
else:
if gokei >= 0:
ans2 += abs(-1 - gokei)
gokei -= abs(-1 - gokei)
print((min(ans1, ans2))) | N = int(eval(input()))
A = list(map(int, input().split()))
c = A[0]
ans1 = 0
for a in A[1:]:
if c > 0 and c + a >= 0:
ans1 += c + a + 1
c = -1
elif c < 0 and c + a <= 0:
ans1 += -(c + a) + 1
c = 1
else:
c = c + a
c = 1
ans2 = abs(A[0] - 1)
for a in A[1:]:
if c > 0 and c + a >= 0:
ans2 += c + a + 1
c = -1
elif c < 0 and c + a <= 0:
ans2 += -(c + a) + 1
c = 1
else:
c = c + a
c = -1
ans3 = abs(A[0] + 1)
for a in A[1:]:
if c > 0 and c + a >= 0:
ans3 += c + a + 1
c = -1
elif c < 0 and c + a <= 0:
ans3 += -(c + a) + 1
c = 1
else:
c = c + a
print((min(ans1, ans2, ans3)))
| p03739 |
#!/usr/bin/env python3
from itertools import accumulate
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a = list(accumulate(a))
ans = 10**18
for j in range(2):# 偶数行が正か奇数行が正
ans2 = 0
diff = 0
for i in range(n):
p = a[i] + diff
# print(a[i],diff)
if (i+j) % 2 == 0 and p <= 0:# 正になる
ans2 += abs(p)+1
diff += abs(p)+1
elif (i+j) % 2 == 1 and p >= 0:# 負になる
ans2 += abs(p)+1
diff -= abs(p)+1
ans = min(ans, ans2)
print(ans)
if __name__ == "__main__":
main()
| N = int(eval(input()))
A = list(map(int, input().split()))
# 方針:正負正...と負正負...の両方を試す
ans = 0
now = 0
for i in range(N):
if i % 2 == 0:# 正にする
if now+A[i] <= 0:
ans += 1 - (now+A[i])
now = 1
else:
now += A[i]
else:
if now+A[i] >= 0:
ans += 1 + (now+A[i])
now = -1
else:
now += A[i]
ans2 = 0
now = 0
for i in range(N):
if i % 2 == 1:# 正にする
if now+A[i] <= 0:
ans2 += 1 - (now+A[i])
now = 1
else:
now += A[i]
else:
if now+A[i] >= 0:
ans2 += 1 + (now+A[i])
now = -1
else:
now += A[i]
print((min(ans,ans2))) | p03739 |
n = int(eval(input()))
a = list(map(int,input().split()))
sun = 0
ans1 = 0
for i in range(n):
if i == 0:
SUN = 1
else:
SUN = sun
now = a[i]
if SUN * (sun+now) >= 0:
ans1 += abs(sun+now) + 1
if SUN > 0:
sun = -1
else:
sun = 1
else:
sun += now
sun = 0
ans2 = 0
for i in range(n):
now = a[i]
if i == 0:
SUN = -1
else:
SUN = sun
if SUN * (sun+now) >= 0:
ans2 += abs(sun+now) + 1
if SUN > 0:
sun = -1
else:
sun = 1
else:
sun += now
#print(ans1,ans2)
print((min(ans1,ans2))) | n = int(eval(input()))
a = list(map(int,input().split()))
can = []
ans = 0
now = 0
for i in range(n):
now += a[i]
if i % 2 == 0:
if now <= 0:
ans += 1 - now
now = 1
else:
if now >= 0:
ans += 1 + now
now = -1
can.append(ans)
ans = 0
now = 0
for i in range(n):
now += a[i]
if i % 2 == 1:
if now <= 0:
ans += 1 - now
now = 1
else:
if now >= 0:
ans += 1 + now
now = -1
can.append(ans)
print((min(can))) | p03739 |
n=int(eval(input()))
a=list(map(int,input().split()))
fg=[1,-1]
ret = [0]*2
tot = [0]*2
for i in range(n):
for j in range(2):
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
print((min(ret))) | n=int(eval(input()))
a=list(map(int,input().split()))
fg=[1,-1]
ret = [0]*2
tot = [0]*2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
print((min(ret))) | p03739 |
n=int(eval(input()))
a=list(map(int,input().split()))
fg=[1,-1]
ret = [0]*2
tot = [0]*2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
print((min(ret))) | n=int(eval(input()))
a=list(map(int,input().split()))
def ma():
fg=[1,-1]
ret = [0]*2
tot = [0]*2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
return min(ret)
print((ma())) | p03739 |
eval(input())
l=list(map(int,input().split()))
def f(s):
c=t=0
for i in l:
t+=i
if s*t<=0: c+=abs(t-s); t=s
s*=-1
return c
print((min(f(1),f(-1)))) | _,*l=list(map(int,open(0).read().split()))
def f(s):
c=t=0
for i in l:
t+=i
if s*t<=0: c+=abs(t-s); t=s
s*=-1
return c
print((min(f(1),f(-1)))) | p03739 |
#
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
r_ = n / m
if (r_ - (n // m)) > 0:
return (n//m) + 1
else:
return (n//m)"""
""" n! mod m 階乗
mod = 1e9 + 7
N = 10000000
fac = [0] * N
def ini():
fac[0] = 1 % mod
for i in range(1,N):
fac[i] = fac[i-1] * i % mod"""
"""mod = 1e9+7
N = 10000000
pw = [0] * N
def ini(c):
pw[0] = 1 % mod
for i in range(1,N):
pw[i] = pw[i-1] * c % mod"""
"""
def YEILD():
yield 'one'
yield 'two'
yield 'three'
generator = YEILD()
print(next(generator))
print(next(generator))
print(next(generator))
"""
"""def gcd_(a,b):
if b == 0:#結局はc,0の最大公約数はcなのに
return a
return gcd_(a,a % b) # a = p * b + q"""
"""def extgcd(a,b,x,y):
d = a
if b!=0:
d = extgcd(b,a%b,y,x)
y -= (a//b) * x
print(x,y)
else:
x = 1
y = 0
return d"""
def readInts():
return list(map(int,input().split()))
mod = 10**9 + 7
def main():
n = int(eval(input()))
A = readInts()
# 符号 positive?
#po_ = True
# 変わったか変わってないか
if A[0] >= 0: # if positive
po_ = True
else: # negative
po_ = False
Cost = 0
for i in range(1,n):
#print(sum(A[:i+1]),A[i],po_)
if sum(A[:i+1]) >= 0 and not po_: # sumがpositiveで前がnegativeだった
po_ = True # positiveに
if sum(A[:i+1]) == 0:
A[i] += 1
Cost += 1
# これで終わり
elif sum(A[:i+1]) >= 0 and po_: # posi : posi ?
# 負にしなければならない
Cost += abs(-1 - sum(A[:i+1])) # 先にこれやれ
A[i] += -1 - sum(A[:i+1])
po_ = False
elif sum(A[:i+1]) < 0 and not po_: #nega : nega
# -1 はここ
# print(A[i])
Cost += abs(1 - sum(A[:i+1])) # 先にこれやれ
A[i] += 1 - sum(A[:i+1])
po_ = True
else: # nega: pos
po_ = False
if sum(A[:i+1]) == 0:
A[i] -=1
Cost -=1
#print(A[i])
print(Cost)
if __name__ == '__main__':
main() | #
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
r_ = n / m
if (r_ - (n // m)) > 0:
return (n//m) + 1
else:
return (n//m)"""
""" n! mod m 階乗
mod = 1e9 + 7
N = 10000000
fac = [0] * N
def ini():
fac[0] = 1 % mod
for i in range(1,N):
fac[i] = fac[i-1] * i % mod"""
"""mod = 1e9+7
N = 10000000
pw = [0] * N
def ini(c):
pw[0] = 1 % mod
for i in range(1,N):
pw[i] = pw[i-1] * c % mod"""
"""
def YEILD():
yield 'one'
yield 'two'
yield 'three'
generator = YEILD()
print(next(generator))
print(next(generator))
print(next(generator))
"""
"""def gcd_(a,b):
if b == 0:#結局はc,0の最大公約数はcなのに
return a
return gcd_(a,a % b) # a = p * b + q"""
"""def extgcd(a,b,x,y):
d = a
if b!=0:
d = extgcd(b,a%b,y,x)
y -= (a//b) * x
print(x,y)
else:
x = 1
y = 0
return d"""
def readInts():
return list(map(int,input().split()))
mod = 10**9 + 7
def main():
n = int(eval(input()))
A = readInts()
cur = 0
ans1 = 0
for i in range(n):
cur += A[i]
if i % 2:
if cur <= 0:
ans1 += -cur+1
cur = 1
else:
if cur >= 0:
ans1 += cur + 1
cur = -1
cur = 0
ans2 = 0
for i in range(n):
cur += A[i]
if i % 2:
if cur >= 0:
ans2 += cur + 1
cur = -1
else:
if cur <= 0:
ans2 += -cur + 1
cur = 1
print((min(ans1,ans2)))
if __name__ == '__main__':
main() | p03739 |
from functools import lru_cache
n = int(eval(input()))
s = list(map(int, input().split()))
@lru_cache(maxsize=None)
def cost_e():
res = 0
sum = 0
for j, y in enumerate(s, 1):
tmp = sum + y
if j & 1 and tmp >= 0:
sum = -1
res += abs(tmp) + 1
elif not j & 1 and tmp <= 0:
sum = 1
res += abs(tmp) + 1
else:
sum = tmp
return res
@lru_cache(maxsize=None)
def cost_o():
res = 0
sum = 0
for j, y in enumerate(s, 1):
tmp = sum + y
if j & 1 and tmp <= 0:
sum = 1
res += abs(tmp) + 1
elif not j & 1 and tmp >= 0:
sum = -1
res += abs(tmp) + 1
else:
sum = tmp
return res
print((min(cost_e(), cost_o())))
| n = int(eval(input()))
s = list(map(int, input().split()))
def cost(t):
res = 0
sum = 0
for y in s:
sum += y
if sum * t <= 0:
res += abs(sum - t)
sum = t
t *= -1
return res
print((min(cost(1), cost(-1))))
| p03739 |
n = int(eval(input()))
a = list(map(int, input().split()))
import copy
a2 = copy.copy(a)
ans1 = 0 #偶数インデックスが正
for i in range(n):
s1 = sum(a[:i+1])
if i % 2 == 0:
if s1 <= 0:
x = abs(s1) + 1
ans1 += x
a[i] += x
else:
continue
else:
if s1 >= 0:
x = abs(s1) + 1
ans1 += x
a[i] -= x
ans2 = 0 #偶数インデックスが負
for i in range(n):
s2 = sum(a2[:i+1])
if i % 2 == 1:
if s2 <= 0:
x = abs(s2) + 1
ans2 += x
a2[i] += x
else:
continue
else:
if s2 >= 0:
x = abs(s2) + 1
ans2 += x
a2[i] -= x
print((min(ans1, ans2))) | n = int(eval(input()))
a = list(map(int, input().split()))
def f(a, sgn):
cnt = 0
s = 0
for i in range(n):
s += a[i]
sgn *= (-1) #判定する符号は交互に変わる
if s * sgn <= 0: #sgn一致しなければその積は負
x = s + sgn*(-1)
s -= x
cnt += abs(x)
return cnt
ans = min(f(a, 1), f(a, -1))
print(ans) | p03739 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.