input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,m=list(map(int,input().split()))
visited = [[False,False,False] for _ in range(n)]
ren = [[0]*n for _ in range(n)]
for i in range(m):
u,v = list(map(int,input().split()))
ren[u-1][v-1] = 1
s,t = list(map(int,input().split()))
Q = [(s,0)]
visited[s-1][2]=True
ans = -1
while len(Q)>0:
curs,cu... | n,m=list(map(int,input().split()))
visited = [[False,False,False] for _ in range(n)]
ren = [[] for _ in range(n)]
for i in range(m):
u,v = list(map(int,input().split()))
ren[u-1].append(v)
s,t = list(map(int,input().split()))
Q = [(s,0)]
visited[s-1][2]=True
ans = -1
while len(Q)>0:
curs,curc... | p02991 |
import copy
import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
edge = []
graph = [[] for i in range(n+1)]
for i in range(m):
edge.append(list(map(int,input().split())))
graph[edge[-1][0]].append(edge[-1][1])
s, g = list(map(int,input().split()))
INF = 10**18
ans = [[INF, ... | import copy
import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
graph = [[] for i in range(n+1)]
for i in range(m):
u, v = list(map(int,input().split()))
graph[u].append(v)
s, g = list(map(int,input().split()))
INF = 10**7
ans = [[INF, INF, INF] for i in range(n+1)]
q = [s... | p02991 |
import copy
import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
graph = [[] for i in range(n+1)]
for i in range(m):
u, v = list(map(int,input().split()))
graph[u].append(v)
s, g = list(map(int,input().split()))
INF = 10**7
ans = [[INF, INF, INF] for i in range(n+1)]
q = [s... | # 頂点を3回ずつに持つ (x歩目の着地）
# 最短路
import sys
input = sys.stdin.readline
N,M = list(map(int,input().split()))
if M == 0:
print((-1))
exit()
edge = [[] for _ in range(N+1)]
for _ in range(M):
u,v = list(map(int,input().split()))
edge[u].append(v)
S,T = list(map(int,input().split()))
INF = 10 ** 9
dist... | p02991 |
import sys
sys.setrecursionlimit(100000)
N, M = map(int, input().split())
UV = [list(map(int, input().split())) for _ in range(M)]
S, T = map(int, input().split())
if 0 == M:
print(-1)
exit()
s, t = S - 1, T - 1
graph = [[] for _ in range(N)]
for u, v in UV:
graph[u - 1] += [v - 1]
INF = 10 ** ... | N, M = list(map(int, input().split()))
UV = [list(map(int, input().split())) for _ in range(M)]
S, T = list(map(int, input().split()))
if 0 == M:
print((-1))
exit()
graph = [set() for _ in range(N)]
for u, v in UV:
graph[u - 1] |= {v - 1}
INF = 10 ** 12
depths = [[INF, INF, INF] for _ in range(N)]
... | p02991 |
import sys
from collections import deque
sys.setrecursionlimit(10**6)
def main():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
u, v = list(map(int, input().split()))
G[u-1].append(v-1)
S, T = list(map(int,... | import sys
from collections import deque
def main():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
G = [[] for _ in range(3*N)]
for _ in range(M):
u, v = list(map(int, input().split()))
u, v = u-1, v-1
G[3*u].append(3*v+1)
G[3*u+1].append... | p02991 |
import sys
sys.setrecursionlimit(200000)
def main():
INF = float("inf")
input = sys.stdin.readline
N, M = list(map(int,input().split()))
G = [[[],[],[]] for k in range(N)]
for k in range(M):
u, v = list(map(int,input().split()))
u -= 1
v -= 1
G[u][0] += [... | import sys
def main():
INF = float("inf")
input = sys.stdin.readline
N, M = list(map(int,input().split()))
G = [[] for k in range(N)]
for k in range(M):
u, v = list(map(int,input().split()))
u -= 1
v -= 1
G[u] += [v]
S, T = list(map(int,input().split(... | p02991 |
from collections import defaultdict
from queue import Queue
n, m = list(map(int, input().split()))
MX = int(1e6)
edge = defaultdict(set)
edge2 = defaultdict(set)
kenedge = defaultdict(set)
dist = [MX for i in range(n)]
reached = [False for i in range(n)]
for loop in range(m):
a, b = list(map(int, input(... | from collections import defaultdict
from queue import Queue
n, m = list(map(int, input().split()))
MX = int(1e6)
edge = defaultdict(set)
dist = [[MX, MX, MX] for i in range(n)]
reached = [[False, False, False] for i in range(n)]
for loop in range(m):
a, b = list(map(int, input().split()))
edge[a-1]... | p02991 |
from collections import defaultdict
from queue import Queue
n, m = list(map(int, input().split()))
MX = int(1e6)
edge = defaultdict(set)
dist = [[MX, MX, MX] for i in range(n)]
reached = [[False, False, False] for i in range(n)]
for loop in range(m):
a, b = list(map(int, input().split()))
edge[a-1]... | from collections import defaultdict
from queue import Queue
n, m = list(map(int, input().split()))
MX = int(1e6)
edge = defaultdict(set)
dist = [[MX, MX, MX] for i in range(n)]
reached = [[False, False, False] for i in range(n)]
for loop in range(m):
a, b = list(map(int, input().split()))
edge[a-1]... | p02991 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [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 ns(): return stdin.r... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [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 ns(): return stdin.r... | p02991 |
from queue import Queue
N, M = list(map(int, input().split()))
INF = -1
dist = [[INF]*3 for _ in range(N)]
vector = [[0]*N for _ in range(N)]
for i in range(M):
graf1, graf2 = list(map(int, input().split()))
vector[graf1-1][graf2-1] = 1
S, T = list(map(int, input().split()))
S, T = S-1, T-1
# BFS
... | from queue import Queue
N, M = list(map(int, input().split()))
INF = -1
dist = [[INF]*3 for _ in range(N)]
vector = [[] for _ in range(N)]
for i in range(M):
graf1, graf2 = list(map(int, input().split()))
vector[graf1-1].append(graf2-1)
S, T = list(map(int, input().split()))
S, T = S-1, T-1
# BFS
... | p02991 |
from queue import Queue
N, M = list(map(int, input().split()))
INF = -1
dist = [[INF]*3 for _ in range(N)]
vector = [[] for _ in range(N)]
for i in range(M):
graf1, graf2 = list(map(int, input().split()))
vector[graf1-1].append(graf2-1)
S, T = list(map(int, input().split()))
S, T = S-1, T-1
# BFS
... | from collections import deque
N, M = list(map(int, input().split()))
INF = -1
dist = [[INF]*3 for _ in range(N)]
vector = [[] for _ in range(N)]
for i in range(M):
graf1, graf2 = list(map(int, input().split()))
vector[graf1-1].append(graf2-1)
S, T = list(map(int, input().split()))
S, T = S-1, T-1
... | p02991 |
from collections import deque
N,M,*L,S,T = list(map(int,open(0).read().split()))
G = [[] for _ in range(N)]
step = [[-1]*3 for _ in range(N)]
step[S-1][0] = 0
for u,v in zip(*[iter(L)]*2):
G[u-1].append(v-1)
q = deque([(S-1,0)])
while q:
cur,d = q.popleft()
for nxt in G[cur]:
if nxt==T-1 and (d+1)%3==0:... | from collections import deque
N,M,*L,S,T = list(map(int,open(0).read().split()))
G = [[] for _ in range(N)]
step = [False for _ in range(3*N)]
step[(S-1)*3] = 0
for u,v in zip(*[iter(L)]*2):
G[u-1].append(v-1)
q = deque([(S-1,0)])
while q:
cur,d = q.popleft()
for nxt in G[cur]:
if nxt==T-1 and (d+1)%3==... | p02991 |
from collections import deque
N,M,*L,S,T = list(map(int,open(0).read().split()))
G = [[] for _ in range(N)]
step = [0 for _ in range(N)]
step[S-1] = 1
for u,v in zip(*[iter(L)]*2):
G[u-1].append(v-1)
q = deque([(S-1,0)])
while q:
cur,d = q.popleft()
for nxt in G[cur]:
if nxt==T-1 and (d+1)%3==0:
pri... | def main():
from collections import deque
N,M,*L,S,T = list(map(int,open(0).read().split()))
G = [[] for _ in range(N)]
step = [False]*(3*N)
step[(S-1)*3] = True
for u,v in zip(*[iter(L)]*2):
G[u-1].append(v-1)
q = deque([(S-1,0)])
while q:
cur,d = q.popleft()
for nxt in G[cur]:
if nxt==T-1... | p02991 |
from collections import deque
n,m = list(map(int,input().split()))
es = [[] for _ in range(n+1)]
for _ in range(m):
u,v = list(map(int,input().split()))
es[u].append(v)
to = [[] for _ in range(n+1)]
for i in range(1, n+1):
que = deque([])
for j in es[i]:
que.append((j, 1))
while q... | n,m = list(map(int,input().split()))
if m==0:
print((-1))
exit()
es = [[] for _ in range(n+1)]
for _ in range(m):
u,v = list(map(int,input().split()))
es[u].append(v)
s,t = list(map(int,input().split()))
INF = 10**9
dist = [[INF,INF,INF] for _ in range(n+1)]
d = 0
q = [s]
while q:
... | p02991 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
# N-1辺表示をグラフ表示に
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
S, T = [int(x)-1 for x in input().split()]
q = [S]
checked = [False]*N
checked[S] = True
... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
# N-1辺表示をグラフ表示に
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
S, T = [int(x)-1 for x in input().split()]
q = {S}
checked = [False]*N
checked[S] = True
... | p02991 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
# N-1辺表示をグラフ表示に
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
S, T = [int(x)-1 for x in input().split()]
q = {S}
checked = [False]*N
checked[S] = True
... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
#graph[b-1].append(a-1)
S, T = list(map(int, input().split()))
S -= 1; T -= 1
D = [[-1]*3 for _ in range(... | p02991 |
import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
from collections import defaultdict
dic = defaultdict(list)
for _ in range(m):
u,v = list(map(int,input().split()))
dic[u-1].append(v-1)
G = defaultdict(list)
def dfs(p, s, l):
if l == 3:
if s != p:
... | import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
from collections import defaultdict
dic = defaultdict(list)
for _ in range(m):
u,v = list(map(int,input().split()))
dic[u-1].append(v-1+n)
dic[u - 1+n].append(v - 1 + 2*n)
dic[u - 1+2*n].append(v - 1)
G = dic
s,t... | p02991 |
from collections import defaultdict, deque
def bfs(V, s, t):
q = deque([(0, s)])
used = set()
while q:
dist, a = q.popleft()
used.add(a)
if a == t:
break
for b in V[a]:
if b in used: continue
q.append((dist+1, b))
... | from collections import defaultdict, deque
from heapq import heappush, heappop
def bfs(V, s, t):
q = deque([(0, s)])
used = set()
while q:
dist, a = q.popleft()
used.add(a)
if a == t:
break
for b in V[a]:
if b in used: continue
... | p02991 |
from collections import defaultdict, deque
from heapq import heappush, heappop
def bfs(V, s, t):
q = deque([(0, s)])
used = set()
while q:
dist, a = q.popleft()
used.add(a)
if a == t:
break
for b in V[a]:
if b in used: continue
... | from heapq import heappush, heappop
def dijkstra1(V, n, source):
# O(ElogV)
inf = float("inf")
dist = [inf] * (n+1)
dist[source] = 0
q = [(0, source)]
while q:
cost, u = heappop(q)
if dist[u] < cost:
continue
for c, v in V[u]:
if ... | p02991 |
from heapq import heappush, heappop
def dijkstra1(V, n, source):
# O(ElogV)
inf = float("inf")
dist = [inf] * (n+1)
dist[source] = 0
q = [(0, source)]
while q:
cost, u = heappop(q)
if dist[u] < cost:
continue
for c, v in V[u]:
if ... | from heapq import heappush, heappop
def dijkstra1(V, n, inf, source):
# O(ElogV)
dist = [inf] * (n+1)
dist[source] = 0
q = [(0, source)]
while q:
cost, u = heappop(q)
if dist[u] < cost:
continue
for c, v in V[u]:
if dist[v] > dist[u] +... | p02991 |
from collections import deque
n, m = list(map(int, input().split()))
inf = 10**9
def bfs(start):
dist = [inf for i in range((n+1) * 3)]
que = deque()
que.append(start)
finished = set()
dist[start] = 0
while que:
node = que.popleft()
if node not in finished:
... | from collections import deque
n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(3*n + 3)]
for i in range(m):
u, v = list(map(int, input().split()))
for j in range(1,4):
p = j + 3 * u - 3
q = (j % 3) + 3 * v - 2
#print("{} -> {}".format(p, q))
adja... | p02991 |
n,m=list(map(int,input().split()))
g=[[] for _ in range(n)]
for _ in range(m):
a,b=list(map(int,input().split()))
a,b=a-1,b-1
g[a].append(b)
s,t=list(map(int,input().split()))
s,t=s-1,t-1
gg=[set(()) for _ in range(n)]
for i in range(n):
for j in g[i]:
for k in g[j]:
for l in g[k]:
... | n,m=list(map(int,input().split()))
g=[[] for _ in range(n)]
gg=[[] for _ in range(3*n)]
for _ in range(m):
a,b=list(map(int,input().split()))
a,b=a-1,b-1
gg[a].append(n+b)
gg[n+a].append(2*n+b)
gg[2*n+a].append(b)
s,t=list(map(int,input().split()))
s,t=s-1,t-1
from collections import deque
todo=de... | p02991 |
import sys
from collections import deque
data = sys.stdin.readlines()
N, M = list(map(int, data[0].split()))
edge = [[] for _ in range(N)]
for i in range(1, M + 1):
u, v = list(map(int, data[i].split()))
u -= 1
v -= 1
edge[u].append(v)
S, T = [int(x) - 1 for x in data[M + 1].split()]
... | import sys
from collections import deque
data = sys.stdin.readlines()
N, M = list(map(int, data[0].split()))
edge = [[] for _ in range(N)]
for i in range(1, M + 1):
u, v = list(map(int, data[i].split()))
u -= 1
v -= 1
edge[u].append(v)
S, T = [int(x) - 1 for x in data[M + 1].split()]
vi... | p02991 |
from collections import*
n,m,*w,s,t=list(map(int,open(0).read().split()))
e=[[]for _ in range(n+1)]
for u,v in zip(w[::2],w[1::2]):e[u].append(v)
f=[[-3]*3for _ in range(n+1)]
f[s][0]=0
q=deque([(s,0)])
while q:
v,m=q.popleft()
for w in e[v]:
if f[w][-~m%3]<0:
f[w][-~m%3]=f[v][m]+1
q+=[(... | from collections import*
n,m,*w,s,t=list(map(int,open(0).read().split()))
e=[[]for _ in[0]*-~n]
for u,v in zip(w[::2],w[1::2]):e[u]+=v,
f=[-3]*n*4
f[s*3]=0
q=deque([(s,0)])
while q:
v,m=q.popleft()
u=-~m%3
for w in e[v]:
if f[w*3+u]<0:
f[w*3+u]=f[v*3+m]+1
q+=(w,u),
print((f[t*3]//3)) | p02991 |
from collections import deque
n, m = list(map(int, input().split()))
uv =[[] for _ in range(n)]
for _ in range(m):
u, v = list(map(int, input().split()))
uv[u - 1].append(v - 1)
s, t = list(map(int, input().split()))
s -= 1
t -= 1
uv2 = [[] for _ in range(n)]
uv3 = [[] for _ in range(n)]
for i, ... | from collections import deque
n, m = list(map(int, input().split()))
uv =[[] for _ in range(n)]
for _ in range(m):
u, v = list(map(int, input().split()))
uv[u - 1].append(v - 1)
s, t = list(map(int, input().split()))
s -= 1
t -= 1
queue = deque()
queue.append(s)
queue.append(1)
queue.append(0)
... | p02991 |
N, M = list(map(int,input().split()))
L1 = [set() for k in range(3*(N+1))]
for k in range(M):
u, v = list(map(int, input().split()))
L1[3*u].add(3*v+1)
L1[3*u+1].add(3*v+2)
L1[3*u+2].add(3*v)
S, T = list(map(int, input().split()))
S = 3*S
T = set([3*T])
t = 0
sumi = set([S])
now = set([S])
flg = 0
w... | N, M = list(map(int,input().split()))
L1 = [[] for k in range(3*(N+1))]
for k in range(M):
u, v = list(map(int, input().split()))
L1[3*u].append(3*v+1)
L1[3*u+1].append(3*v+2)
L1[3*u+2].append(3*v)
S, T = list(map(int, input().split()))
S = 3*S
T = 3*T
t = 0
sumi = [None for k in range(3*(N+1))]
sumi[... | p02991 |
import sys
from collections import deque
sys.setrecursionlimit(10000000)
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
uv = [list(map(int, readline().split())) for i in range(M)]
S, T = list(map(int, readline().split()))
S, T = S - 1, T - 1
nodes = [{} for i in range(N)]
for... | import sys
from collections import deque
sys.setrecursionlimit(10000000)
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
uv = [list(map(int, readline().split())) for i in range(M)]
S, T = list(map(int, readline().split()))
S, T = S - 1, T - 1
nodes = [{} for i in range(N)]
for... | p02991 |
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from iter... | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from iter... | p02991 |
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from iter... | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from iter... | p02991 |
N, M = list(map(int, input().split()))
a = [[] for i in range(N+1)]
for i in range(M):
u, v = list(map(int, input().split()))
a[u].append(v)
#print(a)
S, T = list(map(int, input().split()))
def main():
c = [S]
m = [[False, False, False] for i in range(N+1)]
for count in range(1, 3*N+1):
vs = ... | N, M = list(map(int, input().split()))
a = [[] for i in range(N+1)]
for i in range(M):
u, v = list(map(int, input().split()))
a[u].append(v)
#print(a)
S, T = list(map(int, input().split()))
def main():
c = [S]
m = [[False, False, False] for i in range(N+1)]
for count in range(1, 3*N+1):
c2 = ... | p02991 |
import sys
from collections import deque
input = sys.stdin.readline
n, m = list(map(int, input().split()))
info = tuple(list(map(int, input().split())) for i in range(m))
s, t = list(map(int, input().split()))
graph = [[] for i in range(n)]
for i, j in info:
graph[i-1].append(j-1)
graph2 = [[] fo... | import sys
from collections import deque
input = sys.stdin.readline
n, m = list(map(int, input().split()))
info = tuple(list(map(int, input().split())) for i in range(m))
s, t = list(map(int, input().split()))
graph = [[] for i in range(n)]
for i, j in info:
graph[i-1].append(j-1)
q = deque()
q.ap... | p02991 |
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
... | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
... | p02991 |
# 最大でも3Nしか頂点には回らない
import sys
from collections import deque
input = sys.stdin.readline
n, m = list(map(int, input().split()))
edges = [[] for i in range(n)]
for i in range(m):
u,v = list(map(int, input().split()))
u -= 1
v -= 1
edges[u].append(v)
dist = [[False]*3 for i in range(n)]
cnt ... | # 最大でも3Nしか頂点には回らない
import sys
from collections import deque
input = sys.stdin.readline
n, m = list(map(int, input().split()))
edges = [[] for i in range(n)]
for i in range(m):
u,v = list(map(int, input().split()))
u -= 1
v -= 1
edges[u].append(v)
dist = [[False]*3 for i in range(n)]
cnt ... | p02991 |
n, m = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(m)]
s, t = list(map(int, input().split()))
l = [[] for u in range(n + 1)]
for u, v in uv:
l[u].append(v)
def bfs(v):
q = [(x, 0) for x in list(v)]
visited = set(q)
while len(q) > 0:
x, step ... | n, m = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(m)]
s, t = list(map(int, input().split()))
l = [[] for u in range(n + 1)]
for u, v in uv:
l[u].append(v)
def bfs(v):
q = [(x, 0) for x in list(v)]
index = 0
ret = set()
while len(q) > index:
... | p02991 |
n,m=list(map(int,input().split()))
path=[[] for i in range(n+1)]
for i in range(m):
u,v=list(map(int,input().split()))
path[u].append(v)
S,T=list(map(int,input().split()))
que=[S]
flag=[0]*(n+1)
flag[S]=1
data=[[] for i in range(n+1)]
while que:
h=que.pop()
lst=[h]
for i in range(3)... | n,m=list(map(int,input().split()))
data=[[] for i in range(3*n+1)]
for i in range(m):
u,v=list(map(int,input().split()))
data[u].append(v+n)
data[u+n].append(v+2*n)
data[u+2*n].append(v)
s,t=list(map(int,input().split()))
inf=float("inf")
flag=[inf]*(3*n+1)
flag[s]=0
que=[s]
while que:
... | p02991 |
import sys
from collections import defaultdict
input=sys.stdin.readline
n,m=list(map(int,input().split()))
G=[[] for _ in range(n+1)]
for _ in range(m):
u,v=list(map(int,input().split()))
G[u].append(v)
s,t=list(map(int,input().split()))
D=defaultdict(int)
L=[s]
LL,LLL,LLLL,l=[],[],[],[]
cnt=0
... | import sys
from collections import deque
input=sys.stdin.readline
n,m=list(map(int,input().split()))
G=[[] for _ in range(3*(n+1))]
for _ in range(m):
u,v=list(map(int,input().split()))
G[3*u].append(3*v+2)
G[3*u+1].append(3*v)
G[3*u+2].append(3*v+1)
s,t=list(map(int,input().split()))
Q=d... | p02991 |
n, m = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(m)]
s, t = list(map(int, input().split()))
g = [[] for _ in range(3 * n)]
for u, v in uv:
a = u - 1
b = v - 1
g[a].append(n + b)
g[n+a].append(n*2 + b)
g[n*2+a].append(b)
#print(g)
s -= 1
... | n, m = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(m)]
s, t = list(map(int, input().split()))
g = [set() for _ in range(3 * n)]
for u, v in uv:
a = u - 1
b = v - 1
g[a].add(n + b)
g[n+a].add(n*2 + b)
g[n*2+a].add(b)
#print(g)
s -= 1
t -= 1... | p02991 |
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | p02991 |
import sys
def p(*a):
s=" ".join(map(str,a))
#print(s)
sys.stderr.write(s+"\n")
#-------------------------------------------------------------------
N, M = list(map(int, input().split()))
G=[[] for _ in range(N+1) ] #=> [[], [], [], [], [], [], [], []]
for _ in range(M):
u,v = list(map(int, input().... | import sys
def p(*a):
s=" ".join(map(str,a))
#print(s)
sys.stderr.write(s+"\n")
#-------------------------------------------------------------------
N, M = list(map(int, input().split()))
G=[[] for _ in range(N+1) ] #=> [[], [], [], [], [], [], [], []]
for _ in range(M):
u,v = list(map(int, input().... | p02991 |
# ABC132 E
from collections import deque
f=lambda:list(map(int,input().split()))
N,M=f()
KKP=[[set([]) for _ in [0]*(N+1)] for _ in [0]*3]
for _ in [0]*M:
a,b=f()
KKP[0][a].add(b)
S,T=f()
for j in range(2):
# j:回数
for a in range(1,N+1):
# a:頂点
for b in KKP[j][a]:
... | # ABC132 E
from collections import deque
f=lambda:list(map(int,input().split()))
N,M=f()
KKP=[[[] for _ in [0]*(N+1)] for _ in [0]*3]
for _ in [0]*M:
a,b=f()
KKP[0][a].append(b)
S,T=f()
for j in range(2):
# j:回数
for a in range(1,N+1):
# a:頂点
for b in KKP[j][a]:
... | p02991 |
# ABC132 E
from collections import deque
f=lambda:list(map(int,input().split()))
N,M=f()
KKP=[[[] for _ in [0]*(N+1)] for _ in [0]*3]
for _ in [0]*M:
a,b=f()
KKP[0][a].append(b)
S,T=f()
for j in range(2):
# j:回数
for a in range(1,N+1):
# a:頂点
for b in KKP[j][a]:
... | # ABC132 E
from collections import deque
f=lambda:list(map(int,input().split()))
N,M=f()
G=[[] for _ in [0]*(N+1)]
for _ in [0]*M:
a,b=f()
G[a].append(b)
S,T=f()
S=(S,0)
T=(T,0)
q=deque()
q.append(S)
F=set()
res=-1
while q:
node,r=q.popleft()
if (node,r%3) in F:
continue
... | p02991 |
NM=list(map(int,input().split()))
N=NM[0]
M=NM[1]
graph=[[0 for i in range(N)] for j in range(N)]
for i in range(M):
edge=list(map(int,input().split()))
graph[edge[0]-1][edge[1]-1]=1
ST=list(map(int,input().split()))
S=ST[0]-1
T=ST[1]-1
first=[]
second=[]
third=[]
able=[S]
step=0
whil... | NM=list(map(int,input().split()))
N=NM[0]
M=NM[1]
graph=[[] for j in range(N)]
for i in range(M):
edge=list(map(int,input().split()))
graph[edge[0]-1].append(edge[1]-1)
ST=list(map(int,input().split()))
S=ST[0]-1
T=ST[1]-1
first=[]
second=[]
third=[]
able=[S]
step=0
while True:
fir... | p02991 |
import sys
from collections import deque, defaultdict
import copy
import bisect
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
import math
N, M = list(map(int, input().split()))
uv = []
for i in range(M):
uv.append(list(map(int, input().split())))
S, T = list(map(int, input().split()))
G = [... |
import sys
from collections import deque, defaultdict
import copy
import bisect
#sys.setrecursionlimit(10 ** 9)
import math
import heapq
from itertools import combinations, permutations
import sys
def input():
return sys.stdin.readline().strip()
N, M = list(map(int, input().split()))
graph = [[... | p02991 |
from sys import stdin
from collections import defaultdict
from collections import deque
N,M = list(map(int,stdin.readline().split()))
Cs = [tuple(map(int,stdin.readline().split())) for _ in range(M)]
S,T = list(map(int,stdin.readline().split()))
INF = 10 ** 15
# visit = [False] * ( (N + 1) * 3 )
dist = [-1... | from sys import stdin
from collections import defaultdict
from collections import deque
N,M = list(map(int,stdin.readline().split()))
Cs = [tuple(map(int,stdin.readline().split())) for _ in range(M)]
S,T = list(map(int,stdin.readline().split()))
INF = 10 ** 15
# visit = [False] * ( (N + 1) * 3 )
dist = [-1... | p02991 |
import sys
import heapq
import math
input = sys.stdin.readline
N, M = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(M)]
S, T = list(map(int, input().split()))
g = [[] for _ in range(3*N)]
for a, b in uv:
g[a-1].append(b-1+N)
g[a-1+N].append(b-1+2*N)
g[a ... | import sys
import heapq
import math
input = sys.stdin.readline
N, M = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(M)]
S, T = list(map(int, input().split()))
g = [[] for _ in range(3*N)]
for a, b in uv:
g[a-1].append(b-1+N)
g[a-1+N].append(b-1+2*N)
g[a ... | p02991 |
import sys
import re
import math
import collections
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = ... | import sys
import re
import math
import collections
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = ... | p02991 |
from collections import defaultdict
import sys
input = sys.stdin.readline
inpl = lambda: list(map(int,input().split()))
N, M = inpl()
uv = [ set() for _ in range(N) ]
for _ in range(M):
u, v = inpl()
uv[u-1].add(v-1)
S, T = inpl()
S -= 1
T -= 1
cur = set({S})
for i in range(3*N-2):
if i % ... | import sys
input = sys.stdin.readline
inpl = lambda: list(map(int,input().split()))
N, M = inpl()
uv = [ set() for _ in range(3*N) ]
vu = [ set() for _ in range(3*N) ]
for _ in range(M):
u, v = inpl()
for k in range(3):
uv[u-1 + k*N].add(v-1 + ((k+1)%3)*N)
vu[v-1 + ((k+1)%3)*N].add(u... | p02991 |
import sys
input=sys.stdin.buffer.readline
inputs=sys.stdin.buffer.readlines
sys.setrecursionlimit(10**9)
n,m=list(map(int,input().split()))
edges=[[] for i in range(3+3*n)]
for i in range(m):
"""#weighted->erase_,__,___=map(int,input().split())
edges[_].append((__,___))
#undirected->erase#edges[__... | import sys
input=sys.stdin.buffer.readline
inputs=sys.stdin.buffer.readlines
sys.setrecursionlimit(10**9)
n,m=list(map(int,input().split()))
edges=[[] for i in range(3+3*n)]
o=inputs()
s,T=list(map(int,o.pop().split()))
for i in o:
_,__=list(map(int,i.split()))
_*=3;__*=3
edges[_].append(__+1)
... | p02991 |
import sys
input=sys.stdin.buffer.readline
inputs=sys.stdin.buffer.readlines
sys.setrecursionlimit(10**9)
n,m=list(map(int,input().split()))
edges=[[] for i in range(3+3*n)]
o=inputs()
s,T=list(map(int,o.pop().split()))
for i in o:
"""#weighted->erase_,__,___=map(int,input().split())
edges[_].append... | import sys
input=sys.stdin.buffer.readline
inputs=sys.stdin.buffer.readlines
sys.setrecursionlimit(10**9)
n,m=list(map(int,input().split()))
edges=[[] for i in range(3+3*n)]
o=inputs()
s,T=list(map(int,o.pop().split()))
for i in o:
_,__=list(map(int,i.split()))
_*=3;__*=3
edges[_].append(__+1)
... | p02991 |
from collections import deque
n,m = list(map(int,input().split()))
l = [[] for i in range(n+1)]
rl = [0 for i in range(n+1)]
for i in range(m):
u,v = list(map(int,input().split()))
l[u].append(v)
s,t = list(map(int,input().split()))
d = deque()
d.append([s,0])
rl[s] = 1
ans = -1
def kkp(l,rl,now,d,c... | from collections import deque
n,m = list(map(int,input().split()))
l = [[] for i in range(n+1)]
rl = [[-1 for i in range(n+1)] for i in range(3)]
for i in range(m):
u,v = list(map(int,input().split()))
l[u].append(v)
s,t = list(map(int,input().split()))
d = deque()
ans = -1
d.append([s,0])
rl[0][s] =... | p02991 |
import sys #追加
sys.setrecursionlimit(500*500) #追加
n,m=list(map(int,input().split()))
edge = [[] for i in range(n*3)]
#edge[i] : iから出る道の[行先]の配列
for i in range(m):
x,y = list(map(int,input().split()))
x-=1;y-=1
x*=3;y*=3
edge[x ].append(y+1)
edge[x+1].append(y+2)
edge[x+2].append(y )
... | from collections import deque
n,m=list(map(int,input().split()))
edge = [[] for i in range(n+1)]
#edge[i] : iから出る道の[行先]の配列
for _ in range(m):
u, v = list(map(int, input().split()))
edge[u].append(v)
s,t = list(map(int, input().split()))
queue = deque()
queue.append((s, 0))
visited = [[False] * 3 for _... | p02991 |
N,M = list(map(int, input().split()))
g = {}
for v in range(1,N*3+1):
g[v] = []
for _ in range(M):
u,v = list(map(int, input().split()))
g[u + N*0].append(v + N*1)
g[u + N*1].append(v + N*2)
g[u + N*2].append(v + N*0)
S,T = list(map(int, input().split()))
visiting = [(S,0)]
visited ... | N,M = list(map(int, input().split()))
g = {}
for v in range(1,N*3+1):
g[v] = []
for _ in range(M):
u,v = list(map(int, input().split()))
g[u + N*0].append(v + N*1)
g[u + N*1].append(v + N*2)
g[u + N*2].append(v + N*0)
S,T = list(map(int, input().split()))
visiting = [S]
visited = {S... | p02991 |
from collections import deque
N, M = list(map(int, input().split()))
graph = [[] for i in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
u -= 1; v -= 1
graph[u].append(v)
S, T = list(map(int, input().split()))
S -= 1; T -= 1
memo = {}
def search(node, k):
global memo
s =... | from collections import deque
N, M = list(map(int, input().split()))
graph = [[] for i in range(3*N)]
for i in range(M):
u, v = list(map(int, input().split()))
u -= 1; v -= 1
graph[3*u].append(3*v+1)
graph[3*u+1].append(3*v+2)
graph[3*u+2].append(3*v)
S, T = list(map(int, input().split()))
S -= ... | p02991 |
#!/usr/bin/env python3
import sys
import heapq
from collections import defaultdict
def solve(N: int, M: int, U: "List[int]", V: "List[int]", S: int, T: int):
S -= 1
T -= 1
adj = [[] for i in range(N)]
for u, v in zip(U, V):
adj[u-1].append(v-1)
color = [[] for i in range(N)]
... | #!/usr/bin/env python3
import sys
import heapq
from collections import defaultdict
def solve(N: int, M: int, U: "List[int]", V: "List[int]", S: int, T: int):
S -= 1
T -= 1
adj = [[] for i in range(N)]
for u, v in zip(U, V):
adj[u-1].append(v-1)
color = [[0, 0, 0] for i in range... | p02991 |
N,M=list(map(int,input().split()))
E=[[] for i in range(N)]
for i in range(M):
u,v=list(map(int,input().split()))
u,v=u-1,v-1
E[u].append(v)
S,T=list(map(int,input().split()))
S,T=S-1,T-1
from collections import deque
stack=deque()
seen=[[False for i in range(3)] for j in range(N)]
stack.append([S,0,... | N,M=list(map(int,input().split()))
E=[[] for i in range(N)]
for i in range(M):
u,v=list(map(int,input().split()))
u,v=u-1,v-1
E[u].append(v)
S,T=list(map(int,input().split()))
S,T=S-1,T-1
from collections import deque
q=deque()
seen=[[False for i in range(3)] for j in range(N)]
q.append([S,0,1])
whi... | p02991 |
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): re... | import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): re... | p02991 |
N, M = [int(x) for x in input().strip().split(" ")]
vs = set()
def dfs_w(v, d, t):
# dfs while版
r = -1
stack = [v]
path = []
while True:
if len(stack) == 0:
break
v = stack.pop()
if v < 0:
path.pop()
else:
path.appe... | N, M = [int(x) for x in input().strip().split(" ")]
from collections import deque
vs = set()
def bfs(v,d,t,N):
queue=deque([v])
dist = [0] * (N+1)
while True:
if len(queue) == 0:
break
v = queue.popleft()
for u in d[v]:
if u in vs:
... | p02991 |
N, M = [int(x) for x in input().strip().split(" ")]
from collections import deque
vs = set()
def bfs(v,d,t,N):
queue=deque([v])
dist = [0] * (N+1)
while True:
if len(queue) == 0:
break
v = queue.popleft()
for u in d[v]:
if u in vs:
... | N,M=list(map(int,input().split()))
edge=[list(map(int,input().split())) for i in range(M)]
inf=10**20
c=[[] for i in range(N*3+1)]
for i,j in edge:
c[i].append(N+j)
c[N+i].append(N+N+j)
c[N+N+i].append(j)
S,T=list(map(int, input().split()))
from collections import deque
d=[inf]*(N*3+1)
d[S]=0
q=... | p02991 |
import heapq
N,M = list(map(int,input().split()))
edge = [[] for i in range(N)]
double_edge = [[] for i in range(N)]
triple_edge = [[] for i in range(N)]
for i in range(M):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
edge[u].append(v)
S,T = list(map(int,input().split()))
S -= 1
T -= 1
for i in... | import heapq
N,M = list(map(int,input().split()))
edge = [[[] for i in range(N)] for j in range(3)]
for i in range(M):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
edge[0][u].append(v)
edge[1][u].append(v)
edge[2][u].append(v)
S,T = list(map(int,input().split()))
S -= 1
T -= 1
INF = 10**10
d... | p02991 |
from collections import deque
n,m = list(map(int,input().split()))
graph = [[[] for i in range(3)] for j in range(n+1)]
for i in range(m):
u,v = list(map(int,input().split()))
graph[u][0].append(v)
s,t = list(map(int,input().split()))
for i in range(1,3):
for j in range(1,n+1):
l = set([])
for k... | import copy
n,m = list(map(int,input().split()))
graph = [[] for _ in range(n*3)]
for i in range(m):
u,v = list(map(int,input().split()))
for j in range(3):
graph[n*j+u-1].append((n*(j+1)+v-1)%(3*n))
s,t = list(map(int,input().split()))
wait = [s-1]
cnt = 0
done = [0]*(3*n)
while wait:
cnt += 1
... | p02991 |
from collections import deque
N,M = list(map(int,input().split()))
edges = []
ad = [[] for _ in range(N)]
for _ in range(M):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
ad[u].append(v)
edges.append((u,v))
S,T = list(map(int,input().split()))
S -= 1
T -= 1
dq = deque()
dq.app... | from collections import deque
N,M = list(map(int,input().split()))
ad = [[[] for _ in range(3)] for _ in range(N)]
for _ in range(M):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
for j in range(3):
ad[u][j].append((v,(j+1)%3))
S,T = list(map(int,input().split()))
S -= 1
T -= 1... | p02991 |
# -*- coding: utf-8 -*-
"""
Created on Sun Dec 30 09:04:16 2018
@author: Yamazaki Kenichi
"""
L,N = list(map(int, input().split(' ')))
X = [int(eval(input())) for i in range(N) ]
Xr = [0] + X
Yr = ["d"]
for i in range(0,N):
Yr.append( Xr[i+1] - Xr[i])
Yl = ["d"]+[L-X[N-1]]
Yl += Yr[::-1]
S = ... | # -*- coding: utf-8 -*-
"""
Created on Sun Dec 30 09:04:16 2018
@author: Yamazaki Kenichi
"""
L,N = list(map(int, input().split(' ')))
X = [int(eval(input())) for i in range(N) ]
#inp = input().split()
#inp = [int(i) for i in inp]
#L, N = inp[0],inp[1]
#X = inp[2:]
X = [0] + X
temp = L - X[1]
ans = ... | p03187 |
import sys
INF = float('inf')
L, N = list(map(int, input().split()))
Xs = [0] + [int(eval(input())) for _ in range(N)] + [L]
if N == 1:
print((max(Xs[1], L - Xs[1])))
sys.exit()
dp = [[[-INF] * (2) for B in range(N+1)] for A in range(N+1)]
dp[1][N][0] = 0
dp[1][N][1] = 0
for A in range(1, N+1)... | from itertools import accumulate
def getRangeSum(accXs, iFr, iTo):
return accXs[iTo+1] - accXs[iFr]
def getAns(accXs, accRevXs, Xs, revXs):
ans = 0
for i in range(N):
num = (N-i)//2
dist = 2 * getRangeSum(accXs, i, i + num-1)
dist += 2 * getRangeSum(accRevXs, 0, num-1)
... | p03187 |
L, N = list(map(int, input().split()))
X = [int(eval(input())) for i in range(N)]
## Y[i] = X[i+1]-X[i]
#Y = [X[i+1]-X[i] if i<N-1 else L+X[0]-X[N-1] for i in range(N)]
#print(Y)
''' Start at X[0] '''
#''' In the case when turn first '''
#ans0 = X[0]
## 0, -1, 1, -2, ...
#i = 0
#j = N-1
#direc = 1 # di... | L, N = list(map(int, input().split()))
X = [int(eval(input())) for i in range(N)]
## Y[i] = X[i+1]-X[i]
#Y = [X[i+1]-X[i] if i<N-1 else L+X[0]-X[N-1] for i in range(N)]
#print(Y)
''' Start at X[0] '''
''' In the case when turn first '''
ans0 = X[0]
# 0, -1, 1, -2, ...
i = 0
j = N-1
direc = 1 # direction:... | p03187 |
l,n,*ki=list(map(int,open(0).read().split()))
fmax=rmax=0
fl=[]
for ii in range(n):
f=0
x=ki[ii:]
lx=n-ii
for i in x[:(lx+1)//2]:
f+=i*2
for i in x[(lx+1)//2:]:
f+=(l-i)*2
if lx%2:
sa = x[lx//2]
else:
sa = l - x[lx // 2]
f-=sa
fl.appe... | ln, kn, *ki = list(map(int, open(0).read().split()))
# 順回転
pa = ki[-1]
ky = [pa]
kigu = 1
for ys in range(2, kn + 1):
# 要素数が偶数の場合
if kigu == 1:
pa += ki[kn - ys] * 2 + ln - ki[-(ys // 2)] * 2
# 要素数が奇数の場合
else:
pa += ki[kn - ys] * 2 - ki[-(ys // 2) - 1] + ln - ki[-(ys // 2)]
... | p03187 |
from collections import deque
import math
L, N = list(map(int, input().split()))
XAntiClock, XClock = deque(), deque()
DistAntiClock, DistClock = deque(), deque()
DistAntiClock.append(0)
DistClock.append(0)
for i in range(N):
x = int(eval(input()))
XAntiClock.append(x)
XClock.appendleft(L-x)
... | import math
L, N = list(map(int, input().split()))
X = [None for i in range(N)]
DistAntiClock, DistClock = [0 for i in range(N+1)], [0 for i in range(N+1)]
for i in range(N):
X[i] = int(eval(input()))
DistAntiClock[i+1] = DistAntiClock[i] + 2 * X[i]
for i in range(N):
DistClock[i+1] = DistClock[i] +... | p03187 |
import sys
input = sys.stdin.readline
L,N=list(map(int,input().split()))
X=[0]+[int(eval(input())) for i in range(N)]
def LENG(a,b,start):
if b==0:
if start>a:
return a
else:
return L-a
if a>b:
a,b=b,a
return a+L-b
#CANDI=[(N+1)//2,(N+... | import sys
input = sys.stdin.readline
L,N=list(map(int,input().split()))
X=[0]+[int(eval(input())) for i in range(N)]
S=[]
for i in range(N):
S.append(X[i+1]-X[i])
S.append(L-X[-1])
#print(S)
DIS=L-S[-1]
ANS=L-S[-1]
MINUS=0
PLUS=L-S[-1]
#print(DIS)
for i in range(N-1):
if i%2==0:
... | p03187 |
def is_even(num):
return num % 2 == 0
def goback(M, x):
k = M // 2
if M == 0:
return L - x[0]
elif M == 1:
return 2 * (L - x[1]) + x[0]
elif is_even(M):
return 2 * sum(x[0:k]) - 2 * sum(x[M - k + 1:M + 1]) - x[M - k] + L * (2 * k + 1)
else:
return 2 * s... | def is_even(num):
return num % 2 == 0
def goback(M, x, Sx):
k = M // 2
if M == 0:
return L - x[0]
elif M == 1:
return 2 * (L - x[1]) + x[0]
elif is_even(M):
return 2 * Sx[k - 1] - 2 * (Sx[M] - Sx[M - k]) - x[M - k] + L * (2 * k + 1)
else:
return 2 * Sx[... | p03187 |
import sys
def 解():
L,N=[int(_) for _ in input().split()]
aX=[int(_) for _ in sys.stdin.readlines()]
iMax = max(aX[0],L-aX[0],aX[-1],L-aX[-1])
if 1 < N:
for i in range(N-1):
lN = min(i,N-i-1)
rN = min(i+1,N-i-1)
R1 = aX[i]+ 2*sum(aX[i-lN:i]) + 2*(rN... | import sys
def 解():
L,N=[int(_) for _ in input().split()]
aX=[int(_) for _ in sys.stdin.readlines()]
iMax = max(aX[0],L-aX[0],aX[-1],L-aX[-1])
accX = [0]*(N+1)
accX[0]=aX[0]
for i in range(1,N):
accX[i]=accX[i-1]+aX[i]
if 1 < N:
for i in range(N-1):
... | p03187 |
n,m=list(map(int,input().split(' ')))
a=list(map(int,input().split(' ')))
asum=sum(a)
if(n-asum)<0:
print("-1")
exit()
else:
print((n-asum))
exit()
| n,m=list(map(int,input().split(' ')))
a=list(map(int,input().split(' ')))
asum=sum(a)
if(n-asum)<0:
print("-1")
else:
print((n-asum))
| p02706 |
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
s = sum(a)
print((max(-1,n-s))) | n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
#合計で何日かかるかを計算して
s = sum(a)
#遊べる日数はn-sで、n-s<0になったら宿題終わらないので-1を出す
print((max(-1,n-s)))
| p02706 |
import sys
input = sys.stdin.readline
from collections import *
from math import *
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
S = sum(A)
if S>N:
print((-1))
else:
print((N-S)) | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
S = sum(A)
if S>N:
print((-1))
else:
print((N-S)) | p02706 |
n, m = [int(i) for i in input().split(' ')]
a_list = [int(i) for i in input().split(' ')]
result = n - sum(a_list)
if result < 0:
print((-1))
else:
print(result)
| n, m = list(map(int, input().split()))
a_list = list(map(int, input().split()))
result = n - sum(a_list)
if result < 0:
print((-1))
else:
print(result)
| p02706 |
import sys
from collections import deque
import copy
def main():
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
count = 0
for i in range(M):
count += A[i]
if N - count < 0:
print((-1))
else:
print((N - count))
if __name__ == ... | import sys
from collections import deque
import copy
def main():
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
count = sum(A)
if N - count < 0:
print((-1))
else:
print((N - count))
if __name__ == '__main__':
main()
| p02706 |
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
if n < sum(a):
print((-1))
else:
print((n-sum(a)))
| n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
print((-1 if n < sum(a) else n - sum(a))) | p02706 |
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A_sum = sum(A)
ans = N - A_sum
if ans>=0:
print(ans)
else:
print((-1)) | N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A_sum = sum(A)
if N - A_sum>=0:
print((N - A_sum))
else:
print((-1))
| p02706 |
NM = list(map(int, input().split()))
a = list(map(int, input().split()))
x = 0
for i in range(NM[1]):
x += a[i]
if x > NM[0]:
print((-1))
else:
print((NM[0] - x)) | NM = list(map(int, input().split()))
N, M = NM[0],NM[1]
a = list(map(int, input().split()))
if sum(a)> N:
print((-1))
else:
print((N - sum(a))) | p02706 |
NM = list(map(int, input().split()))
N, M = NM[0],NM[1]
a = list(map(int, input().split()))
if sum(a)> N:
print((-1))
else:
print((N - sum(a))) | NM = list(map(int, input().split()))
N, M = NM[0],NM[1]
a = list(map(int, input().split()))
A = sum(a)
if A> N:
print((-1))
else:
print((N - A)) | p02706 |
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
d = n - sum(a)
print((d if d >= 0 else -1)) | n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
print((max(n - sum(a), -1))) | p02706 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
a = sum(A)
if a > N:
print((-1))
else:
print((N - a))
| N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
print((max(N - sum(A), -1)))
| p02706 |
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
print((n-sum(a) if n-sum(a)>=0 else -1)) | n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
print((max(-1,n-sum(a)))) | p02706 |
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = n- sum(a)
if ans>=0:
print(ans)
else:
print((-1)) | N, M = list(map(int,input().split()))
A =list(map(int,input().split()))
print((max(-1,N-sum(A)))) | p02706 |
N, M = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
free = N - sum(l)
print((free if free>=0 else -1)) | N, M = list(map(int, input().split()))
l = list(map(int, input().split()))
free = N - sum(l)
print((free if free>=0 else -1)) | p02706 |
import math
N, M = map(int, input().split())
A = sum(map(int, input ().split()))
print(N - A) if N - A >= 0 else print(-1)
| N, M = map(int, input().split())
A = sum(map(int, input ().split()))
print(N - A) if N - A >= 0 else print(-1)
| p02706 |
n, m, *A = list(map(int, open(0).read().split()))
ans = n-sum(A)
print((ans if ans >= 0 else -1)) | n, m, *A = list(map(int, open(0).read().split()))
print((max(n-sum(A), -1))) | p02706 |
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(m):
n -= a[i]
if n < 0:
print((-1))
else:
print(n)
| n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
if n >= sum(a):
print((n-sum(a)))
else:
print((-1))
| p02706 |
# import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(... | import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): retur... | p02706 |
N, M = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
sum_a = 0
for i in a:
sum_a += i
if sum_a > N:
print((-1))
else:
print((N - sum_a)) | def to_do():
N,M=list(map(int,input().split()))
day_list=list(map(int,input().split()))
sum=0
for i in range(0,M):
sum=sum+day_list[i]
if sum>N:
print((-1))
if sum<=N:
print((N-sum))
if __name__=="__main__":
to_do() | p02706 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(M):
N -= A[i]
if N>=0:
print(N)
elif N < 0:
print((-1)) | #先にAの合計値を出してもよい
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
suma = sum(A)
if N-suma>=0:
print((N-suma))
else:
print((-1)) | p02706 |
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
if sum(a)>n:
print('-1')
else:
print((n-sum(a)))
| n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
print(('-1' if sum(a)>n else n-sum(a))) | p02706 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
d = sum(A)
if N < d:
print((-1))
else:
print((N-d)) | N, M = list(map(int, input().split()))
As = list(map(int, input().split()))
d = sum(As)
if N < d:
print((-1))
else:
print((N-d))
| p02706 |
n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = 0
for i in range(m):
b +=a[i]
if n<b:
print("-1")
else:
print((n-b)) | n,m = list(map(int,input().split()))
a = list(map(int, input().split()))
b = sum(a)
print((max(-1,n-b))) | p02706 |
n,m=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
rem = n-sum(a)
print((rem if rem>=0 else -1))
| n,m=list(map(int,input().split()))
for num in input().split():
n-=int(num)
print((n if n>=0 else -1))
| p02706 |
N, M = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
ans = N - sum(A)
print((ans if ans >= 0 else -1)) | N, M = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
print((ans if (ans := N - sum(A)) >= 0 else -1)) | p02706 |
def getxy(P,x,y,ans):
for dy in range(m):
for dx in range(m):
if P[dy][dx] > -1:
xy = [x+dx+1,y+dy+1]
if ans == "NA" or xy[1] < ans[1] or (xy[1] == ans[1] and xy[0] < ans[0]):
return xy
else:
return ans
# try-except is necessary
while 1:
try:
n,m = list(map(int,input().split... | def getxy(P,x,y,ans):
for dy in range(m):
for dx in range(m):
if P[dy][dx] > -1:
xy = [x+dx+1,y+dy+1]
if xy[1] < ans[1] or (xy[1] == ans[1] and xy[0] < ans[0]):
return xy
else:
return ans
# try-except is necessary
while 1:
try:
n,m = list(map(int,input().split()))
if n ==... | p00209 |
def main(piece, c):
for h in range(n-m+1):
for w in range(n-m+1):
if f(piece, h, w):
break
if c != 4:
move(piece, c)
else:
if ans:
print(ans[0], ans[1])
else:
print('NA')
def f(piece, h, w):
global ans
... | def main(piece, c):
for h in range(n-m+1):
for w in range(n-m+1):
if f(piece, h, w):
break
if c != 4:
move(piece, c)
else:
if ans:
print(ans[0], ans[1])
else:
print('NA')
def f(piece, h, w):
global ans
... | p00209 |
from functools import lru_cache
import sys
iMaxStackSize = 5000000
sys.setrecursionlimit(iMaxStackSize)
n = int(eval(input()))
heights = [int(x) for x in input().split()]
@lru_cache(None)
def solve(i):
if i == n - 1:
return 0
if i + 2 >= len(heights):
return abs(heights[i + 1] - h... | n = int(eval(input()))
heights = [int(x) for x in input().split()]
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
if i - 2 >= 0:
val1 = abs(heights[i] - heights[i - 1]) + dp[i - 1]
val2 = abs(heights[i] - heights[i - 2]) + dp[i - 2]
dp[i] = min(val1, val2)
else:
... | p03160 |
n=int(eval(input()))
A=list(map(int,input().split()))
inf=float("inf")
dp=[inf for i in range(n)]
dp[0]=0
dp[1]=abs(A[1]-A[0])
for i in range(2,n):
dp[i]=min(dp[i],abs(A[i-1]-A[i])+dp[i-1],abs(A[i-2]-A[i])+dp[i-2])
print((dp[n-1])) | n=int(eval(input()))
A=list(map(int,input().split()))
#dp[i]:=iにつくまでの最小コスト
dp=[1145141919810 for i in range(n)]
dp[0]=0
dp[1]=abs(A[0]-A[1])
for i in range(2,n):
dp[i]=min(dp[i-2]+abs(A[i-2]-A[i]),dp[i-1]+abs(A[i-1]-A[i]))
print((dp[n-1])) | p03160 |
N = int(eval(input()))
High = list(map(int, input().split()))
DP = [0]*N
DP[1] = abs(High[0]-High[1])
for i in range(2, N):
DP[i] = min(DP[i-2] + abs(High[i] - High[i - 2]), DP[i-1] + abs(High[i] - High[i - 1]))
print((DP[N-1])) | N = int(eval(input()))
H = [float('inf')] + list(map(int, input().split()))
DP = [0] * (N+1)
for i in range(2, N+1):
DP[i] = min(abs(H[i] - H[i-1]) + DP[i-1], abs(H[i] - H[i-2]) + DP[i-2])
print((DP[N]))
| p03160 |
n = int(eval(input()))
h = list(map(int, input().split()))
dp = [float('Inf')] * n
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))
if i > 1:
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1])) | n = int(eval(input()))
h = list(map(int, input().split()))
dp = [float('Inf')] * n
dp[0] = 0
for i in range(n - 1):
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]))
if i + 2 < n:
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]))
print((dp[n - 1])) | p03160 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.