Useless Flights

Simple+

RU English

- Chief, we have a new flight schedule. It just require your signature and we are ready to launch.

- Wow, so many planes! I’d like to make sure that we really need so many of them.

- Of course.

- Let’s check!

This task is a continuation of the “Cheapest Flights” mission.

Here you have a flight schedule by which you need to find out whether all flights are really necessary.

For example: If from the point A to point C you can fly directly for $ 100, but you can also go through the point B (from A to B, and then from B to C) for $ 90, then connection A – C isn’t really needed. But if the price from A to C is $ 90 or less, then this connection remains on the schedule.

Input: An array of all possible connections. Each element in the array is also an array of 3 elements: the first city, second city and flight price.

Output: An array of the unnecessary flight indices.

Example:

useless_flight([['A', 'B', 50],
  ['B', 'C', 40],
  ['A', 'C', 100]]) == [2]
useless_flight([['A', 'B', 50],
  ['B', 'C', 40],
  ['A', 'C', 90]]) == []

list
pathfinding

by:

oduvan

Rating: 0 Login to vote

Solve as a guest
Sign in to your account

Settings

Code:

Auto close brackets and quotes
Auto scroll to the best solutions after successful check
Highlight the same word

Save & Reload Close

CheckiO Extensions

CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.

In order to install CheckiO client you'll need installed Python (version at least 3.8)

Install CheckiO Client first:

pip3 install checkio_client

Configure your tool

checkio --domain=py config --key=

Sync solutions into your local folder

checkio sync

(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)