write a functionget_direction(start, end) that returns the end station that is in the direction of travel between the start and end , or None if the start and end is not on the same line.use python Boston SubwayThe Boston Subway e has four different colored trains, some of which have multipleroutes. We have simplified the routes so that each train has a single route with thefollowing stations (in order from north to south) and that each colored line intersectswith another colored line at exactly one station.• Red Line: Alewife, Davis, Porter, Harvard, Central, Kendall/MIT, Charles/MGH,Downtown Crossing, South Station, Broadway, Andrew, JFK/UMass• Orange Line: Oak Grove, Malden Center, Wellington, Assembly, Sullivan Square,Community College, North Station, Haymarket, State, Downtown Crossing,Chinatown, Tufts Medical Center, Back Bay, Mass Avenue, Ruggles, RoxburyCrossing, Jackson Square, Stony Brook, Green Street, Forest Hills• Blue Line: Wonderland, Revere Beach, Beachmont, Suffolk Downs, Orient Heights,Wood Island, Airport, Maverick, Aquarium, State• Green Line: Haymarket, Government Center, Park Street, Boylston, Arlington,Copley, Haynes Convention Center, Kenmore, Blandford Street, Boston UniversityEast, Boston University Central, Boston University West, Saint Paul Street,Pleasant Street, Babcock Street, Packards Corner, Harvard Avenue, Griggs Street,Allston Street, Warren Street, Washington Street, Sutherland Road, Chiswick Road,Chestnut Hill Avenue, South Street, Boston CollegeStation names must match exactly (unforgiving about upper/lowercase andabbreviations) with the exception of names that have a "/" in them. These stations canbe referred to be either one. For example, both "Kendall" and "MIT" refer to the samestation.Note: The simplification of our train lines is such that each line intersects with otherlines in exactly one station. But not all lines intersect every other line.

