input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
ABC = [list(map(int, input().split())) for i in range(n)]
# i日目にjを選択した後の幸福度 dp[i][j]
dp = [[0 for j in range(3)] for i in range(n + 1)]
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i + 1][k] = max(... | import sys
def input():
return sys.stdin.readline().strip()
n = int(eval(input()))
ABC = [list(map(int, input().split())) for i in range(n)]
# i日目にjを選択した後の幸福度 dp[i][j]
dp = [[0 for j in range(3)] for i in range(n + 1)]
for i in range(n):
for j in range(3):
for k in range(3):
... | p03162 |
n = int(eval(input()))
dp = list(list(map(int, input().split())) for _ in range(n))
for i in range(1, n):
dp[i][0] += max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] += max(dp[i - 1][2], dp[i - 1][0]);
dp[i][2] += max(dp[i - 1][0], dp[i - 1][1]);
print((max(dp[n - 1])))
| import sys
readline = sys.stdin.readline
n = int(eval(input()))
dp = list(list(map(int, readline().split())) for _ in range(n))
for i in range(1, n):
dp[i][0] += max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] += max(dp[i - 1][2], dp[i - 1][0]);
dp[i][2] += max(dp[i - 1][0], dp[i - 1][1]);
print((max(dp[n... | p03162 |
def MAP(): return list(map(int,input().split()))
def INT(): return int(eval(input()))
def FLOAT(): return float(eval(input()))
MOD = 10**9+7
n = INT()
a = [MAP() for _ in range(n)]
dp = [[0,0,0] for _ in range(n+1)]
for i in range(n):
for j in range(3):
for k in range(3):
if j==k:
... | n = int(eval(input()))
dp = [[0]*3 for i in range(n+1)]
a = []
for i in range(n):
a.append(list(map(int,input().split())))
for i in range(n):
for j in range(3):
for k in range(3):
if j==k:
continue
dp[i+1][j] = max(dp[i+1][j],dp[i][k] + a[i][j])
... | p03162 |
n=int(eval(input()))
al=[0]+[list(map(int,input().split())) for _ in range(n)]
dp=[[0,0,0] for _ in range(n+1)]
for day in range(1,n+1):
for i in range(3):
for j in range(3):
if i==j:continue
dp[day][i]=max(dp[day-1][j]+al[day][i],dp[day][i])
print((max(dp[-1]))) | import sys
input=sys.stdin.readline
n=int(eval(input()))
l=[[float("INF")]*3 for i in range(n)]
l[0]=list(map(int,input().split()))
for day in range(1,n):
f=list(map(int,input().split()))
for choice in range(3):
l[day][choice]=max(l[day-1][j]+f[choice] for j in range(3) if j!=choice)
print((max... | p03162 |
#import sys
#input = sys.stdin.readline
n = int(eval(input()))
abc = []
for i in range(n):
abc.append([int(i) for i in input().split()])
dp = [[float("inf") for i in range(3)] for i in range(n)]
dp[0] = abc[0]
for i in range(n-1):
dp[i+1][0] = abc[i+1][0] + max(dp[i][1], dp[i][2])
dp[i+1][1] =... | #import sys
#input = sys.stdin.readline
n = int(eval(input()))
for i in range(n):
if i == 0:
dp = [int(i) for i in input().split()]
else:
abc = [int(i) for i in input().split()]
dp[0], dp[1], dp[2] = abc[0] + max(dp[1], dp[2]), abc[1] + max(dp[0], dp[2]), abc[2] + max(dp[0], ... | p03162 |
N=int(eval(input()))
act=[]
for i in range(N):
act.append(list(map(int,input().split())))
dp=[[0]*3 for i in range(N+1)]
for i in range(1,N+1):
for j in range(3):
for k in range(3):
if(j!=k):
dp[i][j]=max(dp[i][j],dp[i-1][k]+act[i-1][j])
print((m... | N=int(eval(input()))
dp=[[0,0,0] for i in range(N+1)]
for i in range(1,N+1):
a,b,c=list(map(int,input().split()))
dp[i][0]=max(dp[i-1][1]+a,dp[i-1][2]+a)
dp[i][1]=max(dp[i-1][0]+b,dp[i-1][2]+b)
dp[i][2]=max(dp[i-1][0]+c,dp[i-1][1]+c)
print((max(dp[N]))) | p03162 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
abc = [0] * N
for i in range(N):
abc[i] = list(map(int, input().split()))
dp = [[0] * 3 for _ in range(N)]
dp[0] = abc[0]
for i, (a, b, c) in enumerate(abc[1:], start=1):
dp[i][0] = max(dp[... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
abc = [0] * N
for i in range(N):
abc[i] = list(map(int, input().split()))
dp = [[0] * 3 for _ in range(N)]
dp[0] = abc[0]
for i, (a, b, c) in enumerate(abc[1:], start=1):
dp_i = dp[i]
... | p03162 |
N=int(eval(input()))
dp=[[0 for i in range(3)] for j in range(N+1)]
for i in range(N):
a,b,c=list(map(int,input().split()))
dp[i+1][0]=max(dp[i][1]+a,dp[i][2]+a)
dp[i+1][1]=max(dp[i][0]+b,dp[i][2]+b)
dp[i+1][2]=max(dp[i][1]+c,dp[i][0]+c)
print((max(dp[N])))
| import sys
readline = sys.stdin.readline
N = int(readline())
dp = [[0] * 3 for i in range(N + 1)]
for i in range(N):
a,b,c = list(map(int,readline().split()))
dp[i + 1][0] = max(dp[i][1],dp[i][2]) + a
dp[i + 1][1] = max(dp[i][2],dp[i][0]) + b
dp[i + 1][2] = max(dp[i][0],dp[i][1]) + c
print((max... | p03162 |
n=int(eval(input()))
a=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*3 for i in range(n)]
dp[0][0]=a[0][0]
dp[0][1]=a[0][1]
dp[0][2]=a[0][2]
for i in range(1,n):
dp[i][0]=a[i][0]+max(dp[i-1][1],dp[i-1][2])
dp[i][1]=a[i][1]+max(dp[i-1][0],dp[i-1][2])
dp[i][2]=a[i][2]+max(dp[i-1][1],dp[i... | n=int(eval(input()))
dp=[[0]*3 for _ in range(n)]
dp[0]=list(map(int,input().split()))
for i in range(1,n):
l=list(map(int,input().split()))
dp[i][0]=l[0]+max(dp[i-1][1],dp[i-1][2])
dp[i][1]=l[1]+max(dp[i-1][0],dp[i-1][2])
dp[i][2]=l[2]+max(dp[i-1][0],dp[i-1][1])
print((max(dp[-1]))) | p03162 |
n=int(eval(input()))
a=[0]*n
b=[0]*n
c=[0]*n
for i in range(n):
a[i],b[i],c[i]=list(map(int,input().split()))
dp=[[0,0,0] for _ in range(n+1)]
for i in range(1,n+1):
dp[i][0] = max(dp[i-1][1],dp[i-1][2])+a[i-1]
dp[i][1] = max(dp[i-1][0],dp[i-1][2])+b[i-1]
dp[i][2] = max(dp[i-1][0],dp[i-1][1]... | n=int(eval(input()))
l=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*3 for _ in range(n)]
dp[0]=l[0]
for i in range(n-1):
for j in range(3):
dp[i+1][j]=max(dp[i][(j+1)%3],dp[i][(j+2)%3])+l[i+1][j]
print((max(dp[n-1]))) | p03162 |
from pprint import pprint
n=int(eval(input()))
l=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*3 for _ in range(n)]
dp[0]=l[0]
for i in range(1,n):
for j in range(3):
dp[i][j]=max(dp[i-1][(j+1)%3]+l[i][j],dp[i-1][(j+2)%3]+l[i][j])
print((max(dp[n-1])))
# pprint(dp) | n=int(eval(input()))
l=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*3 for _ in range(n)]
dp[0]=l[0]
for i in range(n-1):
for j in range(3):
dp[i+1][j]=max(dp[i][(j+1)%3]+l[i+1][j],dp[i][(j+2)%3]+l[i+1][j])
print((max(dp[n-1]))) | p03162 |
N = int(eval(input()))
ABC = [list(map(int,input().split())) for _ in range(N)]
dp = [[0 for i in range(3)] for j in range(N)]
dp[0][0]= ABC[0][0]
dp[0][1]= ABC[0][1]
dp[0][2]= ABC[0][2]
for i in range(1,N):
for toi in range(3):
s = 0
for fromi in range(3):
if toi==fromi:
... | N = int(eval(input()))
ABC = [list(map(int,input().split())) for _ in range(N)]
dp = [[0 for i in range(3)] for j in range(N)]
# 1日目の初期化
dp[0]= ABC[0]
for i in range(1,N):
# 次ステップでA,B,Cに行く場合、
for toi in range(3):
s = 0
# どこから来るのが最大か求める
for fromi in range(3):
# ... | p03162 |
N=int(eval(input()))
p=list(map(int,input().split()))
for i in range(1,N):
add=list(map(int,input().split()))
temp=[[] for j in range(3)]
for j in range(3):
pnt=p[j]
for k in range(3):
if j==k:continue
else:
temp[k].append(pnt+add[k])
... | N=int(eval(input()))
p=list(map(int,input().split()))
for i in range(1,N):
add=list(map(int,input().split()))
p0=p[0]
p1=p[1]
p2=p[2]
p[0]=max(add[0]+p1,add[0]+p2)
p[1]=max(add[1]+p2,add[1]+p0)
p[2]=max(add[2]+p0,add[2]+p1)
print((max(p)))
| p03162 |
n = int(eval(input()))
a, b, c = [0] * n, [0] * n, [0] * n
for i in range(n):
a[i], b[i], c[i] = list(map(int, input().split()))
dp = [[0] * 3 for _ in range(n)]
dp[-1] = [a[-1], b[-1], c[-1]]
for i in range(n - 2, -1, -1):
dp[i][0] = a[i] + max(dp[i + 1][1], dp[i + 1][2])
dp[i][1] = b[i] + ma... | n = int(eval(input()))
a, b, c = [0] * n, [0] * n, [0] * n
for i in range(n):
a[i], b[i], c[i] = list(map(int, input().split()))
dp = [[0] * n for _ in range(3)]
dp[0][-1], dp[1][-1], dp[2][-1] = a[-1], b[-1], c[-1]
for i in range(n - 2, -1, -1):
dp[0][i] = a[i] + max(dp[1][i + 1], dp[2][i + 1])
... | p03162 |
n = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(n)]
def chmax(a, b):
if a > b:
return a
else:
return b
dp = [[ 0 for _ in range(3)]for _ in range(n+10)]
for i in range(3):
dp[0][i] = A[0][i]
for i in range(1, n):
for j in range(3):
f... | n = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(n)]
dp = [[ 0 for _ in range(3)]for _ in range(n+10)]
for i in range(3):
dp[0][i] = A[0][i]
for i in range(1, n):
for j in range(3):
for k in range(3):
if j != k:
dp[i][k] = max(dp[i][k]... | p03162 |
n = int(eval(input()))
A = [[int(i) for i in input().split()] for i in range(n)]
dp = [0, 0, 0]
for i in range(n):
dp = [A[i][0] + max(dp[1], dp[2]), A[i][1] + max(dp[0], dp[2]), A[i][2] + max(dp[0], dp[1])]
print((max(dp))) | n = int(eval(input()))
dp = [int(i) for i in input().split()]
for i in range(n-1):
a, b, c = list(map(int, input().split()))
dp = [max(dp[1], dp[2]) + a, max(dp[0], dp[2]) + b, max(dp[0], dp[1]) + c]
print((max(dp))) | p03162 |
from sys import stdin
import math
import fractions
from collections import deque
INF = 10 ** 10
N = int(stdin.readline().rstrip())
abc = [list(map(int, stdin.readline().rstrip().split())) for _ in range(N)]
# add dummy
abc = abc + [[-INF, -INF, -INF]]
# i日目に(0, 1, 2):=(a, b, c)の行動を行った時の幸福度の最大値
dp = [[-I... | from sys import stdin
import math
import fractions
from collections import deque
INF = 10 ** 10
N = int(stdin.readline().rstrip())
abc = [list(map(int, stdin.readline().rstrip().split())) for _ in range(N)]
# i日目に(0, 1, 2):=(a, b, c)の行動を行った時の幸福度の最大値
dp = [[-INF] * 3 for _ in range(N+10)]
a, b, c = abc[... | p03162 |
N = int(eval(input()))
L = []
for i in range(N):
l = list(map(int,input().split()))
L.append(l)
dp = [[0,0,0] for i in range(N)]
dp[0] = [L[0][0],L[0][1],L[0][2]]
for i in range(1,N):
for j in range(3):
dp[i][j] = max(dp[i - 1][(j + 1) % 3],dp[i - 1][(j + 2) % 3]) + L[i][j]
print((max(... | N = int(eval(input()))
L = [list(map(int,input().split())) for i in range(N)]
dp = [[0,0,0] for i in range(N)]
dp[0] = L[0]
for i in range(1,N):
for j in range(3):
dp[i][j] = max(dp[i - 1][(j + 1) % 3],dp[i - 1][(j + 2) % 3]) + L[i][j]
print((max(dp[-1]))) | p03162 |
N=int(eval(input()))
dp=[[0 for i in range(N+1)] for i in range(3)]
for j in range(N):
abc=list(map(int,input().split()))
for i in range(3):
if j==0:
dp[i][j]=abc[i]
else:
dp[i][j]=max([dp[k][j-1]+abc[i] for k in range(3) if k!=i])
print((max([dp[i][N-1] for i ... | N = int(eval(input()))
dp = list(map(int, input().split()))
for i in range(1, N):
a, b, c = list(map(int, input().split()))
newDP = [0] * 3
newDP[0] = max(dp[1], dp[2]) + a
newDP[1] = max(dp[0], dp[2]) + b
newDP[2] = max(dp[0], dp[1]) + c
dp = newDP[::]
ans = max(dp)
print(ans)
| p03162 |
N = int(eval(input()))
A, B, C = [], [], []
for n in range(N):
a, b, c = list(map(int, input().split()))
A.append(a)
B.append(b)
C.append(c)
a, b, c = 0, 0, 0
for n in range(N):
a, b, c = A[n] + max(b, c), B[n] + max(c, a), C[n] + max(a, b)
print((max(a, b, c)))
| N = int(eval(input()))
a, b, c = 0, 0, 0
for n in range(N):
an, bn, cn = list(map(int, input().split()))
a, b, c = an + max(b, c), bn + max(c, a), cn + max(a, b)
print((max(a, b, c)))
| p03162 |
import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
#sys.setrecursionlimit(200000000)
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: list(map(int,input().split()))
alele = lambda: list(map(int, input().split(... | import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
#sys.setrecursionlimit(200000000)
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: list(map(int,input().split()))
alele = lambda: list(map(int, input().split(... | p03162 |
"""
解説PDFを見ながら実装
https://img.atcoder.jp/abc075/editorial.pdf
"""
def dfs(v, graph, visited, n):
# 出発点
visited[v] = True
for i in range(n):
# 辺がない
if graph[v][i] == False:
continue
# 訪問済み
if visited[i] == True:
continue
# 辺があったらそ... |
def main():
N, M = list(map(int, input().split()))
AB = []
for _ in range(M):
a, b = list(map(int, input().split()))
AB.append([a-1, b-1])
# グラフを表現する（辺のある・なし）
graph = []
for _ in range(N):
graph.append([False] * N)
for a, b in AB:
graph[a][b] ... | p03575 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | p03575 |
#dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop,... | #dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop,... | p03575 |
#dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop,... | #dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop,... | p03575 |
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
graph = [[0] * N for _ in range(N)]
for a, b in edges:
graph[a - 1][b - 1] = 1
graph[b - 1][a - 1] = 1
def dfs(v):
visited[v] = 1
for v2 in range(N):
if graph[v][v2]==0 or visited[v2... | N,M=list(map(int,input().split()))
ab=list(list(map(int,input().split())) for _ in range(M))
graph=list([0]*N for _ in range(N))
ans=0
for a,b in ab:
graph[a - 1][b - 1] = 1
graph[b - 1][a - 1] = 1
def dfs(s):
visited[s]=1
for i in range(N):
if graph[s][i] == 0 or visited[i] == 1:
... | p03575 |
N, M = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(M)]
def find(x):
if par[x] == x:
return x
else:
par[x] = find(par[x])
return par[x]
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return
if rank... | N, M = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(M)]
graph = [[False] * N for _ in range(N)]
for a, b in X:
graph[a - 1][b - 1] = True
graph[b - 1][a - 1] = True
def dfs(u):
visited[u] = True
for v in range(N):
if visited[v] or not graph[u... | p03575 |
import sys
input=sys.stdin.readline
import math
def get_edges_include_node(i, Edges): # 頂点 i を含む辺のリストを返す
es = []
for e in Edges:
if i in e:
es.append(e)
return es
def dfs(i, e0, goal, Edges): # 頂点 i から頂点 j にたどり着けるかどうか
if e0 in Edges:
Edges.remove(e0)
for e... | import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return se... | p03575 |
# ABC075C - Bridge
# find the number of bridges in a given undirected connected graph
# bridge := an edge whose removal disconnects a graph
import sys
from copy import deepcopy
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
def dfs(v: int) -> None:
seen[v] = 1 # make vertex v searched
... | # ABC075C - Bridge
# find the number of bridges in a given undirected connected graph
# bridge := an edge whose removal disconnects a graph
def dfs(start: int) -> None:
seen[start] = 1 # make vertex v searched
stack = [start]
while stack:
v = stack.pop()
for u in g[v]:
... | p03575 |
from collections import deque
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
def make_dict(x,y):
for i in ll:
if i[x] in list(d.keys()):
d[i[x]]+=[i[y]]
else:
d[i[x]]=[i[y]]
cnt=0
for i in range(m):
ll=l[:i]+l[i+1:... | from collections import deque
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
def make_dict(x,y):
for i in ll:
if i[x] in list(d.keys()):
d[i[x]]+=[i[y]]
else:
d[i[x]]=[i[y]]
cnt=0
for i in range(m):
ll=l[:i]+l[i+1:... | p03575 |
from collections import deque
from copy import deepcopy
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
def BFS(m):
t_l=deepcopy(l)
del t_l[m]
tree=[[] for j in range(n)]
for a,b in t_l:
a-=1
b-=1
tree[a].append(b)
tree[b].append(a)
... | from collections import deque
from copy import deepcopy
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
def DFS(m):
t_l=deepcopy(l)
del t_l[m]
tree=[[] for j in range(n)]
for a,b in t_l:
a-=1
b-=1
tree[a].append(b)
tree[b].append(a)
... | p03575 |
def wf(this_graf):
s = len(graf)
for k in range(s):
for i in range(s):
for j in range(s):
this_graf[i][j] = min(this_graf[i][j], this_graf[i][k] + this_graf[k][j])
return this_graf
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for ... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | p03575 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
class UnionFind:
def __init__(self,n):
self.par = [i for i in range(n+1)] # 親のノード番号
self.rank = [0]*(n+1)
def find(self,x): # xの根のノード番号
if self.par[x] == x:
return x
else:
... | p03575 |
import sys
import copy
readline = sys.stdin.readline
def dfs(p, x):
global graphtmp, check
to = graphtmp[x]
check[x] = 1
for t in to:
if p == t or check[t] == 1:
continue
dfs(x, t)
def main():
global graphtmp, check
N, M = list(map(int, readline().s... | import sys
readline = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
self.rank = [0] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(sel... | p03575 |
def warshall_floyd(d, n):
# d: 隣接行列(正方行列)
# n: 頂点数
# i -> j の最短距離を計算する
for k in range(n):
for i in range(n):
for j in range(n):
# i -> k -> j と頂点kを挟む
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
# ---------------------------... | import copy
def main():
# n: 頂点数
# w: 辺の数
n, w = list(map(int, input().split()))
# v -> v ; cost: 0
d = [[False] * n for i in range(n)]
# d[u][v] : 辺u-vのコスト(if not: inf)
e = []
for i in range(w):
# edge: u -> v ; cost : z
u, v = [int(x) - 1 for x in input... | p03575 |
import copy
def main():
# n: 頂点数
# w: 辺の数
n, w = list(map(int, input().split()))
# v -> v ; cost: 0
d = [[False] * n for i in range(n)]
# d[u][v] : 辺u-vのコスト(if not: inf)
e = []
for i in range(w):
# edge: u -> v ; cost : z
u, v = [int(x) - 1 for x in input... | def main():
n, m, *ab = list(map(int, open(0).read().split()))
e = [[] for _ in range(n)]
for u, v in zip(*[iter(ab)] * 2):
e[u - 1].append(v - 1)
e[v - 1].append(u - 1)
ans = 0
for _ in range(m):
count = 0
for i, x in enumerate(e):
if len(x) =... | p03575 |
class UnionFind():
def __init__(self, n):
self.n = n
self.parent = [i for i in range(self.n)]
self.rank = [0] * self.n
def find_root(self, x):
if self.parent[x] == x:
return x
else:
self.parent[x] = self.find_root(self.parent[x])
return self.parent[x]
def u... | class UnionFind():
def __init__(self, n):
self.n = n
self.parent = [i for i in range(self.n)]
self.rank = [0] * self.n
def find_root(self, x):
if self.parent[x] == x:
return x
else:
self.parent[x] = self.find_root(self.parent[x])
return self.parent[x]
def u... | p03575 |
import copy
n, m = list(map(int, input().split()))
array = [[int(x) for x in input().split()] for y in range(m)]
t = copy.copy(array)
def solver(start, array, visited, cnt):
if visited[start]:
return cnt
else:
visited[start] = True
for i in array[start]:
if len(set(... | n, m = list(map(int, input().split()))
ab_array = [[int(x) for x in input().split()] for y in range(m)]
graph = [[] for x in range(n + 1)]
def dfs(graph, now, a, b):
visited[now] = True
for next in graph[now]:
if (now == a and next == b) or (now == b and next == a):
continue
... | p03575 |
def dfs(now):
if vis[now]==1:
return 0
vis[now]=1
for i in range(n):
if graph[now][i]==1:
dfs(i)
n,m=list(map(int,input().split()))
edge=[[int(i) for i in input().split()]for i in range(m)]
graph=[[0 for i in range(n)]for i in range(n)]
vis=[0]*n
for i in range(m):
... | def dfs(now):
if vis[now]==1:#既に訪問済みであればreturn
return 0
vis[now]=1#訪問した記録をつける
for i in range(n):
if graph[now][i]==1:#接続していれば、移動
dfs(i)
n,m=list(map(int,input().split()))
edge=[[int(i) for i in input().split()]for i in range(m)]#入力値を受け取る
graph=[[0 for i in range(n)]for i... | p03575 |
def dfs(now):
if vis[now]==1:#既に訪問済みであればreturn
return 0
vis[now]=1#訪問した記録をつける
for i in range(n):
if graph[now][i]==1:#接続していれば、移動
dfs(i)
n,m=list(map(int,input().split()))
edge=[[int(i) for i in input().split()]for i in range(m)]#入力値を受け取る
graph=[[0 for i in range(n)]for i... | def dfs(now):
if vis[now]:
return 0
vis[now]=1
for i in range(n):
if graph[now][i]:
dfs(i)
n,m=list(map(int,input().split()))
edge=[[int(i) for i in input().split()]for i in range(m)]
graph=[[0 for i in range(n)]for i in range(n)]
for i in range(m):
graph[edge[i][0... | p03575 |
# 頂点と辺の数を入力する
N, M = list(map(int, input().split()))
# 隣接リストを作成する
list_adjlist = [[] for _ in range(N + 1)]
# 辺のリストを作成する
list_edge = []
# 辺を入力し、隣接リストおよび辺のリストに格納する
for _ in range(M):
a, b = list(map(int, input().split()))
list_edge.append((a, b))
list_adjlist[a].append(b)
list_adjlist[b].appen... | #幅優先探索（BFS）を利用
# 頂点と辺の数を入力する
N, M = list(map(int, input().split()))
# 隣接リストを作成する
list_adjlist = [[] for _ in range(N + 1)]
# 辺のリストを作成する
list_edge = []
# 辺を入力し、隣接リストおよび辺のリストに格納する
for _ in range(M):
a, b = list(map(int, input().split()))
list_edge.append((a, b))
list_adjlist[a].append(b)
list_... | p03575 |
n, m = list(map(int, input().split()))
L = [[0, 0] for _ in range(m)]
g = [[] for _ in range(n)]
for j in range(m):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
L[j][0] = a
L[j][1] = b
from collections import deque
ans = 0
for i in range(m):
g = [[] for _ in range(n)]
f... | n, m = list(map(int, input().split()))
g = [[] for _ in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
g[a].append(b)
g[b].append(a)
def lowlink(g, root=0):
n = len(g)
order = [n]*n
low = [n]*n
s = [root]
cnt = 1
par = [-1]*n
... | p03575 |
from collections import deque
n,m = list(map(int,input().split()))
edge_ls = [0] * m
for i in range(m):
a,b = list(map(int,input().split()))
edge_ls[i] = [a,b]
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.par... | from collections import deque
num_ver, num_edge = list(map(int,input().split()))
edges_ls = [0] * num_edge
for i in range(num_edge):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
edges_ls[i] = [a,b]
num_bridge = 0
for ind_take_edge in range(num_edge):
graph_ls = [[] for _ in range(n... | p03575 |
from collections import deque
N, M = list(map(int, input().split()))
graph = [set() for _ in range(N + 1)]
edge = []
for m in range(M):
a, b = list(map(int, input().split()))
graph[a].add(b)
graph[b].add(a)
edge.append([a, b])
ans = 0
for m in range(M):
Bridge = True
fr, to = edg... | from collections import deque
N, M = list(map(int, input().split()))
graph = [set() for _ in range(N + 1)]
edge = []
##immutableに気をつけて
for m in range(M):
a, b = list(map(int, input().split()))
graph[a].add(b)
graph[b].add(a)
edge.append([a, b])
ans = 0
for m in range(M):
Bridge = Tru... | p03575 |
N,M = list(map(int,input().split()))
AB = []
from collections import deque
for i in range(M):
AB.append(list(map(int,input().split())))
out = 0
for remove in range(M):
G = [[] for i in range(N)]
for i in range(M):
if i==remove:
continue
else:
A,B=AB[... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | p03575 |
from collections import deque
n,m=list(map(int,input().split()))
X=[]
M=[[] for _ in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
X.append([a,b])
M[a-1].append(b-1)
M[b-1].append(a-1)
ans=0
for i in range(m):
se={X[i][0]-1,X[i][1]-1}
q=deque([0])
visited=[0]*n... | n,m=list(map(int,input().split()))
X=[]
M=[[] for _ in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
X.append([a-1,b-1])
M[a-1].append(b-1)
M[b-1].append(a-1)
ans=0
def dfs(x,se):
visited[x]=1
for m in M[x]:
if se!={x,m} and visited[m]==0:
dfs... | p03575 |
from collections import defaultdict
n, m = list(map(int, input().split()))
G = defaultdict(list)
s = []
for i in range(m):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
s.append((a - 1, b - 1))
def dfs(cur, pre, NG, k):
global used
used[cur] ... | N, M = list(map(int, input().split()))
G = [[] for i in range(N)]
E = []
for i in range(M):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
E.append((a, b))
def dfs(v, pre, s, ng):
if used[v]:
return
used[v] = 1
s.add(v)
... | p03575 |
import copy
N,M=list(map(int,input().split()))
l_2d = [[0] * N for i in range(N)]
edges=[]
def dfs(i):
l_visit[i-1]=1
for j in range(1,N+1):
if l_2d_temp[i-1][j-1]==1 and l_visit[j-1]==0:
dfs(j)
return
for _ in range(M):
i,j=list(map(int,input().split()))
edges.... | N, M = list(map(int, input().split()))
R = []
G = {k: [] for k in range(N)} # 0-indexed
for _ in range(M):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
R.append((a-1, b-1))
def dfs(p, i, arrived):
for n in G[p]:
if arrived[n] is False and tupl... | p03575 |
n,m=list(map(int,input().split()))
e=[]
for i in range(m):
e.append(list(map(int,input().split())))
ans=0
for i in range(m):
nall=[]
for j in range(m):
if i==j:
continue
nall.append(e[j])
visited=[0]*n
visited[0]=1
t=[1]
while len(t)>0:
tmp=... | n,m=list(map(int,input().split()))
e=[]
for i in range(m):
e.append(list(map(int,input().split())))
ans=0
for i in range(m):
g=[[] for _ in range(n)]
for j in range(m):
if i==j:
continue
g[e[j][0]-1].append(e[j][1])
g[e[j][1]-1].append(e[j][0])
visited=[0]... | p03575 |
n, m = list(map(int, input().split()))
G = [[] for i in range(n)]
E = []
for i in range(m):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
E.append((a-1, b-1))
from collections import deque
def solve(s, t):
if len(G[s]) == 1 or len(G[t]) == 1:
return ... | n, m = list(map(int, input().split()))
G = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
def bridge(g, v, s=0):
bl = [False] * v
c_memo = [0] * v
c_used = [False] * v
b_g = [[] for i in range(v)]
def dfs(... | p03575 |
from itertools import chain
import copy
n, m = list(map(int, input().split()))
lis = [[10000000 for i in range(n)] for j in range(n)]
hen = []
for _ in range(m):
hen.append(list(map(int, input().split())))
ans = 0
for x in range(m):
lis_tmp = copy.deepcopy(lis)
bri = copy.deepcopy(hen)
... | n, m = list(map(int, input().split()))
hen = []
for _ in range(m):
hen.append(list(map(int, input().split())))
def dfs(vis, graph, x, n):
vis[x] = True
for i in range(n):
if graph[x][i] == False:
continue
if vis[i] == True:
continue
dfs(vis, graph... | p03575 |
class UnionFind:
def __init__(self, size):
self.table = [-1 for _ in range(size)]
def find(self, x):
while self.table[x] >= 0:
x = self.table[x]
return x
def union(self, x, y):
s1 = self.find(x)
s2 = self.find(y)
if s1 != s2:
... | class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, ... | p03575 |
#####################################################################################################
##### Low Link (橋、関節点)
#####################################################################################################
"""
計算量
O(V+E)
参考
https://algo-logic.info/bridge-lowlink/
"""
import... | #####################################################################################################
##### Low Link (橋、関節点)
#####################################################################################################
"""
計算量
O(V+E)
参考
https://algo-logic.info/bridge-lowlink/
"""
import... | p03575 |
#####################################################################################################
##### Low Link (橋、関節点)
#####################################################################################################
"""
計算量
O(V+E)
参考
https://algo-logic.info/bridge-lowlink/
"""
import... | #####################################################################################################
##### Low Link (橋、関節点)
#####################################################################################################
"""
計算量
O(V+E)
参考
https://algo-logic.info/bridge-lowlink/
"""
import... | p03575 |
class UnionFind:
def __init__(self, num):
self.rank = [0]*num
self.par = [i for i in range(num)] #基準(par = parentのpar)
self.n = num
self.size = [1]*num
#親を探す
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x]) #自分じゃなきゃ親を探す
... | class UnionFind:
def __init__(self, num):
self.rank = [0]*num
self.par = [i for i in range(num)] #基準(par = parentのpar)
self.n = num
self.size = [1]*num
#親を探す
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x]) #自分じゃなきゃ親を探す
... | p03575 |
class UnionFind:
def __init__(self, size):
self.table = [i for i in range(size)]
def find(self, x):
return self.table[x]
def union(self, x, y):
x1 = self.find(x)
y1 = self.find(y)
if x1 == y1:
return False
for i in range(len(sel... | # python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
class UnionFind:
def __init__(self, size):
"""
size:頂点の数
"""
self.parent = [i for i in range(size)]
self.rank = [0 for _ in range(size)]
def find(self, x):
... | p03575 |
#!/usr/bin/env python3
from copy import deepcopy
def dfs(x, adj, visited):
for y, flag in enumerate(adj[x]):
if flag and y not in visited:
visited.add(y)
dfs(y, adj, visited)
def main():
n, m = list(map(int, input().split()))
adj = [[(i == j) for i in range(n)]... | #!/usr/bin/env python3
from copy import deepcopy
def dfs(x, adj, visited):
for y, flag in enumerate(adj[x]):
if flag and y not in visited:
visited.add(y)
dfs(y, adj, visited)
def is_simply_connected(adj):
n = len(adj)
visited = {0}
dfs(0, adj, visited)
... | p03575 |
#!/usr/bin/env python3
from copy import deepcopy
def dfs(x, adj, visited):
for y, flag in enumerate(adj[x]):
if flag and y not in visited:
visited.add(y)
dfs(y, adj, visited)
def is_simply_connected(adj):
n = len(adj)
visited = {0}
dfs(0, adj, visited)
... | #!/usr/bin/env python3
from copy import deepcopy
def dfs(x, adj, visited):
for y, flag in enumerate(adj[x]):
if flag and y not in visited:
visited.add(y)
dfs(y, adj, visited)
def is_simply_connected(adj):
n = len(adj)
visited = {0} # O(log n). Use list instead... | p03575 |
from collections import deque
N, M = list(map(int, input().split()))
edges = []
for _ in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
edges.append((a, b))
ans = 0
for removeEdge in range(M):
confilm = [False for _ in range(N)]
que = deque([])
que.append(0)... |
class UnionFind :
def __init__(self, size) :
self.parent = list(range(size))
self.height = [0] * size
self.size = [1] * size
self.component = size
def root(self, index) :
if self.parent[index] == index : # 根の場合
return index
rootIndex = se... | p03575 |
import copy
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
class UnionFindPathCompression():
def __init__(self, n:int):
self.parents = list(range(n))
self.rank = [1]*n
self.size = [1]*n
def find(self, x:int) -> int:
if self.... | import copy
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
class UnionFindPathCompression():
def __init__(self, n:int):
self.parents = list(range(n))
self.rank = [1]*n
self.size = [1]*n
def find(self, x:int) -> int:
if self.... | p03575 |
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10**5)
def dfs(u, visited, g, seq):
visited[u] = True
for v in g[u]:
if visited[v] == True or not seq[u][v]:
continue
dfs(v, visited, g, seq)
def resolve():
n, m = list(map(int, input().split()))
seq = [[True]*n for _ ... | def search(u, g, visited):
if visited[u]:
return
visited[u] = True
for v in g[u]:
search(v, g, visited)
def resolve():
n, m = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(m)]
ans = 0
for i in range(m):
g = [[] for _ in range(n)]
for j in range(m):
... | p03575 |
from collections import deque
N,M = list(map(int,input().split()))
edges = []
connections = {}
for i in range(M):
edges.append(list(map(int,input().split())))
a,b = edges[-1][0],edges[-1][1]
if a in connections:
connections[a].append(b)
else:
connections[a] = [b]
... | #https://note.nkmk.me/python-union-find/
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self... | p03575 |
from collections import deque
n, m = list(map(int, input().split()))
eg = [[] for _ in range(n + 1)]
al = [0] * m
bl = [0] * m
for i in range(m):
a, b = list(map(int, input().split()))
eg[a].append(b)
eg[b].append(a)
al[i], bl[i] = a, b
ans = 0
for i in range(m):
x, y = al[i], bl... | n, m = list(map(int, input().split()))
eg = [[] for _ in range(n + 1)]
al = [0] * m
bl = [0] * m
for i in range(m):
a, b = list(map(int, input().split()))
eg[a].append(b)
eg[b].append(a)
al[i], bl[i] = a, b
ans = 0
for i in range(m):
x, y = al[i], bl[i]
q = [1]
seen = {1}
... | p03575 |
from collections import deque
n, m = list(map(int, input().split()))
eg = [[] for _ in range(n + 1)]
al = [0] * m
bl = [0] * m
for i in range(m):
a, b = list(map(int, input().split()))
eg[a].append(b)
eg[b].append(a)
al[i], bl[i] = a, b
ans = 0
for i in range(m):
x, y = al[i], bl... | n, m = list(map(int, input().split()))
eg = [[] for _ in range(n + 1)]
al = [0] * m
bl = [0] * m
for i in range(m):
a, b = list(map(int, input().split()))
eg[a].append(b)
eg[b].append(a)
al[i], bl[i] = a, b
ans = 0
for i in range(m):
x, y = al[i], bl[i]
q = [1]
seen = {1}
... | p03575 |
from collections import deque
n, m = list(map(int, input().split()))
eg = [[] for _ in range(n + 1)]
al = [0] * m
bl = [0] * m
for i in range(m):
a, b = list(map(int, input().split()))
eg[a].append(b)
eg[b].append(a)
al[i], bl[i] = a, b
ans = 0
for i in range(m):
x, y = al[i], bl... | from collections import deque
n, m = list(map(int, input().split()))
eg = [[] for _ in range(n + 1)]
al = [0] * m
bl = [0] * m
for i in range(m):
a, b = list(map(int, input().split()))
eg[a].append(b)
eg[b].append(a)
al[i], bl[i] = a, b
ans = 0
for i in range(m):
x, y = al[i], bl... | p03575 |
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
n,m = list(map(int,input().split())) #n:頂点数 w:辺の数
l=[list(map(int,input().split())) for i in range(m)]
ans=0
... | import heapq
def dijkstra_heap(s):
#始点sから各頂点への最短距離
d = [float("inf")] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heapq.heappush(edgelist,e)
while len(edgelist):
minedge = heapq.heappop(edgelist)
#まだ使われてない頂点... | p03575 |
N, M = [int(_) for _ in input().split()]
paths = [[0] * (N + 1) for _ in range(N + 1)]
def has_path(c, t, arrived):
if c == t: return True
for i in range(1, N + 1):
if i in arrived: continue
if paths[c][i]:
arrived.append(i)
if has_path(i, t, arrived):
... | N, M = [int(_) for _ in input().split()]
paths = [[0] * (N + 1) for _ in range(N + 1)]
edges = []
for i in range(M):
a, b = [int(_) for _ in input().split()]
paths[a][b] = 1
paths[b][a] = 1
edges.append((a, b))
class UF:
def __init__(self, v):
self.parent = None
se... | p03575 |
N,M=[int(i) for i in input().split()]
graph = [[] for _ in range(N+1)]
from collections import deque
aa = [0] * M
bb = [0] * M
ans = 0
for i in range(M):
a,b = [int(j) for j in input().split()]
graph[a].append(b)
graph[b].append(a)
aa[i] = a
bb[i] = b
import copy
grapha = copy.deepcopy(... | #template
def inputlist(): return [int(j) for j in input().split()]
from collections import Counter
#template
#issueから始める
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
els... | p03575 |
import copy
#深さ優先探索
def dfs(node, E_st_tmp):
#辺の集合が存在しないとき
if len(E_st_tmp) == 0:
#全ての頂点を覗いた時
if not (False in V_look):
return
else:#辺の集合もないし、頂点もない。
return
elif not (False in V_look): #辺の集合があっても全部見る時ある。
return
#ここで探索する
... | import sys
import copy
N, M = list(map(int, input().split()))
V = []
E = []
for i in range(N):
V.append(set())
seen = []
seen = [False] * N
count = 0
def dfs(node):
global V
global seen
#注目ノードは訪問済みか?
if seen[node]==True:
return
seen[node]=True
f... | p03575 |
import copy
N,M = list(map(int,input().split()))
graph = [[] for _ in range(N)]
edges = []
for _ in range(M):
a,b = list(map(int,input().split()))
graph[a-1].append(b-1)
graph[b-1].append(a-1)
edges.append([a-1,b-1])
def dfs(G,v):
seen[v] = True
#print(seen)
for nv in G[v]:
... | N,M = list(map(int,input().split()))
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
def unite(x,y):
x = find(x)
y = find(y)
if x == y:
return False
else:
if par[x] > par[y]:
x,y = y,x
... | p03575 |
def DFS(N, copyedge):
matrix = [[] for i in range(N)]
for a, b in copyedge:
matrix[a].append(b)
matrix[b].append(a)
check = [True]*N
check[0] = False
Que = [0]
while len(Que) != 0:
now = Que.pop()
for i in matrix[now]:
if check[i... | N, M = list(map(int, input().split()))
ab = [[] for i in range(M)]
ans = 0
for i in range(M):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
ab[i] = [a, b]
def cal(AB):
matrix = [[] for i in range(N)]
for a, b in AB:
matrix[a].append(b)
matrix[b].append(a)
c... | p03575 |
from collections import deque
n, m = list(map(int, input().split()))
E = [[*[int(x)-1 for x in input().split()]] for _ in range(m)]
V = [[] for _ in range(n)]
for a,b in E:
V[a].append(b)
V[b].append(a)
def dfs(a,b,f,i):
# if i>=n:
# return
if vis[f] == 1: return
vis[f] = 1
... | n, m = list(map(int, input().split()))
E = [[*[int(x)-1 for x in input().split()]] for _ in range(m)]
V = [[] for _ in range(n)]
for a, b in E:
V[a].append(b)
V[b].append(a)
def dfs(a, b, f):
if vis[f] == 1: return
vis[f] = 1
for t in V[f]:
if f==a and t == b: continue
... | p03575 |
from collections import deque
def dfs(n, start, graph):
visited = [False] * n
stack = deque()
stack.append(start)
visited[start] = True
while stack:
q = stack.popleft()
nxts = graph[q]
for nxt in nxts:
if not visited[nxt]:
visited[nxt] = True
stack.append(nxt)
... | n,m=list(map(int,input().split()))
edge=[[] for _ in range(n+1)]
eab=[]
for i in range(m):
a,b=list(map(int,input().split()))
edge[a-1].append(b-1)
edge[b-1].append(a-1)
eab.append([a-1,b-1])
def dfs(visited,count,node):
visited[node]=True
count+=1
ev=edge[node]
for node i... | p03575 |
from collections import defaultdict as dd
n,m = list(map(int, input().split()))
dic = dd(list)
l = []
cnt = 0
for _ in range(m):
a,b = list(map(int, input().split()))
l.append((a,b))
dic[a].append(b)
dic[b].append(a)
def con(x):
visit.add(x)
for i in dic[x]:
if i in visit:
continue
... | int1 = lambda x: int(x) - 1
N, M = list(map(int, input().split()))
G = [list() for _ in range(N)]
edges = [tuple(map(int1, input().split())) for _ in range(M)]
for u,v in edges:
G[u].append(v)
G[v].append(u)
pre = [-1]*N
low = [-1]*N
def detect_bridge(v, p=None, c=0):
ret = list()
pre[v... | p03575 |
from collections import deque
from collections import defaultdict
edges = defaultdict(list)
N,M = list(map(int, input().split()))
pairs = []
for i in range(M):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
pairs.append((a,b))
ans = 0
# M本目の辺を切って全探索
for i in range(M):
edges = defa... | """
DFS
"""
from collections import defaultdict
N,M = list(map(int, input().split()))
pairs = []
for i in range(M):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
pairs.append((a,b))
def dfs(s):
global visited,edges
if visited[s]:return 0
visited[s] = True
ns = ed... | p03575 |
def main():
from collections import deque
def traversal(ignore_idx):
s = 0
visited = [-1] * N
visited[s] = 0
dq = deque([s])
while dq:
v = dq.popleft()
for u, edge_idx in g[v]:
if ~visited[u] or edge_idx == ignore_idx:... | def main():
from collections import deque
N, M = list(map(int, input().split()))
g = tuple(set() for _ in range(N))
es = []
for _ in range(M):
a, b = (int(x) - 1 for x in input().split())
g[a].add(b)
g[b].add(a)
es.append((a, b))
cnt = 0
for e... | p03575 |
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return 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(): return... | import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return 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(): return... | p03575 |
from queue import Queue
N, M = list(map(int, input().split()))
a, b = [0] * M, [0] * M
g = [[False] * N for _ in range(N)]
for i in range(M):
a[i], b[i] = list(map(int, input().split()))
g[a[i]-1][b[i]-1] = True
g[b[i]-1][a[i]-1] = True
ans = 0
for _a, _b in zip(a, b):
g[_a-1][_b-1] = False
... | class UnionFind(object):
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self._size = n
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
re... | p03575 |
N, M = list(map(int,input().split())) # N:ノード数、M:エッジ数
visited = [False for i in range(N)] # ノードの訪問済みフラグ
edges = [[i-1 for i in map(int,input().split())] for j in range(M)] # エッジ情報のインプット
graph = [[False for i in range(N)] for j in range(N... | N, M = list(map(int,input().split())) # N:ノード数、M:エッジ数
visited = [False for i in range(N)] # ノードの訪問済みフラグ
edges = [[i-1 for i in map(int,input().split())] for j in range(M)] # エッジ情報のインプット
graph = [[False for i in range(N)] for j in range(N... | p03575 |
# coding: utf-8
N, M = list(map(int, input().split()))
graph = [[False for i in range(N)] for j in range(N)]
visited = [False for i in range(N)]
def dfs(v):
visited[v] = True
for k in range(N):
if not graph[v][k]:
continue
if visited[k]:
continue
dfs(k)... | # coding: utf-8
N, M = list(map(int, input().split()))
graph = [[False for i in range(N)] for j in range(N)]
visited = [False for i in range(N)]
def dfs(v):
visited[v] = True
for k in range(N):
# 橋がなければわたらない
if not graph[v][k]:
continue
# すでに訪れていたら渡らない
if v... | p03575 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | p03575 |
N, M = list(map(int, input().split()))
E = [list(map(int, input().split())) for k in range(M)]
ans = 0
for k in range(M):
F = E[:k]+E[k+1:]
D = [[10**9+7 for l in range(N)] for m in range(N)]
for p in range(N):
D[p][p] = 0
for n in F:
D[n[0]-1][n[1]-1] = D[n[1]-1][n[0]-1] = 1
... | N, M = list(map(int,input().split()))
P = [list(map(int,input().split())) for k in range(M)]
ans = 0
for i in range(M):
T = P[:i]+P[i+1:]
G = [[] for k in range(N)]
V = [0 for k in range(N)]
for e in T:
G[e[0]-1].append(e[1]-1)
G[e[1]-1].append(e[0]-1)
def dfs(visited,g... | p03575 |
import copy
N,M=list(map(int,input().split()))
A=[]
L=[[1000for i in range(N)]for j in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
A.append([a,b])
L[a-1][b-1]=1
L[b-1][a-1]=1
for j in range(N):
L[j][j]=0
#print(L)
l=copy.deepcopy(L)
cnt=0
for k in range(M)... | import copy
N,M=list(map(int,input().split()))
A=[]
for i in range(M):
a,b=list(map(int,input().split()))
A.append([a,b])
ANS=0
for i in range(M):
L=[[]for _ in range(N+1)]
for j in range(M):
if i==j:
continue
else:
L[A[j][0]].append((A[j][1],... | p03575 |
n,m=list(map(int,input().split()))
g=[[] for i in range(1+n)]
v=[0]*(1+n)
e=[]
for i in range(m):
a,b=list(map(int,input().split()))
e.append((a,b))
g[a].append(b)
g[b].append(a)
def dfs(st,ed):
q=[]
q.append(st)
while q:
cur=q.pop()
v[cur]=1
if c... | n,m=list(map(int,input().split()))
g=[[] for i in range(1+n)]
v=[0]*(1+n)
e=[]
for i in range(m):
a,b=list(map(int,input().split()))
e.append((a,b))
g[a].append(b)
g[b].append(a)
def dfs(st,ed):
q=[]
q.append(st)
while q:
cur=q.pop()
v[cur]=1
if c... | p03575 |
from collections import deque
N, M = list(map(int, input().split()))
V = [list(map(int, input().split())) for _ in range(M)]
class UnionFind():
def __init__(self, n):
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
... | from collections import deque
N, M = list(map(int, input().split()))
V = [list(map(int, input().split())) for _ in range(M)]
class UnionFind():
def __init__(self, n):
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
... | p03575 |
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rank = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
i... | import sys
input = sys.stdin.buffer.readline
n,m=list(map(int,input().split()))
es=[list(map(int,input().split())) for _ in range(m)]
def check(s,t):
q=[0]
vis=[0]*n
vis[0]=1
while q:
c=q.pop()
for x in con[c]:
if (c==s and x==t) or (c==t and x==s) or vis[x]:
continue
vis[x]=1
q.appen... | p03575 |
from collections import deque
n,m = list(map(int,input().split()))
G = [[0]*n for _ in range(n)]
E = []
for i in range(m):
a,b = list(map(int,input().split()))
a,b = a-1, b-1
G[a][b] = 1
G[b][a] = 1
E.append((a,b))
ans = 0
for e in E:
del_a, del_b = e
#対象の辺を消す
G[d... | class UnionFind:
#要素数nで初期化
#インスタンス変数の初期化
def __init__(self, n):
#root : 木の要素数
#rnk : 木の高さ(rank)
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
"""ノードxのrootノードを見つける"""
def Find_Root(self, x):
if self.root[x] < 0:
re... | p03575 |
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
edges = [(0,0) for _ in range(M)]
for i in range(M):
a,b = list(map(int, input().split()))
edge[a-1].append(b-1)
edge[b-1].append(a-1)
edges[i] = (a-1,b-1)
import sys
sys.setrecursionlimit(10**8)
def dfs(v, es):
#pri... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | p03575 |
#!/usr/bin/env python3
from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.buffer.readline
INF = float('inf')
n_nodes, m_edges = list(map(int, input().split()))
edges = []
for _ in range(m_edges):
... | #!/usr/bin/env python3
from pprint import pprint
import sys
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
N, M = list(map(int, input().split()))
edges = []
for _ in range(M):
u, v = list(map(int, input().split()))
edges.append([u-1, v-1])
# pprint(edges)
# ある辺iを除いた残りの辺にそれぞれに対してunite... | p03575 |
n,m=list(map(int,input().split()))
e=[[] for _ in range(n)]
b=[]
for i in range(m):
x,y=list(map(int,input().split()))
e[x-1].append(y-1)
e[y-1].append(x-1)
b.append([x-1,y-1])
def ne(now,s,visit):
visit.append(now)
for i in e[now]:
if i not in visit:
ne(i, s, visit[:])
elif l... | from itertools import combinations
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.Find_Root(self.root[x])
... | p03575 |
def root(i):
if par[i] < 0:
return i
else:
return root(par[i])
def size(a):
return -par[root(a)]
def union(a,b):
a = root(a)
b = root(b)
if a == b:#親が等しい
return False
if size(a) < size(b):#サイズが大きい方に繋げる
a,b = b,a
par[a] += par[b]
par[... | def dfs(current):
for maps in Graph[current]:
if maps in already:
continue
else:
already.append(maps)
dfs(maps)
n,m = list(map(int,input().split()))
ans = 0
Edges = []
for _ in range(m):
Edges.append([int(j)-1 for j in input().split()])
for i i... | p03575 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03575 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03575 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03575 |
N, M = list(map(int, input().split()))
graph = [[0 for i in range(N)] for j in range(N)]
edges = []
for m in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
edges.append([a,b])
graph[a][b] = 1
graph[b][a] = 1
ans = 0
for a,b in edges:
graph[a][b] = 0
graph[b... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | p03575 |
n, m = list(map(int, input().split()))
d = [[float("inf")] * n for i in range(n)]
edge = []
for i in range(m):
a, b = list(map(int, input().split()))
edge.append((a, b))
d[a - 1][b - 1] = 1
d[b - 1][a - 1] = 1
ans = 0
for a in range(m):
d_s = [x[:] for x in d]
x, y = edge[a]
d_s[... | n, m = list(map(int, input().split()))
edge = [list(map(int, input().split())) for i in range(m)]
ans = 0
for i in edge:
l = list(range(n))
for j in edge:
if j != i:
l = [l[j[0] - 1] if l[k] == l[j[1] - 1] else l[k] for k in range(n)]
if len(set(l)) != 1:
ans += 1
print... | p03575 |
n, m = list(map(int, input().split()))
li = []
count = 0
def check_dfs(node_list):
traveled = []
return dfs(node_list, traveled, 0)
def dfs(node_list, t_list, position):
t_list.append(position)
if len(t_list) == n:
return 0
for i in node_list[position]:
if i not in t... | import sys
sys.setrecursionlimit(10**5)
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n)]
edge = []
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
graph[a].append(b)
graph[b].append(a)
edge.append([a, b])
cnt = 0
def dfs(start, ... | p03575 |
N, M = list(map(int, input().split()))
graph = [[False for j in range(N)] for i in range(N)]
am = [0] * M
bm = [0] * M
def dfs(visited, n):
visited[n] = True
for k, v in enumerate(visited):
if v:
continue
if not graph[n][k]:
continue
visit... | N, M = list(map(int, input().split()))
graph = [[] for i in range(N)]
for i in range(M):
ai, bi = list(map(int, input().split()))
ai -= 1
bi -= 1
graph[ai].append(bi)
graph[bi].append(ai)
rank = [N] * N
low = [N] * N
visited = [False] * N
def dfs(k, pos, parent):
rank[pos] ... | p03575 |
n, m = list(map(int, input().split()))
INF = 10**9
a = [[INF]*n for i in range(n)]
hen_m = []
for i in range(m):
x1, x2 = list(map(int, input().split()))
x1 -= 1
x2 -= 1
hen_m.append([x1, x2])
a[x1][x2] = 1
a[x2][x1] = 1
for i in range(n):
a[i][i] = 0
#ワーシャルフロイド
def warshall(... | n, m = list(map(int, input().split()))
a = [[False]*n for i in range(n)]
hen_m = []
for i in range(m):
x1, x2 = list(map(int, input().split()))
x1 -= 1
x2 -= 1
hen_m.append([x1, x2])
a[x1][x2] = True
a[x2][x1] = True
for i in range(n):
a[i][i] = True
#ワーシャルフロイド
def warshall(n,... | p03575 |
import sys
sys.setrecursionlimit(10**9)
n,m=list(map(int,input().split()))
ab=[[0,0] for i in range(m)]
for i in range(m):
ab[i][0],ab[i][1]=list(map(int,input().split()))
ans=0
for i in range(m):
root=[j for j in range(n+1)]
root[0]=1
def r(x):
if root[x]==x:
return x
... | from _collections import deque
n,m=list(map(int,input().split()))
ab=[[0,0] for i in range(m)]
for i in range(m):
ab[i][0],ab[i][1]=list(map(int,input().split()))
ans=0
for i in range(m):
edg=[[] for j in range(n+1)]
dep=[-1]*(n+1)
dep[0]=1
dep[1]=1
for j in range(m):
if j!=i... | p03575 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.