input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def main():
N = int(eval(input()))
A = []
d = []
for i in range(N):
Ai = list(map(int, input().split()))
A.append(Ai)
for j in range(i+1, N):
if Ai[j] > 0:
d.append((Ai[j], i, j))
d.sort(key=lambda x: x[0])
def wf(dist):
for i in range(N):
for j in range(N):
for k in range(N):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
return dist
ok = len(d)+1
ng = 0
mid = len(d)
while ok - ng > 1:
dist = [[10 ** 10 for _ in range(N)] for _ in range(N)]
for i in range(N):
dist[i][i] = 0
for x, i, j in d[:mid]:
dist[i][j] = x
dist[j][i] = x
if wf(dist) == A:
ok = mid
else:
ng = mid
if ng == len(d):
print((-1))
exit()
mid = (ok+ng)//2
ans = 0
for i in range(ok):
ans += d[i][0]
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = []
dist = [[0 for _ in range(N)] for _ in range(N)]
for i in range(N):
Ai = list(map(int, input().split()))
A.append(Ai)
for j in range(N):
dist[i][j] = Ai[j]
def wf(dist):
need = [[1 for _ in range(N)] for _ in range(N)]
for i in range(N):
for j in range(N):
for k in range(N):
if dist[i][j] > dist[i][k] + dist[k][j]:
print((-1))
exit()
elif dist[i][j] == dist[i][k] + dist[k][j]:
if i != k and j != k:
need[i][j] = 0
need[j][i] = 0
return need
need = wf(dist)
ans = 0
for i in range(N):
for j in range(i+1, N):
ans += need[i][j] * dist[i][j]
print(ans)
if __name__ == '__main__':
main()
| p03600 |
N= int(eval(input()))
MP=[list(map(int,input().split())) for i in range(N)]
MP2=[]
for li in MP:
MP2.append(li.copy())
MP3=[[-1]*N for _ in range(N)]
# ワーシャルフロイド
for k in range(N):
for i in range(N):
for j in range(N):
cand = MP2[i][k] + MP2[k][j]
if cand <= MP2[i][j]:
MP2[i][j] = cand
if (i != k and j != k):
MP3[i][j] = k
for i in range(N):
for j in range(N):
if MP[i][j] != MP2[i][j]:
print((-1))
exit()
checked=set()
res = set()
def dfs(i,j):
k = MP3[i][j]
if k == -1:
k = i
if (i,j) in checked:
return
checked.add((i,j))
if (i == k or j == k):
if i < j:
res.add((i,j))
else:
dfs(i,k)
dfs(k,j)
for i in range(N):
for j in range(N):
dfs(i,j)
ressum = 0
for i,j in res:
ressum += MP[i][j]
# for li in MP3:
# print(li)
# print(res)
print(ressum)
| N=int(eval(input()))
MP=[list(map(int,input().split())) for i in range(N)]
MP2=[]
for li in MP:
MP2.append([i for i in li])
MP3=[[-1]*N for _ in range(N)]
# ワーシャルフロイド
for k in range(N):
for i in range(N):
for j in range(N):
cand = MP2[i][k] + MP2[k][j]
if cand <= MP2[i][j]:
MP2[i][j] = cand
if (i != k and j != k):
MP3[i][j] = k
for i in range(N):
for j in range(N):
if MP[i][j] != MP2[i][j]:
print((-1))
exit()
checked=set()
res = set()
def dfs(i,j):
k = MP3[i][j]
if k == -1:
k = i
if (i,j) in checked:
return
checked.add((i,j))
if (i == k or j == k):
if i < j:
res.add((i,j))
else:
dfs(i,k)
dfs(k,j)
for i in range(N):
for j in range(N):
dfs(i,j)
ressum = 0
for i,j in res:
ressum += MP[i][j]
# for li in MP3:
# print(li)
# print(res)
print(ressum)
| p03600 |
from heapq import heappush,heappop,heapify
INF=10**18
def find(x):
if(par[x]==x):
return x
else:
par[x]=find(par[x])
return par[x]
def union(a,b):
a=find(a)
b=find(b)
if(a==b):
return 0
else:
if rank[a]>rank[b]:
par[b]=a
siz[a]+=siz[b]
else:
par[a]=b
siz[b]+=siz[a]
if rank[a]==rank[b]:
rank[b]+=1
def size(a):
return siz[find(a)]
def same(a,b):
return find(a)==find(b)
def dijkstra(G,s,g,n):
que=[(0,s)]
dist=[INF]*n
dist[s]=0
while que:
mincost,u=heappop(que)
if(mincost>dist[u]):
continue
if(u==g):
return dist
if(G[u]):
for c,v in G[u]:
if(dist[u]+c<dist[v]):
dist[v]=dist[u]+c
heappush(que,(dist[v],v))
return dist
N=int(eval(input()))
par=[i for i in range(N)]
siz=[1 for _ in range(N)]
rank=[0 for _ in range(N)]
A=[list(map(int,input().split())) for i in range(N)]
G=[set() for i in range(N)]
Edges=[]
for i in range(N):
for j in range(N):
if(i==j):
continue
Edges.append([A[i][j],i,j])
Edges.sort(key=lambda x:x[0])
res=0
for i in range(len(Edges)):
cost,fr,to=Edges[i]
if not same(fr,to):
union(fr,to)
G[fr].add((cost,to))
G[to].add((cost,fr))
res+=cost
else:
di=dijkstra(G,fr,to,N)
if di[to]<A[fr][to]:
print((-1))
exit()
if di[to]>cost:
G[fr].add((cost,to))
G[to].add((cost,fr))
res+=cost
print(res) | N=int(eval(input()))
A=[list(map(int,input().split())) for i in range(N)]
res=0
flag=[[False]*N for i in range(N)]
for k in range(N):
for i in range(N):
for j in range(N):
if A[i][j]>A[i][k]+A[k][j]:
print((-1))
exit()
elif k!=i and k!=j and A[i][j]==A[i][k]+A[k][j] and not flag[i][j] and not flag[j][i]:
flag[i][j]=True
flag[j][i]=True
res-=A[i][j]
ans=sum(sum(A[i]) for i in range(N))//2+res
print(ans) | p03600 |
import sys
from heapq import heappop, heappush
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = [list(map(int,input().split())) for _ in range(n)]
g = [[] for _ in range(n)]
for i in range(n-1):
for j in range(i+1,n):
g[i].append((j,a[i][j]))
g[j].append((i,a[i][j]))
ans = 0
for i in range(n):
ans += sum(a[i])
ans //= 2
for i in range(n-1):
que = []
d = [10**15 for _ in range(n)]
d[i] = 0
heappush( que,(0,i) )
while que:
p = heappop(que)
v = p[1]
if d[v] < p[0]:
continue
for k in range(len(g[v])):
edge = g[v][k]
if d[edge[0]] > d[v] + edge[1]:
d[edge[0]] = d[v] + edge[1]
heappush( que,(d[edge[0]] , edge[0]) )
if d != a[i]:
print((-1))
return
for j in range(i+1,n):
que = []
d = [10**15 for _ in range(n)]
d[i] = 0
heappush( que,(0,i) )
while que:
p = heappop(que)
v = p[1]
if d[v] < p[0]:
continue
for k in range(len(g[v])):
edge = g[v][k]
if (edge[0], v) == (i,j) or (edge[0], v) == (j,i):
continue
if d[edge[0]] > d[v] + edge[1]:
d[edge[0]] = d[v] + edge[1]
heappush( que,(d[edge[0]] , edge[0]) )
if d[j] == a[i][j]:
ans -= a[i][j]
print(ans)
if __name__ == "__main__":
main() | import sys
from heapq import heappop, heappush
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = [list(map(int,input().split())) for _ in range(n)]
g = [[] for _ in range(n)]
for i in range(n-1):
for j in range(i+1,n):
g[i].append((j,a[i][j]))
g[j].append((i,a[i][j]))
ans = 0
for i in range(n):
ans += sum(a[i])
ans //= 2
w = []
for i in range(n):
que = []
d = [10**15 for _ in range(n)]
d[i] = 0
heappush( que,(0,i) )
while que:
p = heappop(que)
v = p[1]
if d[v] < p[0]:
continue
for k in range(len(g[v])):
edge = g[v][k]
if d[edge[0]] > d[v] + edge[1]:
d[edge[0]] = d[v] + edge[1]
heappush( que,(d[edge[0]] , edge[0]) )
w.append(d)
for i in range(n-1):
for j in range(i+1,n):
if w[i][j] < a[i][j]:
print((-1))
return
flag = 0
for k in range(n):
if i == k or j == k:
continue
if w[i][k] + w[k][j] == w[i][j]:
flag = 1
if flag:
ans -= w[i][j]
print(ans)
if __name__ == "__main__":
main() | p03600 |
#!/usr/bin/env python3
import sys
import heapq
from bisect import bisect_left
INF = float("inf")
class Graph(object):
def __init__(self, N):
self.N = N
self.V = list(range(N))
self.E = [[] for _ in range(N)]
def add_edge(self, edge):
"""辺を加える。edgeは(始点, 終点、重み)からなるリスト
重みがなければ、重み1とする。
"""
if len(edge) == 2:
edge.append(1)
elif len(edge) != 3:
print("error in add_edge")
pass
s, t, w = edge
self.E[s].append([t, w])
self.E[t].append([s, w]) # 無向グラフを仮定。逆向きにも辺を張る
pass
def remove_edge(self, edge):
if len(edge) == 2:
edge.append(1)
elif len(edge) != 3:
print("error in add_edge")
pass
s, t, w = edge
for tt, ww in self.E[s]:
if tt == t:
break
if tt == t:
self.E[s].remove([t, ww])
self.E[t].remove([s, ww])
pass
def Warshall_Floyd(g: Graph):
"""ワーシャルフロイド法により、全節点対の最短距離を求める。O(V^3)
https://ja.wikipedia.org/wiki/%E3%83%AF%E3%83%BC%E3%82%B7%E3%83%A3%E3%83%AB%E2%80%93%E3%83%95%E3%83%AD%E3%82%A4%E3%83%89%E6%B3%95
"""
N = g.N
dist = [[INF]*N for _ in range(N)]
for from_, toweights in enumerate(g.E):
for to_, w in toweights:
dist[from_][to_] = w
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
return dist
def solve(N: int, A: "List[List[int]]"):
g = Graph(N)
for i in range(N):
for j in range(i+1, N):
g.add_edge([i, j, A[i][j]])
B = Warshall_Floyd(g)
counter = 0
for i in range(N):
for j in range(i+1, N):
if B[i][j] < A[i][j]:
print((-1))
return
flag = True
for k in range(N):
if B[i][j] == B[i][k]+B[k][j]:
flag = False
if flag == True:
counter += B[i][j]
print(counter)
return
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
A = [[int(next(tokens)) for _ in range(N)]
for _ in range(N)] # type: "List[List[int]]"
solve(N, A)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
INF = float("inf")
class Graph(object):
def __init__(self, N):
self.N = N
self.V = list(range(N))
self.E = [[] for _ in range(N)]
def add_edge(self, edge):
"""辺を加える。edgeは(始点, 終点、重み)からなるリスト
重みがなければ、重み1とする。
"""
if len(edge) == 2:
edge.append(1)
elif len(edge) != 3:
print("error in add_edge")
pass
s, t, w = edge
self.E[s].append([t, w])
self.E[t].append([s, w]) # 無向グラフを仮定。逆向きにも辺を張る
pass
def remove_edge(self, edge):
if len(edge) == 2:
edge.append(1)
elif len(edge) != 3:
print("error in add_edge")
pass
s, t, w = edge
for tt, ww in self.E[s]:
if tt == t:
break
if tt == t:
self.E[s].remove([t, ww])
self.E[t].remove([s, ww])
pass
def Warshall_Floyd(g: Graph):
"""ワーシャルフロイド法により、全節点対の最短距離を求める。O(V^3)
https://ja.wikipedia.org/wiki/%E3%83%AF%E3%83%BC%E3%82%B7%E3%83%A3%E3%83%AB%E2%80%93%E3%83%95%E3%83%AD%E3%82%A4%E3%83%89%E6%B3%95
"""
N = g.N
dist = [[INF]*N for _ in range(N)]
for from_, toweights in enumerate(g.E):
for to_, w in toweights:
dist[from_][to_] = w
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
return dist
def solve(N: int, A: "List[List[int]]"):
g = Graph(N)
for i in range(N):
for j in range(i+1, N):
g.add_edge([i, j, A[i][j]])
B = Warshall_Floyd(g)
counter = 0
for i in range(N):
for j in range(i+1, N):
if B[i][j] < A[i][j]:
print((-1))
return
flag = True
for k in range(N):
if B[i][j] == B[i][k]+B[k][j]:
flag = False
if flag == True:
counter += B[i][j]
print(counter)
return
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
A = [[int(next(tokens)) for _ in range(N)]
for _ in range(N)] # type: "List[List[int]]"
solve(N, A)
if __name__ == '__main__':
main()
| p03600 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
N = int(readline())
G = [list(map(int, readline().split())) for _ in range(N)]
ans = 0
for i in range(N):
for j in range(i + 1, N):
needed = True
for k in range(N):
if G[i][j] > G[i][k] + G[k][j]:
print((-1))
return
if k not in (i, j) and G[i][j] == G[i][k] + G[k][j]:
needed = False
if needed:
ans += G[i][j]
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
def main():
N = int(readline())
G = [list(map(int, readline().split())) for _ in range(N)]
ans = 0
for i in range(N):
for j in range(i + 1, N):
needed = True
for k in range(N):
if k == i or k == j:
continue
if G[i][j] > G[i][k] + G[k][j]:
print((-1))
return
if G[i][j] == G[i][k] + G[k][j]:
needed = False
if needed:
ans += G[i][j]
print(ans)
return
if __name__ == '__main__':
main()
| p03600 |
import copy
N = int(eval(input()))
A = []
for i in range(N):
A.append(list(map(int, input().split())))
B = copy.deepcopy(A)
for i in range(N):
for j in range(N):
if i == j:
continue
for k in range(N):
if j == k:
continue
if k == i:
continue
if A[i][j] > A[i][k] + A[k][j]:
print((-1))
exit()
if A[i][j] == A[i][k] + A[k][j]:
B[i][j] = 0
ans = 0
for i in range(N):
for j in range(i, N):
ans += B[i][j]
print(ans)
| import copy
N = int(eval(input()))
A = []
for i in range(N):
A.append(list(map(int, input().split())))
B = copy.deepcopy(A)
for i in range(N):
for j in range(i, N):
for k in range(N):
if not (i != j and j != k and k != i):
continue
if A[i][j] > A[i][k] + A[k][j]:
print((-1))
exit()
if A[i][j] == A[i][k] + A[k][j]:
B[i][j] = 0
ans = 0
for i in range(N):
for j in range(i, N):
ans += B[i][j]
print(ans)
| p03600 |
N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
nA = [line[:] for line in A]
cnt = 0
for k in range(N):
for i in range(N):
for j in range(N):
if nA[i][j] > nA[i][k] + nA[k][j]:
nA[i][j] = nA[i][k] + nA[k][j]
elif not(i == j or j == k or k == i) and nA[i][j] == nA[i][k] + nA[k][j]:
cnt += nA[i][j]
if A != nA:
print((-1))
else:
ans = sum(sum(line) for line in A) - cnt
ans //= 2
print(ans) | N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
flag = [[0] * N for _ in range(N)]
dist = [line[:] for line in A]
for k in range(N):
for i in range(N):
for j in range(N):
if i == j or j == k or k == i:
continue
if dist[i][j] > dist[i][k] + dist[k][j]:
dist[i][j] = dist[i][k] + dist[k][j]
elif dist[i][j] < dist[i][k] + dist[k][j]:
flag[i][j] += 1
if A != dist:
print((-1))
exit()
ans = 0
for i in range(N):
for j in range(N):
if flag[i][j] == N-2:
ans += A[i][j]
ans //= 2
print(ans) | p03600 |
N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
flag = [[0] * N for _ in range(N)]
dist = [line[:] for line in A]
for k in range(N):
for i in range(N):
for j in range(N):
if i == j or j == k or k == i:
continue
if dist[i][j] > dist[i][k] + dist[k][j]:
dist[i][j] = dist[i][k] + dist[k][j]
elif dist[i][j] < dist[i][k] + dist[k][j]:
flag[i][j] += 1
if A != dist:
print((-1))
exit()
ans = 0
for i in range(N):
for j in range(N):
if flag[i][j] == N-2:
ans += A[i][j]
ans //= 2
print(ans) | N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(N)]
flag = [[True] * N for _ in range(N)]
for i in range(N):
for j in range(i+1, N):
for k in range(N):
if k == i or k == j:
continue
if A[i][j] > A[i][k] + A[k][j]:
print((-1))
exit()
elif A[i][j] == A[i][k] + A[k][j]:
flag[i][j] = False
ans = 0
for i in range(N):
for j in range(i+1, N):
if flag[i][j]:
ans += A[i][j]
print(ans) | p03600 |
def dfs(s, stack):
visited[s] = 1
if s in stack:
print((1))
exit()
else:
stack.append(s)
for t in adj[s]:
dfs(t, stack)
stack.remove(s)
nv, ne = list(map(int, input().split(' ')))
adj = [[] for _ in range(nv)]
visited = [0] * nv
for _ in range(ne):
s, t = list(map(int, input().split(' ')))
adj[s].append(t)
while sum(visited) < nv:
r = 0
while visited[r]: r += 1
dfs(r, [])
print((0)) | def dfs(s):
if not visited[s]:
visited[s] = True
stack[s] = True
for t in adj[s]:
if stack[t]:
print((1))
exit()
else:
dfs(t)
stack[s] = False
nv, ne = list(map(int, input().split(' ')))
adj = [[] for _ in range(nv)]
visited = [False] * nv
stack = [False] * nv
for _ in range(ne):
s, t = list(map(int, input().split(' ')))
adj[s].append(t)
for i in range(nv):
dfs(i)
print((0)) | p02369 |
from collections import UserList
class Stack(UserList):
def __init__(self, *args):
UserList.__init__(self, *args)
self.contains = set()
def __contains__(self, x):
return x in self.contains
def __and__(self, x):
return self.contains & x
def push(self, x):
if x in self.contains:
return
self.data.append(x)
self.contains |= {x}
def pop(self):
x = self.data.pop()
self.contains -= {x}
return x
def is_contain_cycle(g, v):
visited = set()
for i in range(v):
if i in visited:
continue
route = Stack([None])
dfs_stack = [(i, None)]
while dfs_stack:
u, prev = dfs_stack.pop()
while route[-1] != prev:
route.pop()
visited |= {u}
if u in route:
return True
dfs_stack.extend((v, u) for v in g[u])
route.push(u)
return False
from sys import stdin
from collections import defaultdict
readline = stdin.readline
v, e = list(map(int, readline().split()))
g = defaultdict(set)
for i in range(e):
s, t = list(map(int, readline().split()))
g[s] |= {t}
print((1 if is_contain_cycle(g, v) else 0)) | def is_contain_cycle(g, v):
visited = set()
for i in range(v):
if i in visited:
continue
#route = Stack([None])
route = [None]
dfs_stack = [(i, None)]
while dfs_stack:
u, prev = dfs_stack.pop()
while route[-1] != prev:
route.pop()
if u in route:
return True
if u in visited:
continue
visited |= {u}
dfs_stack.extend((v, u) for v in g[u])
route.append(u)
return False
from sys import stdin
from collections import defaultdict
readline = stdin.readline
v, e = list(map(int, readline().split()))
g = defaultdict(set)
for i in range(e):
s, t = list(map(int, readline().split()))
g[s] |= {t}
print((1 if is_contain_cycle(g, v) else 0)) | p02369 |
n = int(eval(input()))
a = list(map(int, input().split()))
x = 2020202020
for i in range(1, n):
x = min(x, abs(sum(a[:i]) - sum(a[i:])))
print(x)
| n = int(eval(input()))
a = list(map(int, input().split()))
x = 0
y = sum(a)
ans = 2020202020
for i in range(n - 1):
x += a[i]
y -= a[i]
ans = min(ans, abs(x - y))
print(ans)
| p02854 |
n = int(eval(input()))
a = list(map(int, input().split())) # 横入力
b = [0]
aaa = 0
for i in range(n):
aaa += a[i]
b.append(aaa)
ans = 202020202020
for i in range(n):
ans = min(ans, abs(sum(a) - b[i]*2))
print(ans) | n = int(eval(input()))
a = list(map(int, input().split())) # 横入力
x = [0]
aaa = 0
for i in range(n):
aaa += a[i]
x.append(aaa)
aa = sum(a)
y = [aa]
for i in range(n):
aa -= a[i]
y.append(aa)
ans = 202020202020
for i in range(n+1):
ans = min(ans, abs(x[i] - y[i]))
print(ans) | p02854 |
n = int(eval(input()))
a = list(map(int, input().split())) # 横入力
x = [0]
aaa = 0
aa = sum(a)
y = [aa]
for i in range(n):
aaa += a[i]
x.append(aaa)
aa -= a[i]
y.append(aa)
ans = 202020202020
for i in range(n+1):
ans = min(ans, abs(x[i] - y[i]))
print(ans) | n = int(eval(input()))
a = list(map(int, input().split())) # 横入力
x = [0]
aaa = 0
aa = sum(a)
# y = [aa]
for i in range(n):
aaa += a[i]
x.append(aaa)
# aa -= a[i]
# y.append(aa)
ans = 202020202020
for i in range(n+1):
ans = min(ans, abs(aa - x[i]*2))
print(ans) | p02854 |
n=int(eval(input()))
a=list(map(int,input().split()))
suma=sum(a)
p=suma
for i in range(n):
f=sum(a[:i])
p=min(p,abs(suma-2*f))
print(p) | n=int(eval(input()))
a=list(map(int,input().split()))
suma=sum(a)
f=0
p=suma-2*f
for i in a:
f+=i
p=min(p,abs(suma-2*f))
print(p) | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
Asum = sum(A)
sumdiflist = []
for i in range(N-1):
B = A[:i+1]
Bsum = sum(B) #前半の和
temp = Asum - Bsum #後半の和
sumdif = Bsum - temp
if(sumdif<0):
sumdif = -sumdif
sumdiflist.append(sumdif)
print((min(sumdiflist))) | N = int(eval(input()))
A = list(map(int, input().split()))
Asum = sum(A)
sumdiflist = []
temp = 0
for i in range(N-1):
temp += A[i]
sumdif = 2*temp - Asum
if(sumdif<0):
sumdif = -sumdif
sumdiflist.append(sumdif)
print((min(sumdiflist))) | p02854 |
#!/usr/bin/env python3
n, *a = list(map(int, open(0).read().split()))
s = sum(a)
r = [sum(a[:i + 1]) for i in range(n)]
print((min(abs(2 * i - s) for i in r)))
| #!/usr/bin/env python3
n, *a = list(map(int, open(0).read().split()))
s = sum(a)
r = [a[0]]
for i in range(1, n):
r.append(r[i - 1] + a[i])
print((min(abs(2 * i - s) for i in r)))
| p02854 |
#!/usr/bin/env python3
n, *a = list(map(int, open(0).read().split()))
s = sum(a)
r = [a[0]]
for i in range(1, n):
r.append(r[i - 1] + a[i])
print((min(abs(2 * i - s) for i in r)))
| #!/usr/bin/env python3
n, *a = list(map(int, open(0).read().split()))
r = [a[0]]
for i in range(1, n):
r.append(r[i - 1] + a[i])
print((min(abs(2 * i - r[-1]) for i in r)))
| p02854 |
N = int(eval(input()))
A_list = list(map(int, input().split()))
d = []
for i in range(1, len(A_list)):
left = sum(A_list[:i])
right = sum(A_list[i:])
temp = abs(left - right)
d.append(temp)
print((min(d)))
| N = int(eval(input()))
A_list = list(map(int, input().split()))
left = 0
A_sum = sum(A_list)
ans = A_sum
for a in A_list:
left += a
right = A_sum - left
ans = min(ans, abs(left-right))
print(ans) | p02854 |
n = int(eval(input()))
li = list(map(int,input().split()))
s = sum(li)
sum_li = []
for i,l in enumerate(li):
if i == 0:
sum_li.append(l)
continue
sum_li.append(sum_li[-1]+l)
all_li = []
for ii,ss in enumerate(sum_li):
if ii == len(sum_li)-1:
break
all_li.append(abs(s-2*ss))
#print(all_li)
print((min(all_li))) | n = int(eval(input()))
li = list(map(int,input().split()))
s = sum(li)
sum_li = []
left = 0
right = s
for i,l in enumerate(li):
if i == len(li)-1:
break
left += l
right -= l
sum_li.append(abs(left-right))
print((min(sum_li))) | p02854 |
def main():
N=int(eval(input()))
A=[int(_) for _ in input().split()]
ans = sum(A)-A[0]
for i in range(N):
ans = min(ans, abs(sum(A[:i]) - sum(A[i:])))
print(ans)
main() | def main():
N=int(eval(input()))
A=[int(_) for _ in input().split()]
left=0
right=sum(A)
ans=right
for i in range(N):
left+=A[i]
right-=A[i]
ans = min(ans, abs(left-right))
print(ans)
main() | p02854 |
n = int(eval(input()))
A = list(map(int, input().split()))
l = A.pop(0)
r = A.pop(-1)
for i in range(n-2):
if r<l:
r+=A.pop(-1)
else:
l+=A.pop(0)
print((abs(r-l))) | n = int(eval(input()))
A = list(map(int, input().split()))
l = A.pop(0)
idxl = 0
r = A.pop(-1)
idxr = -1
for i in range(n-2):
if r<l:
r+=A[idxr]
idxr -= 1
else:
l+=A[idxl]
idxl += 1
print((abs(r-l))) | p02854 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 10 ** 10
for i in range(1, len(a)):
ans = min(ans, abs(sum(a[:i]) - sum(a[i:])))
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
L = sum(a)
l = 0
i = 0
while l < L / 2:
l += a[i]
i += 1
print((min(abs(sum(a[:i - 1]) - sum(a[i - 1:])), abs(sum(a[:i]) - sum(a[i:])))))
| p02854 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
tmp = abs(sum(a[:i])-sum(a[i:]))
ans = tmp if i==0 else min(ans, tmp)
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
t = sum(a)
b = 0
for i in range(n):
b += a[i]
tmp = abs(2*b-t)
ans = tmp if i==0 else min(ans, tmp)
print(ans) | p02854 |
N = int(eval(input()))
A = [int(s) for s in input().split()]
minimum = sum(A)
for i, l in enumerate(A):
a = sum(A[:i])
b = sum(A[i:])
minimum = min(minimum, abs(a-b))
print(minimum) | N = int(eval(input()))
A = [int(s) for s in input().split()]
minimum = sum(A)
a = 0
b = minimum
for i, l in enumerate(A):
a += l
b -= l
minimum = min(minimum, abs(a-b))
print(minimum) | p02854 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
x = 0
y = 0
for i in range(0, n):
if x <= y:
x += a.pop(0)
else:
y += a.pop(-1)
print((abs(x - y))) | #!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
x = 0
y = 0
be = 0
af = -1
for i in range(0, n):
if x <= y:
x += a[be]
be += 1
else:
y += a[af]
af -= 1
print((abs(x - y))) | p02854 |
import sys
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
ave = sum(a)/2
for i in range(n):
cnt += a[i]
if cnt == ave:
print((0))
sys.exit()
elif cnt > ave:
x = ave -cnt +a[i]
if x >= cnt -ave:
x = cnt -ave
break
print((int(x*2))) | n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
ave = sum(a)/2
for i in range(n):
cnt += a[i]
if cnt >= ave:
ans = min(cnt*2-ave*2, ave*2-(cnt-a[i])*2)
break
print((int(ans))) | p02854 |
n=int(eval(input()))
a=list(map(int,input().split()))
sa=float("inf")
for i in range(n-1):
wa1=sum(a[0:1+i])
wa2=sum(a[1+i:])
temp=abs(wa1-wa2)
sa=min(sa,temp)
print(sa) | n=int(eval(input()))
a=list(map(int,input().split()))
sa=float("inf")
wa1=0
wa2=sum(a)
for i in range(n-1):
wa1+=a[i]
wa2-=a[i]
temp=abs(wa1-wa2)
sa=min(sa,temp)
print(sa) | p02854 |
n=int(eval(input()))
a=list(map(int,input().split()))
su=sum(a)
c=[]#[abs(sum(a[:i+1])-su/2)*2 for i in range(n)]
for i in range(n):
c+=[abs(sum(a[:i+1])-su/2)*2]
if sum(a[:i+1])-su/2 >0 or sum(a[:i+1])-su/2==0:
break
print((int(min(c)))) | n=int(eval(input()))
a=list(map(int,input().split()))
import itertools
b = list(itertools.accumulate(a))
for i in range(n):
b[i] = abs(2*b[i]-b[-1])
print((min(b))) | p02854 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
a = []
b = []
for i in range(len(A)):
if s % 2 != 0:
if sum(a) >= (s // 2) - 1 or i == N-1:
b.append(A[i])
else:
a.append(A[i])
else:
if sum(a) >= (s // 2) or i == N-1:
b.append(A[i])
else:
a.append(A[i])
ans1 = abs(sum(a)-sum(b))
ans2 = abs(sum(a[:-1])-sum(b+[a[-1]]))
print((min(ans1, ans2)))
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
a = 0
b = 0
tmp = []
for i in range(len(A)):
if s % 2 != 0:
if a >= (s // 2) - 1 or i == N-1:
b += A[i]
else:
a += A[i]
tmp.append(A[i])
else:
if a >= (s // 2) or i == N-1:
b += A[i]
else:
a += A[i]
tmp.append(A[i])
ans1 = abs(a-b)
ans2 = abs((a-tmp[-1]) - (b+tmp[-1]))
print((min(ans1, ans2)))
if __name__ == '__main__':
main()
| p02854 |
n = int(eval(input()))
A = list(map(int, input().split()))
cost_1 = 0
cost_2 = 0
cost_3 = 0
cost_4 = 0
S = sum(A)
S_1 = sum(A)
S_2 = sum(A)
S_3 = sum(A)
S_4 = sum(A)
half = S / 2
l = 0
i = 0
while l < half:
l += A[i]
i += 1
l_big = l
l_small = l - A[i-1]
if l_big == S - l:
print((0))
elif l_big - half < half - l_small:
l_1 = l_big
l_2 = l_big
while l_1 > S_1 - l_big:
l_1 -= 1
cost_1 += 1
while l_2 > S_2 - l_big:
l_2 -= 1
cost_2 += 1
print((min(cost_1, cost_2)))
else:
l_3 = l_small
l_4 = l_small
while l_3 < S_3 - l_small:
l_3 += 1
cost_3 += 1
while l_4 < S_4 - l_small:
l_4 += 1
cost_4 += 1
print((min(cost_3, cost_4))) | n = int(eval(input()))
A = list(map(int, input().split()))
B = A[::-1]
S = [0] * n
S[0] = A[0]
T = [0] * n
T[0] = B[0]
ans = float('inf')
for i in range(1, n):
S[i] = S[i - 1] + A[i]
T[i] = T[i - 1] + B[i]
T = T[::-1]
ans = 2020202020 + 1
for i in range(n):
diff = abs(S[i] - T[i] - A[i])
ans = min(ans, diff)
print(ans) | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
tmp_x = -1
tmp_x_diff = -1
for i in range(N - 1):
sum1 = sum(A[:i + 1])
sum2 = sum(A[i + 1:])
diff = abs(sum1 - sum2)
if tmp_x_diff == -1 or diff < tmp_x_diff:
tmp_x = i
tmp_x_diff = diff
print(tmp_x_diff)
| N = int(eval(input()))
A = list(map(int, input().split()))
cumsum = [0]
for i in range(N):
cumsum.append(cumsum[-1] + A[i])
tmp_x = -1
tmp_x_diff = -1
for i in range(N - 1):
sum1 = cumsum[i + 1]
sum2 = cumsum[-1] - cumsum[i + 1]
diff = abs(sum2 - sum1)
if tmp_x_diff == -1 or diff < tmp_x_diff:
tmp_x = i
tmp_x_diff = diff
print(tmp_x_diff)
| p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
ar =[]
for i in range(1, N):
ar.append(abs(sum(A[:i]) - sum(A[i:])))
print((min(ar))) | N = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
av = s / 2
x = 0
y = 0
for i in range(N):
x += A[i]
if x < av < x +A[i+1]:
y = s - x - A[i+1]
if x > y:
print((A[i+1]-x+y))
else:
print((A[i+1]-y+x))
elif x == av:
print((0)) | p02854 |
def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
s = [0] * (N + 1)
for i in range(0, N):
s[i+1] = s[i] + A[i]
ans = (1 << 63) - 1
for j in range(1, N):
left = s[j] - s[0]
right = s[N] - s[j]
ans = min(ans, abs(right - left))
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
from itertools import accumulate
acc = [a for a in accumulate([0] + A)]
ans = acc[-1]
for i in range(1, N+1):
a = acc[i]
b = acc[N] - acc[i]
v = abs(a-b)
ans = min(ans, v)
print(ans)
if __name__ == '__main__':
main()
| p02854 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
sum1 = []
sum2 = []
s = sum(a)
ls = []
for i in range(1,n):
sum1.append(sum(a[:i]))
sum2.append(s - sum(a[:i]))
for i in range(n-1):
ls.append(abs(sum1[i] - sum2[i]))
print((min(ls)))
| n = int(eval(input()))
a = [int(i) for i in input().split()]
sum1 = [a[0]]
sum2 = [sum(a)-a[0]]
s = sum(a)
ls = []
for i in range(1,n):
sum1.append(sum1[i-1]+a[i])
sum2.append(s - sum1[i])
for i in range(n-1):
ls.append(abs(sum1[i] - sum2[i]))
print((min(ls)))
| p02854 |
import sys
N = int(eval(input()))
A = list(map(int, sys.stdin.readline().rsplit()))
S = [0] * (N + 1)
s = sum(A)
for i in range(N):
S[i + 1] += S[i] + A[i]
mini = 10 ** 18
for i in range(1, N + 1):
mini = min(mini, abs(S[N] - 2 * S[i]))
print(mini)
| import sys, itertools
N = int(eval(input()))
A = list(map(int, sys.stdin.readline().rsplit()))
S = list(itertools.accumulate(A))
mini = 10 ** 18
for i in range(N):
mini = min(mini, abs(S[N - 1] - 2 * S[i]))
print(mini)
| p02854 |
'''
参考
https://qiita.com/c-yan/items/f7c99c8f8ec418a58c42
棒の全長をL、切断箇所をCとすると、かかるコストは|2C-L|となる
（左端から切断箇所までの長さを2倍し、元の棒の全長を引いたものの絶対値）
∵
・CがL/2よりも左にある場合（=棒の左端からCまでの長さのほうが短い）
⇒Cよりも左側に2C-L足すか、右側を2C-L減らす
・CがL/2よりも右にある場合（=棒の左端からCまでの長さのほうが長い）
⇒Cよりも左側を2C-L減らすか、右側に2C-L足す
与えられたリストAのうち、どの地点をCとするかは
リストAの先頭の要素からN-1個の要素をそれぞれ調べ、
先頭要素から現在の要素までの合計（累積和）を格納するリストを別途作成、
そのリストに対して|2C-L|が最小となるケースを調べる
'''
N = int(eval(input()))
A = list(map(int, input().split()))
L = sum(A)
tmp = []
for i in range(N):
tmp.append(sum(A[:i+1]))
cost = min(abs(c*2-L) for c in tmp)
print(cost)
| '''
参考
https://qiita.com/c-yan/items/f7c99c8f8ec418a58c42
棒の全長をL、切断箇所をCとすると、かかるコストは|2C-L|となる
（左端から切断箇所までの長さを2倍し、元の棒の全長を引いたものの絶対値）
∵
・CがL/2よりも左にある場合（=棒の左端からCまでの長さのほうが短い）
⇒Cよりも左側に2C-L足すか、右側を2C-L減らす
・CがL/2よりも右にある場合（=棒の左端からCまでの長さのほうが長い）
⇒Cよりも左側を2C-L減らすか、右側に2C-L足す
与えられたリストAのうち、どの地点をCとするかは
リストAの先頭の要素からN-1個の要素をそれぞれ調べ、
先頭要素から現在の要素までの合計（累積和）を格納するリストを別途作成、
そのリストに対して|2C-L|が最小となるケースを調べる
'''
N = int(eval(input()))
A = list(map(int, input().split()))
L = sum(A)
#tmp = []
tmp = A[:-1]
for i in range(1, N-1):
# tmp.append(sum(A[:i+1])) # 実行時間超過してしまうためコメントアウト
tmp[i] += tmp[i-1]
cost = min(abs(c*2-L) for c in tmp)
print(cost)
| p02854 |
def resolve():
N = int(eval(input()))
A = list(map(int, input().split()))
diff = 10 ** 10
for i in range(N):
partA = sum(A[:i])
partB = sum(A[i:])
diff = min(diff, abs(partA-partB))
print(diff)
return
resolve() | def resolve():
N = int(eval(input()))
A = list(map(int, input().split()))
diff = 10 ** 10
partA = 0
partB = sum(A)
for i in range(N):
diff = min(diff, abs(partA-partB))
partA += A[i]
partB -= A[i]
print(diff)
return
resolve() | p02854 |
n=int(eval(input()))
L=list(map(int,input().split()))
sumL=sum(L)
ans=2020202020
tmp1=0
tmp2=0
for i in range(n):
for j in range(i):
tmp1+=L[j]
tmp2=sumL-tmp1
ans=min(ans,abs(tmp1-tmp2))
tmp1=0
tmp2=0
print(ans) | n=int(eval(input()))
L=list(map(int,input().split()))
sumL=[0 for _ in range(n)]
S=sum(L)
for i in range(n):
if i==0:
sumL[i]=L[i]
else:
sumL[i]=sumL[i-1]+L[i]
ans=2020202020
tmp1=0
tmp2=0
for i in range(n):
tmp1=sumL[i]
tmp2=S-sumL[i]
ans=min(ans,abs(tmp1-tmp2))
print(ans) | p02854 |
n = int(eval(input()))
a = list(map(int, input().split()))
h = []
for i in range(n):
h.append(abs(sum(a[:i])-sum(a[i:])))
print((min(h))) | n = int(eval(input()))
a = list(map(int, input().split()))
result = [[a[0], sum(a[1:])]]
for i in range(1, n):
result.append([result[-1][0]+a[i], result[-1][1]-a[i]])
h = []
for i in range(len(result)):
h.append(abs(result[i][0]-result[i][1]))
print((min(h))) | p02854 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
def main():
n = int(input().strip())
v = list(map(int, input().strip().split()))
a = [0] * n
b = [0] * n
for i in range(n):
if i == 0:
a[i] = v[i]
continue
a[i] = a[i-1] + v[i]
for i in reversed(list(range(n))):
if i == n-1:
b[i] = v[i]
continue
b[i] = b[i+1] + v[i]
ans = INF
for i in range(n-1):
ans = min(ans, abs(a[i] - b[i+1]))
print(ans)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
def calc_sum(v, n):
a = [0] * (n)
for i in range(n):
if i == 0:
a[i] = v[i]
continue
a[i] = a[i-1] + v[i]
return a
def main():
n = int(input().strip())
v = list(map(int, input().strip().split()))
a = calc_sum(v, n)
b = list(reversed(calc_sum(list(reversed(v)), n)))
ans = INF
for i in range(n-1):
ans = min(ans, abs(a[i] - b[i+1]))
print(ans)
if __name__ == '__main__':
main()
| p02854 |
n = int(eval(input()))
a = list(map(int,input().split()))
tmp = 0
for i in range(len(a)):
tmp += a[i]
if tmp >= (sum(a))//2:
break
print((min((abs((sum(a)-tmp)-tmp)),abs((sum(a)-(tmp-a[i]))-(tmp-a[i])))))
| n = int(eval(input()))
a = list(map(int,input().split()))
suma = sum(a)
tmp = 0
for i in range(len(a)):
tmp += a[i]
if tmp >= suma//2:
break
print((min((abs((suma-tmp)-tmp)),abs((suma-(tmp-a[i]))-(tmp-a[i])))))
| p02854 |
n = int(eval(input()))
a = list(map(int,input().split()))
L = sum(a)
nagasa = 0
ans = 0
i=0
while(i < len(a)):
nagasa += a[i]
if nagasa == L/2:
break
elif nagasa > L/2:
sa1 = L/2 - sum(a[0:i])
sa2 = nagasa - L/2
if sa1 < sa2:
# 後ろを減らす
a[i] -= 1
else:
# 前を減らす
a[i-1] -= 1
L = sum(a)
ans += 1
i = 0
nagasa = 0
else:
i+=1
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
L = sum(a)
nagasa = 0
ans = 0
i=0
for i in range(n):
nagasa += a[i]
if nagasa*2 >= L:
ans = min(abs(L - (nagasa *2)), abs(L - ((nagasa-a[i])*2)))
break
print(ans)
| p02854 |
N = int(eval(input()))
length = [int(i) for i in input().split()]
pos = []
for a in range(len(length)+1):
x = sum(length[:a])
y = sum(length[a:])
pos.append(max(x,y) - min(x,y))
# print("pos " + str(a)+":",sum(length[:a]), sum(length[a:]))
# print(pos)
print((min(pos))) | N = int(eval(input()))
length = [int(i) for i in input().split()]
pos = []
s1 = sum(length)
s2 = 0
for a in range(len(length)):
pos.append(max(s1,s2) - min(s1,s2))
s1 -= length[a]
s2 += length[a]
# print("pos " + str(a)+":",sum(length[:a]), sum(length[a:]))
# print(pos)
print((min(pos))) | p02854 |
N = int(eval(input()))
A = list(map(int,input().split()))
diff = 2020202020 * 200000 + 1
tot = sum(A)
for i in range(N):
temp1 = A[:i+1]
# temp2 = A[i+1:]
temp3 = abs(tot - 2 * sum(temp1))
if temp3 <= diff:
# mid = i
diff = temp3
else:
break
print(diff)
| N = int(eval(input()))
A = list(map(int,input().split()))
diff = 2020202020 * 200000 + 1
tot = sum(A)
temp1 = 0
for i in range(N):
temp1 += A[i]
# temp2 = A[i+1:]
temp3 = abs(tot - 2 * temp1)
if temp3 <= diff:
# mid = i
diff = temp3
else:
break
print(diff)
| p02854 |
n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
i=0
while cnt<sum(a)//2:
temp=cnt
cnt+=a[i]
i+=1
print((min(abs(sum(a)-temp*2),abs(sum(a)-cnt*2)))) | n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
i=0
s=sum(a)
while cnt<s//2:
temp=cnt
cnt+=a[i]
i+=1
print((min(abs(sum(a)-temp*2),abs(sum(a)-cnt*2)))) | p02854 |
num=int(eval(input()))
mm=[int(s) for s in input().split()]
total=sum(mm)
count=0
for j,i in enumerate(mm):
count+=i
if count>=total//2:
flag=j
break
p=0
q=sum([mm[i+1] for i in range(flag,len(mm)-1)])
while True:
if count>q:
q+=1
p+=1
else:
break
mm.reverse()
count=0
for j,i in enumerate(mm):
count+=i
if count>=total//2:
flag=j
break
p2=0
q=sum([mm[i+1] for i in range(flag,len(mm)-1)])
while True:
if count>q:
q+=1
p2+=1
else:
break
if p>=p2:
print(p2)
else:
print(p) | num=int(eval(input()))
mm=[int(s) for s in input().split()]
total=sum(mm)
count=0
for j,i in enumerate(mm):
count+=i
if count>=total//2:
flag=j
break
q=sum(mm[flag+1:])
p=count-q
mm.reverse()
count=0
for j,i in enumerate(mm):
count+=i
if count>=total//2:
flag=j
break
q=sum(mm[flag+1:])
p2=count-q
if p>=p2:
print(p2)
else:
print(p) | p02854 |
n = int(eval(input()))
a_inputs = list(map(int,input().split()))
len_bar = sum(a_inputs)
gap = float('inf')
for i in range(n-1):
g = abs(len_bar-2*sum(a_inputs[:i+1]))
if g<gap:
gap=g
print(gap)
| n = int(eval(input()))
a_inputs = list(map(int,input().split()))
len_bar = sum(a_inputs)
cum_bar = [0]*n
cum_bar[0]=a_inputs[0]
for i in range(1,n):
cum_bar[i]=cum_bar[i-1]+a_inputs[i]
gap = float('inf')
for i in range(n-1):
g = abs(len_bar-2*cum_bar[i])
if g<gap:
gap=g
print(gap)
| p02854 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=float("inf")
s=sum(A)
k=0
for i in range(N-1):
k+=A[i]
ans=min(ans,abs(s-2*k))
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
s=ans=sum(A)
k=0
for i in range(N-1):
k+=A[i]
ans=min(ans,abs(s-2*k))
print(ans) | p02854 |
n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
c = a[-1]
for i in range(n):
c = min(c, abs(a[-1]-a[i]*2))
print(c) | n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
c = a[-1]
for i in range(n):
p = abs(a[-1]-a[i]*2)
if c > p:
c = p
print(c) | p02854 |
n = int(eval(input()))
A = list(map(int, input().split()))
Asum = sum(A)
ans = float('inf')
for i in range(len(A)-1):
s = sum(A[:i+1])
t = Asum - s
ans = min(ans, abs(s-t))
print(ans) | n = int(eval(input()))
A = list(map(int, input().split()))
cum = [0]
for a in A:
cum.append(cum[-1]+a)
ans = float('inf')
for i in range(n-1):
s = cum[i+1]
t = cum[-1] - s
ans = min(ans, abs(s-t))
print(ans) | p02854 |
n = int(eval(input()))
stick = list(map(int, input().split()))
total = sum(stick)
mid = total // 2
cum = 0
midi = 0
for i, block in enumerate(stick):
cum += block
if cum >= mid:
midi = i
break
l1 = sum(stick[:midi])
r1 = sum(stick[midi:])
diff1 = abs(l1 - r1)
l2 = l1 + stick[midi]
r2 = r1 - stick[midi]
diff2 = abs(l2 - r2)
print((min(diff1, diff2))) | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
stick = list(map(int, input().split()))
total = sum(stick)
mid = total // 2
cum = 0
midi = 0
for i, block in enumerate(stick):
cum += block
if cum >= mid:
midi = i
break
l1 = sum(stick[:midi])
r1 = sum(stick[midi:])
diff1 = abs(l1 - r1)
l2 = l1 + stick[midi]
r2 = r1 - stick[midi]
diff2 = abs(l2 - r2)
print((min(diff1, diff2)))
main() | p02854 |
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
stick = list(map(int, input().split()))
total = sum(stick)
mid = total // 2
cum = 0
midi = 0
for i, block in enumerate(stick):
cum += block
if cum >= mid:
midi = i
break
l1 = sum(stick[:midi])
r1 = sum(stick[midi:])
diff1 = abs(l1 - r1)
l2 = l1 + stick[midi]
r2 = r1 - stick[midi]
diff2 = abs(l2 - r2)
print((min(diff1, diff2)))
main() | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
stick = list(map(int, input().split()))
total = sum(stick)
mid = total // 2
cum = 0
midi = 0
for i, block in enumerate(stick):
cum += block
if cum >= mid:
midi = i
break
l1 = cum
r1 = total - l1
diff1 = abs(l1 - r1)
l2 = l1 - stick[midi]
r2 = r1 + stick[midi]
diff2 = abs(l2 - r2)
print((min(diff1, diff2)))
main() | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
cand = []
for i in range(1, N):
diff = abs(sum(A[:i]) - sum(A[i:]))
cand.append(diff)
print((min(cand))) | N = int(eval(input()))
A = list(map(int, input().split()))
cand = []
left = 0
right = sum(A)
for i in range(N-1):
left += A[i]
right -= A[i]
diff = abs(left - right)
cand.append(diff)
print((min(cand))) | p02854 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=float('inf')
for i in range(n):
d=abs(sum(a[0:i+1])-sum(a[i+1:n]))
ans=min(ans,d)
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=float('inf')
s=sum(a)
res=0
for i in range(n):
res+=a[i]
s-=a[i]
ans=min(ans,abs(s-res))
print(ans) | p02854 |
n=int(eval(input()))
r=list(map(int,input().split()))
if n==2:
print((abs(r[0]-r[1])))
exit()
border=sum(r)//2+1
result="INF"
for i in range(1,n):
#print(r[:i],r[i:])
if result=="INF":
result=abs(sum(r[:i])-sum(r[i:]))
else:
result=min(result,abs(sum(r[:i])-sum(r[i:])))
if sum(r[:i])>=border:
print(result)
exit()
print(result)
| n=int(eval(input()))
r=list(map(int,input().split()))
if n==2:
print((abs(r[0]-r[1])))
exit()
#print(r)
temp=sum(r)
goukei=0
for item in r:
if goukei+item>=temp/2.0:
if abs(temp-goukei-goukei)<=abs((temp-(goukei+item))-(goukei+item)):
print((abs(temp-goukei-goukei)))
else:
print((abs((temp-(goukei+item))-(goukei+item))))
exit()
goukei=goukei+item
goukei=goukei-item
print((abs(temp-(goukei-item))))
| p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
B = [0]
for i in range(N):
B.append(B[i] + A[i])
ans = float('inf')
for i in range(1, N):
ans = min(ans, abs(s-(2*B[i])))
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
B = [0]
for i in range(N):
B.append(B[i] + A[i])
ans = float('inf')
for i in range(1, N):
_ans = ans
ans = min(ans, abs(B[i] - (s - B[i])))
if ans > _ans:
break
print(ans)
| p02854 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 100000000000000
for i in range(n):
if sum(a[:i]) == sum(a[i:]):
ans = 0
break
elif ans > abs(sum(a[:i]) - sum(a[i:])):
ans = abs(sum(a[:i]) - sum(a[i:]))
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = sum(a)
al = ans
mod = 0
for i in range(n):
if mod + a[i] == al - a[i]:
ans = 0
break
elif ans > abs(mod - al + 2*a[i]):
ans = abs(mod - al + 2*a[i])
mod += a[i]
al -= a[i]
else:
mod += a[i]
al -= a[i]
print(ans) | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = float('inf')
sum_A = sum(A)
CumSum = 0
for i in range(N-1):
CumSum = CumSum + A[i]
ans = min(ans,(abs((sum_A - CumSum)-(CumSum))))
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = (2020202020)**100
sum_A = sum(A)
hoge = 0
for i in range(N-1):
hoge = hoge + A[i]
ans = min(ans,(abs(sum_A - (hoge*2))))
print(ans)
| p02854 |
n = int(eval(input()))
a = list(map(int,input().split()))
m = 10**10
for i in range(n):
x = sum(a[:i])
y = sum(a[i:])
m = min(abs(x-y),m)
print(m) | n = int(eval(input()))
a = list(map(int,input().split()))
m = 10**10
x = sum(a)
y = 0
for i in range(n):
x -= a[i]
y += a[i]
m = min(abs(x-y),m)
print(m) | p02854 |
n=int(eval(input()))
a=list(map(int,input().split()))
c=0
d=float("INF")
for i in range(n):
c+=a[i]
d=min(d,abs(sum(a)-2*c))
print(d)
| from itertools import accumulate as ac
n=int(eval(input()))
a=list(ac(list(map(int,input().split()))))
d=float("INF")
for i in range(n):
d=min(d,abs(a[-1]-2*a[i]))
print(d) | p02854 |
n=int(eval(input()))
A=list(map(int,input().split()))
sa=float('inf')
for i in range(n):
sa=min(sa,abs(sum(A[:i])-sum(A[i:])))
print(sa)
| n=int(eval(input()))
A=list(map(int,input().split()))
l=0
r=sum(A)
ans=float('inf')
for i in range(n):
l+=A[i]
r-=A[i]
ans=min(ans,abs(l-r))
print(ans)
| p02854 |
N = int(eval(input()))
A = list(map(int,input().split()))
tot = sum(A)
B = [0 for _ in range(N-1)]
cnt = A[0]
for i in range(1,N):
B[i-1] = abs(tot-2*cnt)
cnt += A[i]
print((min(B))) | N = int(eval(input()))
A = list(map(int,input().split()))
tot = sum(A)
B = [0 for _ in range(N+1)]
for i in range(1,N+1):
B[i] = B[i-1]+A[i-1]
cmin = abs(tot-2*B[1])
for i in range(2,N):
cmin = min(cmin,abs(tot-2*B[i]))
print(cmin) | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
A_sum = 0
for i in range(N):
A_sum += A[i]
min = A_sum
for i in range(N):
AA_sum = 0
for j in range(i):
AA_sum += A[j]
AA_sa = 2*AA_sum - A_sum
if AA_sa < 0:
AA_sa = -1 * AA_sa
if AA_sa < min:
min = AA_sa
print(min) | N = int(eval(input()))
A = list(map(int, input().split()))
Asum = 0
A_sum = []
for i in range(N):
Asum += A[i]
A_sum.append(Asum)
for i in range(N):
A_sum[i] = 2*A_sum[i] - Asum
if A_sum[i] < 0:
A_sum[i] = -1 * A_sum[i]
print((min(A_sum))) | p02854 |
N = int(eval(input()))
a = list(map(int, input().split()))
mindif = 1e15
minidx=0
for i in range(1,N):
dif = abs(sum(a[:i])-sum(a[i:]))
if dif<mindif:
mindif = dif
minidx = i
else:
break
print(mindif) | N = int(eval(input()))
a = list(map(int, input().split()))
r = sum(a)
ra = 0
result = 1e30
for i in range(0,N):
ra += a[i]
r -= a[i]
result = min(result, abs(ra-r))
print((int(result))) | p02854 |
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
mid = 0
diff = float("inf")
for i in range(1, n):
if abs(sum(A[:i]) - sum(A[i:])) <= diff:
diff = abs(sum(A[:i]) - sum(A[i:]))
mid = i
front = A[:mid]
back = A[mid:]
print((abs(sum(front)-sum(back))))
resolve() | def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
mid = 0
diff = float("inf")
total = sum(A)
p = 0
# print(total)
for i in range(n):
# print("i:",i, "total:", total, "p:", p, "diff:", diff)
if abs(total-p) < diff:
diff = abs(total - p)
mid = i
p += A[i]
total -= A[i]
front = A[:mid]
back = A[mid:]
print((abs(sum(front)-sum(back))))
resolve() | p02854 |
# For taking integer inputs.
import math
from decimal import Decimal
from itertools import permutations
def inp():
return(int(eval(input())))
# For taking List inputs.
def inlist():
return(list(map(int, input().split())))
# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
s = eval(input())
return(list(s[:len(s)]))
# For taking space seperated integer variable inputs.
def invr():
return(list(map(int, input().split())))
n = inp()
a = inlist()
D = 10000000000000000
mid = 0
for i in range(1, n):
s1 = sum(a[:i])
s2 = sum(a[i:])
d = abs(s1 - s2)
if d < D:
mid = i
D = d
s1 = sum(a[:mid])
s2 = sum(a[mid:])
res = abs(s1-s2)
print(res)
| # For taking integer inputs.
import math
from decimal import Decimal
from itertools import permutations
def inp():
return(int(eval(input())))
# For taking List inputs.
def inlist():
return(list(map(int, input().split())))
# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
s = eval(input())
return(list(s[:len(s)]))
# For taking space seperated integer variable inputs.
def invr():
return(list(map(int, input().split())))
n = inp()
a = inlist()
pref = [0] * (n)
suf = [0] * n
pref[0] = a[0]
suf[n-1] = a[n-1]
j = n - 2
for i in range(1, n):
pref[i] = a[i] + pref[i-1]
suf[j] = a[j] + suf[j+1]
j -= 1
D = 10000000000000000
for i in range(0, n-1):
s1 = pref[i]
s2 = suf[i+1]
d = abs(s1 - s2)
if d < D:
D = d
print(D)
| p02854 |
N = int(eval(input()))
a=list(map(int,input().split()))
ans=2020202020
for i in range(1,N):
mae=sum(a[:i])
ato=sum(a)-mae
ans=min(ans,abs(mae-ato))
print(ans) | N = int(eval(input()))
a=list(map(int,input().split()))
ans=2020202020
s=sum(a)
mae=a[0]
for i in range(1,N):
mae+=a[i]
ato=s-mae
if mae-ato>0:
ans=min(abs(sum(a[:i])-sum(a[i:])),abs(sum(a[:i+1])-sum(a[i+1:])))
break
else:
ans=min(ans,abs(mae-ato))
print(ans) | p02854 |
n=int(eval(input()))
A=list(map(int,input().split()))
m=float('inf')
s=sum(A)
for i in range(len(A)):
m=min(m,abs(2*sum(A[0:i])-s))
print(m) | n=int(eval(input()))
A=list(map(int,input().split()))
ans=float('INF')
sa=[0]
for i,a in enumerate(A):
sa.append(sa[i]+a)
for i in range(n+1):
ans=min(ans,abs(sa[i]-(sa[-1]-sa[i])))
print(ans) | p02854 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
ans = float("inf")
for i in range(N):
ans = min(ans, abs(sum(A[:i])-sum(A[i:])))
print(ans) | N = int(eval(input()))
A = [int(i) for i in input().split()]
l = sum(A)
ans = float("inf")
t = 0
for i in range(N-1):
t += A[i]
ans = min(ans,abs(l-2*t))
#print("t,ans",t,ans)
print(ans)
| p02854 |
n,*a=list(map(int,open(0).read().split()))
s=sum(a)
for i in range(1,n):a[i]+=a[i-1]
print((min(abs(t*2-s)for t in a))) | n,*a=list(map(int,open(0).read().split()))
s=sum(a)
c=0
m=[]
for b in a:c+=b;m+=abs(c+c-s),
print((min(m))) | p02854 |
_,a=open(0)
*a,=list(map(int,a.split()))
s=sum(a)
c=0
m=9e9
for b in a:c+=b;m=min(m,abs(c+c-s))
print(m) | _,a=open(0)
*a,=list(map(int,a.split()))
s=m=sum(a)
c=0
for b in a:c+=b;m=min(m,abs(c+c-s))
print(m) | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
total = sum(A)
mid = total // 2
sum_left, sum_left2 = 0, 0
seperation_i = 0
for i, l in enumerate(A[:-1]):
sum_left += l
if sum_left >= mid:
seperation_i = i
sum_left2 = sum_left - l
break
sum_right, sum_right2 = sum(A[seperation_i + 1:]), sum(A[seperation_i:])
print((min(abs(sum_right - sum_left), abs(sum_right2 - sum_left2)))) | N = int(eval(input()))
A = list(map(int, input().split()))
total = sum(A)
mid = total // 2
sum_left, sum_left2 = 0, 0
seperation_i = 0
# for i, l in enumerate(A[:-1]):
for i, l in enumerate(A):
sum_left += l
if sum_left >= mid:
seperation_i = i
sum_left2 = sum_left - l
break
sum_right, sum_right2 = sum(A[seperation_i + 1:]), sum(A[seperation_i:])
ans = min(abs(sum_left - sum_right), abs(sum_left2 - sum_right2))
print(ans) | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
total = sum(A)
mid = total // 2
sum_left, sum_left2 = 0, 0
sep_idx = 0
for i, l in enumerate(A):
sum_left += l
if sum_left >= mid:
sep_i = i
sum_left2 = sum_left - l
break
sum_right, sum_right2 = sum(A[sep_i + 1:]), sum(A[sep_i:])
print((min(abs(sum_right - sum_left), abs(sum_right2 - sum_left2)))) | N = int(eval(input()))
A = list(map(int, input().split()))
total = sum(A)
mid = total // 2
sum_left, sum_left2 = 0, 0
sep_i = 0
for i, a in enumerate(A):
sum_left += a
if sum_left >= mid:
sep_i = i
sum_left2 = sum_left - a
break
sum_right, sum_right2 = sum(A[sep_i + 1:]), sum(A[sep_i:])
print((min(abs(sum_right - sum_left), abs(sum_right2 - sum_left2)))) | p02854 |
n = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
p = 10**20
t = 0
for i in range(n):
t += A[i]
p = min(p, abs(s-t*2))
if 2*t > sum(A):
break
print(p) | n = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
p = 10**20
t = 0
for i in range(n):
t += A[i]
p = min(p, abs(s-t*2))
print(p) | p02854 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
st = sum(a)
t = 0
abs_t = 10 ** 10
for i in range(n-1):
t += a[i]
st -= a[i]
abs_t = min(abs_t, abs(st - t))
print(abs_t)
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
sa = sum(a)
t = 0
mt = 10 ** 20
for v in a:
t += v
mt = min(mt, abs(sa - t - t))
print(mt)
if __name__ == '__main__':
solve()
| p02854 |
N = int(eval(input()))
A = input().split()
for a in A:
A[A.index(a)] = int(a)
# print(sum(A))
# mid = N // 2
# print(A[:mid])
# print(A[mid:])
left = A[0]
right = A[-1]
front = 1
back = 1
for _ in range(N-2):
if left > right:
right += A[-1 - back]
back += 1
else:
left += A[front]
front += 1
# print(left)
# print(right)
# print()
# print(left)
# print(right)
# if N % 2 == 1:
# if right > left:
# left += A[i]
# i += 1
# else:
# right += A[-1 - i]
# print(left)
# print(right)
print((abs(left-right)))
| N = int(eval(input()))
# A = input().split()
A = list(map(int, input().split()))
# f = open("tmp.text")
# A = list(map(int, f.read().split()))
# left = 0
# right = N - 1
# tmp = 10**9
# while True:
# # print(left)
# # print(right)
# mid = (left + right) // 2
# # print("mid: " + str(mid))
# lnum = A[:mid+1]
# rnum = A[mid+1:]
# # print(lnum)
# # print(rnum)
# new = abs(sum(lnum) - sum(rnum))
# if tmp == new:
# break
# if tmp > new:
# tmp = new
# if lnum > rnum:
# right = mid
# # print("tmp: "+str(tmp))
# # input()
# if left == right:
# break
# print(tmp)
left = A[0]
right = A[-1]
front = 1
back = 1
for _ in range(N-2):
if left > right:
right += A[-1 - back]
back += 1
else:
left += A[front]
front += 1
print((abs(left-right)))
| p02854 |
n = int(eval(input()))
s = list(map(int,input().split()))
ans = 10**10
for i in range(n):
ans = min(ans,(abs(sum(s[:i]) - sum(s[i:]))))
print(ans) | n = int(eval(input()))
s = list(map(int,input().split()))
ans = 2020202020
a = 0
b = sum(s)
for i in range(n):
a += s[i]
b -= s[i]
ans = min(ans,abs(a-b))
print(ans) | p02854 |
n = int(eval(input()))
a = list(map(int, input().split()))
i, s = 0, 0
while True:
s += a[i]
i += 1
if s >= sum(a) // 2:
break
b = a[::-1]
j, t = 0, 0
while True:
t += b[j]
j += 1
if t >= sum(a) // 2:
break
print((min(s-(sum(a)-s), t-(sum(a)-t)))) | n = int(eval(input()))
A = list(map(int, input().split()))
total = sum(A)
s = 0
for a in A:
s += a
if 2 * s >= total:
break
B = A[::-1]
t = 0
for b in B:
t += b
if 2 * t >= total:
break
print((min(2*s-total, 2*t-total))) | p02854 |
n = int(eval(input()))
a = list(map(int, input().split()))
x = 10 ** 10
for i in range(1, n):
x = min(x, abs(sum(a[:i])-sum(a[i:])))
print(x) | from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
l = list(accumulate(a))
x = 10 ** 10
for i in range(n-1):
x = min(x, abs(l[i]*2-l[-1]))
print(x) | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
anslist = []
for i in range(N):
lefts = sum(A[:i])
rights = sum(A[i:])
anslist.append(abs(lefts - rights))
print((min(anslist))) | N = int(eval(input()))
A = list(map(int, input().split()))
anslist = []
lefts = 0
rights = sum(A)
for i in range(N):
lefts += A[i]
rights -= A[i]
anslist.append(abs(lefts - rights))
print((min(anslist))) | p02854 |
n = int(eval(input()))
a = list(map(int,input().split()))
l1 = 0
for i in range(n):
l1 += a[i]
if l1> sum(a)//2:break
r1 = sum(a) - l1
l2 = l1 -a[i]
r2 = sum(a) - l2
ans = min(abs(r1-l1),abs(r2-l2))
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
s = sum(a)
l1 = 0
for i in range(n):
l1 += a[i]
if l1> s//2:break
r1 = s - l1
l2 = l1 -a[i]
r2 = s - l2
ans = min(abs(r1-l1),abs(r2-l2))
print(ans) | p02854 |
n =int(eval(input()))
a=list(map(int, input().split()))
m=0
s=[]
for i in range(len(a)):
m+=a[i]
if len(s)!=0:
mins=min(s)
s.append(abs(sum(a)-m*2))
if len(s)!=1 and mins<s[i]:
break
print(mins) | n =int(eval(input()))
a=list(map(int, input().split()))
m=0
s=[]
suma=sum(a)
for i in range(len(a)):
m+=a[i]
s.append(abs(suma-m*2))
print((min(s))) | p02854 |
n = int(eval(input()))
a = list(map(int, input().split()))
m = 0
s = []
for i in range(len(a)):
m += a[i]
s.append(abs(sum(a) - m * 2))
print((min(s)))
| n = int(eval(input()))
a = list(map(int, input().split()))
m = 0
s = []
suma = sum(a)
for i in range(len(a)):
m += a[i]
s.append(abs(suma - m * 2))
print((min(s)))
| p02854 |
import sys
n = int(eval(input()))
a = list(map(int, input().split()))
tmp=sys.maxsize
for i in range(n+1):
if tmp > abs(sum(a[:i])-sum(a[i:])):
tmp = abs(sum(a[:i])-sum(a[i:]))
else:
print(tmp)
exit() | import sys
n = int(eval(input()))
a = list(map(int, input().split()))
tmp=sys.maxsize
s = sum(a)
t = 0
for i in range(n):
t += a[i]
tmp = min(tmp,abs(s-t*2))
print(tmp) | p02854 |
N = int(eval(input()))
A = list(map(int, input().split()))
total = sum(A)
costs = [0 for x in range(N-1)]
mem = [0 for x in range(N-1)]
def calcsum(i):
if mem[i] == 0:
mem[i] == calcsum(i - 1) + A[i-1]
return mem[i]
for i in range(1, N):
costs[i-1] = abs(total - 2 * sum(A[:i]))
print((min(costs))) | N = int(eval(input()))
A = list(map(int, input().split()))
total = sum(A)
costs = [0 for x in range(N-1)]
mem = [0 for x in range(N-1)]
for i in range(1, N):
if i == 1:
mem[i-1] = A[i-1] * 2
else:
mem[i-1] = mem[i-2] + A[i-1] * 2
costs[i-1] = abs(total - mem[i-1])
print((min(costs)))
| p02854 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
c = 0
for i in range(n):
if (c + a[i] >= sum(a)/2):
d = i
break
c += a[i]
print((min(sum(a)-2*c,2*(c+a[d])-sum(a))))
| n = int(eval(input()))
a = [int(i) for i in input().split()]
c = 0
k = sum(a)
for i in range(n):
if (c + a[i] >= k/2):
d = i
break
c += a[i]
print((min(k-2*c,2*(c+a[d])-k)))
| p02854 |
N=int(eval(input())) #数値入力 「N」だけの入力のとき
A=list(map(int, input().split())) #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# from functools import lru_cache
# @lru_cache(maxsize=100000)
# 一度差を出してから，どんどんi-1, i+1の和で縮めていく．
def check():
for i in range(N):
if sum(A[:i]) == sum(A[i:]):
return True
return False
from functools import lru_cache
@lru_cache(maxsize=100000)
def get_dist(i):
return abs(sum(A[:i]) - sum(A[i:]))
def check_distance():
ret = []
for i in range(1, N):
tmp_a = get_dist(i)
ret.append(tmp_a)
# print(f"at {i}, abs:{tmp_a}")
return min(ret)
def check_distance_2():
ret = []
tmp_a = abs(sum(A[:1]) - sum(A[1:]))
# print(tmp_a)
for i in range(1, N):
tmp_a = abs(tmp_a - (A[i]*2))
ret.append(tmp_a)
# print(tmp_a)
# print(f"at {i}, abs:{tmp_a}")
return min(ret)
print((check_distance())) | N=int(eval(input())) #数値入力 「N」だけの入力のとき
A=list(map(int, input().split())) #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# from functools import lru_cache
# @lru_cache(maxsize=100000)
# 一度差を出してから，どんどんi-1, i+1の和で縮めていく．
def check_distance():
ret = []
left = A[0]
right = sum(A[1:])
tmp_a = abs(left - right)
ret.append(tmp_a)
for i in range(1, N-1):
left += A[i]
right -= A[i]
tmp_a = abs(left - right)
ret.append(tmp_a)
return min(ret)
print((check_distance())) | p02854 |
n = int(eval(input()))
a = list(map(int,input().split()))
aa = [0]*(n+1)
for i in range(n):
aa[i+1] = aa[i] + a[i]
ans = sum(a)
for i in range(n):
ans = min(ans,abs(sum(a)-2*aa[i]))
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
aa = [0]*(n+1)
for i in range(n):
aa[i+1] = aa[i] + a[i]
sm = sum(a)
ans = sm
for i in range(n):
ans = min(ans,abs(sm-2*aa[i]))
print(ans) | p02854 |
N = int(eval(input()))
arr = list(map(int, input().split()))
min_delta = sum(arr)
for i in range(1, N):
min_delta = min(abs(sum(arr[:i]) - sum(arr[i:])), min_delta)
print(min_delta)
| N = int(eval(input()))
arr = list(map(int, input().split()))
first = 0
second = sum(arr)
min_delta = second - first
for i in range(N):
first += arr[i]
second -= arr[i]
min_delta = min(abs(second - first), min_delta)
print(min_delta)
| p02854 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=20202020200
for i in range(N):
tmp=abs(sum(A[:i])-sum(A[i:N]))
if tmp<ans:
ans=tmp
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
ans=20202020200
sum_A=0
sum_B=sum(A)
for i in range(N):
sum_A+=A[i]
sum_B-=A[i]
tmp=abs(sum_A-sum_B)
if tmp<ans:
ans=tmp
print(ans) | p02854 |
N = int(eval(input()))
MMM = list(map(int,input().split()))
MM =list(MMM)
mini = 2020202020
for i in range(N):
total1 = 0
total2 = 0
for j in range(i+1):
total1 += MM[j]
for k in range(i+1,N):
total2 += MM[k]
if abs(total1-total2)< mini:
mini = abs(total1 -total2)
print(mini) | N = int(eval(input()))
MMM = list(map(int,input().split()))
MM =list(MMM)
mini = 2020202020
list1 = []
total = 0
for i in MM:
total+=i
list1.append(total)
for i in list1:
x = abs(total - 2*i)
if mini > x:
mini = x
print(mini) | p02854 |
N=int(eval(input()))
A=list(map(int,input().split()))
c=0
A1=[]
A2=[]
s1=0
s2=0
c=float("inf")
for i in range(N-1):
A1=A[:i+1]
A2=A[i+1:]
s1=sum(A1)
s2=sum(A2)
if abs(s1-s2)<c:
c=abs(s1-s2)
print(c)
| N=int(eval(input()))
A=list(map(int,input().split()))
c=0
all=sum(A)
buf=all
A1=[]
A2=[]
s1=0
s2=0
c=float("inf")
for i in range(N-1):
buf=buf-A[i]
if c>abs((all-buf)-buf):
c=abs((all-buf)-buf)
else:
break
print(c)
| p02854 |
N, Q = list(map(int, input().split()))
query = []
for i in range(Q):
v, w = list(map(int, input().split()))
if v < w:
v, w = w, v
query.append((v - 1, w - 1))
def f(v, w):
a=w
b=v
s=0
t=0
while w != 0:
w = (w - 1) // N
s+=1
while v != 0:
v = (v - 1) // N
t+=1
u=t-s
while u>0:
b = (b - 1) // N
u-=1
while a!=b:
b = (b - 1) // N
a = (a - 1) // N
return a+1
for v, w in query:
print((f(v, w)))
| import sys
N, Q = list(map(int, input().split()))
query = []
for i in range(Q):
v, w = list(map(int, input().split()))
if v < w:
v, w = w, v
query.append((v - 1, w - 1))
def f(v, w):
L = set()
L.add(0)
while w != 0:
L.add(w)
w = (w - 1) // N
while v != 0:
if v in L:
return v + 1
v = (v - 1) // N
return 1
if N==1:
for v, w in query:
print((w+1))
sys.exit()
for v, w in query:
print((f(v, w))) | p03506 |
import sys
input=sys.stdin.readline
n,q=list(map(int,input().split()))
for i in range(q):
u,v=list(map(int,input().split()))
u-=1
v-=1
while u!=v:
if u>v:
if (u-1)//n>v:
u=(((u-1)//n)-1)//n
else:
u=(u-1)//n
else:
if (v-1)//n>v:
v=(((v-1)//n)-1)//n
else:
v=(v-1)//n
print((u+1))
| import sys
input=sys.stdin.readline
n,q=list(map(int,input().split()))
for i in range(q):
u,v=list(map(int,input().split()))
if n==1:
print((min(u,v)))
continue
u-=1
v-=1
while u!=v:
if u>v:
if (u-1)//n>v:
u=(((u-1)//n)-1)//n
else:
u=(u-1)//n
else:
if (v-1)//n>v:
v=(((v-1)//n)-1)//n
else:
v=(v-1)//n
print((u+1))
| p03506 |
from bisect import *
from sys import stdin, stdout
readline = stdin.readline
N, Q = list(map(int, readline().split()))
c = 1
B = [1]
ans = []
append = ans.append
while c < 10**9:
B.append(c+1)
c = c*N + 1
for q in range(Q):
v, w = list(map(int, readline().split()))
lv = bisect(B, v)
lw = bisect(B, w)
if lv < lw:
w = (w + (B[lw-lv]-1)*(N-2)) // N**(lw-lv)
while v != w:
v = (v + (N - 2)) // N
w = (w + (N - 2)) // N
append(str(v))
stdout.write("\n".join(ans))
stdout.write("\n")
| from bisect import *
from sys import stdin, stdout
readline = stdin.readline
N, Q = list(map(int, readline().split()))
ans = []
if N == 1:
for q in range(Q):
v, w = list(map(int, readline().split()))
ans.append(str(v))
else:
c = 1
B = [1]
while c < 10**9:
B.append(c+1)
c = c*N + 1
for q in range(Q):
v, w = list(map(int, readline().split()))
lv = bisect(B, v)
lw = bisect(B, w)
if lv < lw:
w = (w + (B[lw-lv]-1)*(N-2)) // N**(lw-lv)
while v != w:
v = (v + (N - 2)) // N
w = (w + (N - 2)) // N
ans.append(str(v))
stdout.write("\n".join(ans))
stdout.write("\n")
| p03506 |
from bisect import bisect
from itertools import accumulate
def solve(v, w):
vl = bisect(table, v)
wl = bisect(table, w)
if vl > wl:
for i in range(vl - wl):
v = (v + m) // n
elif wl < vl:
for i in range(wl - vl):
w = (w + m) // n
while v != w:
if v > w:
v, w = w, v
w = (w + m) // n
return v
n, q = list(map(int, input().split()))
m = n - 2
table, k = [], 1
while True:
table.append(k)
k *= n
if k > 1e9:
break
table = list(accumulate(table))
print(('\n'.join(map(str, (solve(*list(map(int, input().split()))) for _ in range(q))))))
| n, q = list(map(int, input().split()))
if n == 1:
def solve(v, w):
return min(v, w)
else:
def solve(v, w):
while v != w:
if v > w:
v, w = w, v
w = (w + n - 2) // n
return v
print(('\n'.join(map(str, (solve(*list(map(int, input().split()))) for _ in range(q))))))
| p03506 |
def main():
n,m=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in [0]*m]
if n==1:
for a,b in ab:
print((min(a,b)))
return
for a,b in ab:
while a!=b:
a,b=min(a,b),max(a,b)
b=(b+n-2)//n
print(a)
main() | def main():
n,m=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in [0]*m]
if n==1:
for a,b in ab:
print((min(a,b)))
return
for a,b in ab:
while a!=b:
if a<b:
b=(b+n-2)//n
else:
a=(a+n-2)//n
print(a)
main() | p03506 |
n,q=list(map(int,input().split()))
for i in range(q):
v,w=list(map(int,input().split()))
c=[1]
while v!=1:
c.append(v)
v=(v+n-2)//n
while w not in c:
w=(w+n-2)//n
print(w) | n,q=list(map(int,input().split()))
for i in range(q):
v,w=list(map(int,input().split()))
while v!=w:
if v>w:
v=(v+n-2)//n
else:
w=(w+n-2)//n
print(v) | p03506 |
n,q,*t=list(map(int,open(0).read().split()))
for v,w in zip(t[::2],t[1::2]):
while n>1and v!=w:
v,w=sorted((v,w))
w=(w+n-2)//n
print(v) | n,q,*t=list(map(int,open(0).read().split()))
for v,w in zip(t[::2],t[1::2]):
if n-1:
while v!=w:
if v>w:v,w=w,v
w=(w+n-2)//n
print(v) | p03506 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.