Answered: write a function get_direction(start,…

write a function get_direction(start, end) that returns the end station that is in the direction of travel between the start and end , or None if the start and end is not on the same line. use python

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations

Problem 7P

See similar textbooks

Similar questions

Q1.nq. Given a 2d grid map of '1's (land) and '0's (water),count the number of islands.An island is surrounded by water and is formed byconnecting adjacent lands horizontally or vertically.You may assume all four edges of the grid are all surrounded by water. Example 1: 11110110101100000000Answer: 1 Example 2: 11000110000010000011Answer: 3""" def num_islands(grid): count = 0 for i in range(len(grid)): for j, col in enumerate(grid[i]): if col == 1: dfs(grid, i, j) count += 1 Please code it. .
Q. Given a 2d grid map of '1's (land) and '0's (water),count the number of islands.An island is surrounded by water and is formed byconnecting adjacent lands horizontally or vertically.You may assume all four edges of the grid are all surrounded by water. Example 1: 11110110101100000000Answer: 1 Example 2: 11000110000010000011Answer: 3""" def num_islands(grid): count = 0 for i in range(len(grid)): for j, col in enumerate(grid[i]): if col == 1: dfs(grid, i, j) count += 1 Please code it. .
a. There are ten Egyptian stone statutes standing in a row in an art gallery hall. A new curator wants to move them so that the statues are ordered by their height. How should this be done to minimize the total distance that the statues are moved?
Correct answer will be upvoted else downvoted. table can be addressed as a square shape with stature h and width w, isolated into h×w cells. Let (i,j) signify the cell in the I-th line and the j-th segment of the square shape (1≤i≤h; 1≤j≤w). Into every cell of the table you can either put a plate or keep it unfilled. As every visitor must be situated close to their plate, you can just put plates on the edge of the table — into the first or the last line of the square shape, or into the first or the last segment. Officially, for every cell (i,j) you put a plate into, no less than one of the accompanying conditions should be fulfilled: i=1, i=h, j=1, j=w. To make the visitors agreeable, no two plates should be placed into cells that have a typical side or corner. All in all, if cell (i,j) contains a plate, you can't place plates into cells (i−1,j), (i,j−1), (i+1,j), (i,j+1), (i−1,j−1), (i−1,j+1), (i+1,j−1), (i+1,j+1). Put whatever number plates on the table as could be…
An airline association assigns three-letter codes to represent airport locations. For example, the airport code for Clark, Pampanga, is CPP. Notice that repetition is allowed in forming this code. How many airport codes are possible?
As an investor, I always check the stock market in order to find good companies to invest in. Recently, I found that the best companies to invest in, are the ones that have largest sum formed by a strictly increasing set of numbers (a set where the next element is always greater than the current element). But before I invest, I need to know the position of the first element of the consecutive increasing numbers. Help me so we can start investing already! Note: If it is already the last element of the row in the array, the next element is the first element of the next row, if there exists a next row. Input 1. Number of rows Description This is the number of rows of the multidimensional array. 2. Number of columns Description This is the number of columns of the multidimensional array. 3. Elements of the multidimensional array Output The first line will contain a message prompt to input the number of rows. The second line will contain a message prompt to input the…
After college, a group of students of a certain height planned to go to the movies. The cinema they go to is quite unique because the number of cinema rows is always 2 and the number of seats is as many as the number of students. Because this is a unique cinema, the way they sit is also unique. They will try to minimize their height difference with the one next to it so that the biggest height difference of each pair of students next to each other is as minimal as possible. Example: There are 6 students with height of 1, 6, 9, 7, 2, and 3. There are various sequences that can produce the biggest difference in height. Ordering 1:1 3 62 7 9Difference 1 and 3 is 2.Difference 3 and 6 is 3.Difference 2 and 7 is 5.Difference 7 and 9 is 2.So the biggest difference in height is 5. Ordering 2:1 3 26 7 9The biggest difference in height is 2.This difference is also an optimal answer. Format Input : There are T test cases. Each testcase contains integers N which indicates the number of students…
You are given a 2 by n grid, where the cell on row i column j contains a non-negative number ai,j . You can start at either cell in the lefttmost column, and your goal is to reach either cell in the rightmost column by a sequence of moves. You can move to an adjacent cell (if it exists) in each of the 4 cardinal directions (up,down, left and right). A path achieves a score equal to the sum of values in its cells. Note that a cell which is used twice in a path only counts its value once to the score of that path.Design an algorithm which runs in O(n) time and finds a path of minimum score from the leftmost column to the rightmost column.
The school marching band consists of students, dressed red or black, standing in an n x n grid. The music teacher wants to designate a subset of the red-dressed students such that no two red-dressed students are in the same row or column. Design and explain an algorithm that takes in a grid of red-dressed and black-dressed students and determines the size and a configuration of the largest subset of the red-dressed that can be designated.
Suppose a line segment starts at (x0, y0) and ends at (x1, y1) where, x0, y0, x1 and y1 are sequentially the first, second, third and fourth pair of digits from the left in your student ID. STUDENT ID: 21341040 Q:- Simulate the midpoint line drawing algorithm to find the first four intermediary pixels of this line after (x0, y0); or, all of them if the line reaches (x1, y1) in less than four pixels.
1. A set of integers are relatively prime to each other if there is no integer greater than 1 that divides all the elements. Furthermore, in Number Theory, it is known that the Euler function,ϕ (n), expresses the number of positive integers less than n that are relatively prime with n. Choose the alternative that has the correct value of ϕ(n) for every n below. A) ϕ(5) = 4 B) ϕ(6) = 2 C) ϕ(10) = 3 D) ϕ(14) = 6 E) ϕ(17) = 16
Problem Alice was given a number line containing every positive integer, x, where 1<=x<=n. She was also given m line segments, each having a left endpoint, l (1<=l<=n), a right endpoint, r (1<=r<=n), and an integer weight, w. Her task is to cover all numbers on the given number line using a subset of the line segments, such that the maximum weight among all the line segments in the chosen subset is minimal. In other words, let S=(l1,r1,w1),(l2,r2,w2),....,(lk,rk,wk), represent a set of k line segments chosen by Alice, max(w1,w2,...,wk) should be minimized. All numbers 1,2,....n should be covered by at least one of k the chosen line segments. It is okay for the chosen line segments to overlap. You program should output the minimized maximum weight in the chosen subset that covers all the numbers on the number line, or -1 if it is not possible to cover the number line. Input format The first line of the input contains an integer, n - denoting the range of numbers…