From IOI Wiki
Jump to: navigation, search

Public task: Buses

General information

  • Type: Batch
  • Topic(s):
  • Task: You are given the description of cyclic bus routes within a grid, each with a fee to pay if used, and the maximum distance you can walk within that grid. Your goal is to find the cheapest path between two intersections, using a combination of bus and walking.
  • Solution:
  • Difficulty: Bronze

Task details

  • Task statement: Language not specified!
  • Solution: Document missing!

Full archive

  • Zip file missing!