C - Typical Stairs O(N) import sys import math import heapq import itertools from collections import deque from functools import reduce # main def main(): MOD = 10**9+7 N, M = list(map(int, input().split())) ok = [False] * (N+1) dp = [0] *…

F - 最小全域木問題 O(N) import sys import math import heapq import itertools from collections import deque from functools import reduce # main def main(): N, M = list(map(int, input().split())) G = [] for _ in range(N): G.append([]) for _ …

E - 全点対最短経路問題 O(N3) import sys import math import heapq import itertools from collections import deque from functools import reduce # main def main(): INF = 10**18 N, M = list(map(int, input().split())) dist = [] for i in range(N)…

C - Cat Snuke and a Voyage O(N) heapqを使用し、ダイクストラに対応。 from asyncio import QueueFull import sys import math import heapq import itertools from collections import deque from functools import reduce # main def main(): N, M = lis…