We have prepared 9 tests, 1-6 cases each, which makes total 27 cases.

streets0.in
Test from the problem.

streets1.in
City 1.
Easy test with big numbers -- university (1999999998, 1999999998) closed in a square of streets.
City 2.
Test in which Peter does not need to cross any streets, but his route will be rather long.

streets2.in
Full greed of streets.
City 1.
Full grid of streets, home and university in the corners.
City 2.
Full grid of streets, home and university in the corners, but inside the grid.
City 3.
Full grid of streets, home and university somewhere inside it.
City 4.
Full grid of streets, streets of maximum length (2000000000).

streets3.in
Cocentric squares
City 1.
Cocentric squares in a city of moderate size.
City 2.
Cocentric squares in a big city.

streets4.in
City 1.
50 random streets in a city which side's length equals 2000000000.
City 2.
100 random streets in a city which side's length equals 500.
City 3.
100 random streets in a city which side's length equals 2000000000.
City 4.
500 random streets in a city which side's length equals 50.
City 5.
500 random streets in a city which side's length equals 500.
City 6.
500 random streets in a city which side's length equals 2000000000.

streets5.in
Random squares.
City 1.
125 random squares in a city which side's length equals 50.
City 2.
125 random squares in a city which side's length equals 500.
City 3.
125 random squares in a city which side's length equals 2000000000.

streets6.in
Overlaping squares.

streets7.in
City 1.
University and Peter's home are overlaping.
City 2.
X-coordinate of university and Peter's home are equal.
City 3.
Y-coordinate of university and Peter's home are equal.

streets8.in
City 1.
Maximum number of different x-coordinates.
City 2.
Maximum number of different y-coordinates.

streets9.in
City 1.
All streets have one coordinate equal to the coordinate of university or Peter's home.
City 2.
Majority of streets has one coordinate equal to the coordinate of university or Peter's home.
