CPMagical CP Library

Problem solution · Python

ABC369 E — Sightseeing Tour

ABC369 E — Sightseeing Tour : a Python solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to KATO-Hiro AtCoder Solutions.

Technique
Direct simulation
Source
KATO-Hiro AtCoder Solutions
Length
85 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For ABC369 E — Sightseeing Tour , the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 85 lines of Python from the credited upstream file abc369_e.py.
  • The implementation visibly relies on sequence storage, ordered lookup.
  • No explicit loop blocks detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from KATO-Hiro AtCoder Solutions by KATO-Hiro and is used under the CC0-1.0 licence.

Open problem ↗Original source ↗
Full codeABC369 E — Sightseeing Tour · PythonPython
Use this to learn the idea, then write your own version.
# -*- coding: utf-8 -*-  def warshall_floyd(dist):    """    Args:        Distance matrix between two points.     Returns:        Matrix of shortest distance.     Landau notation: O(n ** 3).    """     v_count = len(dist[0])     for k in range(v_count):        for i in range(v_count):            for j in range(v_count):                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])     return dist  def main():    import sys    from itertools import permutations, product     input = sys.stdin.readline     n, m = map(int, input().split())    inf = 10**18    graph = [[inf for _ in range(n)] for _ in range(n)]     # 対角は0    for i in range(n):        graph[i][i] = 0     uvt = list()     for _ in range(m):        ui, vi, ti = map(int, input().split())        ui -= 1        vi -= 1        uvt.append((ui, vi, ti))        graph[ui][vi] = min(graph[ui][vi], ti)        graph[vi][ui] = min(graph[vi][ui], ti)     # 前計算    dist = warshall_floyd(graph)    # print(dist)    q = int(input())     # K! * 2 ^ Kパターンを全て試す    for _ in range(q):        ki = int(input())        b = list(map(lambda x: int(x) - 1, input().split()))        ans = inf         for pattern in permutations(b):            for bit in range(1 << ki):                prev_vi = 0                cost = 0                 for i, pi in enumerate(pattern):                    ui, vi, ti = uvt[pi]                     if (bit >> i) & 1:                        ui, vi = vi, ui                     cost += dist[prev_vi][ui]                    cost += ti                     prev_vi = vi                 cost += dist[prev_vi][n - 1]                 ans = min(ans, cost)         print(ans)  if __name__ == "__main__":    main()

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