- Today
- Total
Running Deeper C/C++/Java
Lasers and Mirrors
시간 제한메모리 제한제출정답맞은 사람정답 비율
| 2 초 | 512 MB | 140 | 52 | 45 | 38.462% |
문제
For some reason, Farmer John's cows always seem to be running laser light shows.
For their latest show, the cows have procured a large powerful laser -- so large, in fact, that they cannot seem to move it easily from the location where it was delivered. They would like to somehow send the light from the laser to the barn on the other side of FJ's property. Both the laser and the barn can be considered to be located at points in the 2D plane on a map of FJ's farm. The cows plan to point the laser so that it sends a beam of light out either horizontally or vertically (i.e., aligned with the x or y axes). They will then bounce this beam off a number of mirrors to direct it to the barn.
On the farm there are N fence posts (1≤N≤100,000) located at distinct 2D points (also distinct from the laser and the barn) at which the cows can mount mirrors. The cows can choose not to mount a mirror on a fence post, in which case the laser would simply pass straight over the top of the post without changing direction. If the cows do mount a mirror on a fence post, they align it diagonally like / or \ so that it will re-direct a horizontal beam of light in a vertical direction or vice versa.
Please compute the minimum possible number of mirrors the cows need to use in order to re-direct the laser to the barn.
입력
The first line of input contains 5 space-separated integers: N,xL,yL,xB,yB, where (xL,yL) is the location of the laser and (xB,yB) is the location of the barn. All coordinates are between 0 and 1,000,000,000.
The next N lines each contain the x and y locations of a fence post, both integers in the range 0…1,000,000,000.
출력
Please output the minimum number of mirrors needed to direct the laser to the barn, or -1 if this is impossible to do.
This is a very complicated Dijkstra/BFS problem. The edges are basically directly adjacent mirrors that are at either the same X, or the same Y coordinate.(Adjacent meaning the next mirror on the axis)
Only those edges are connected, which removes the need for a complex BFS. The edge weights all vary, so you have to use Dijkstra, unless you go with a modified BFS(basically dijkstra)
Lasers and Mirrors
시간 제한메모리 제한제출정답맞은 사람정답 비율
| 2 초 | 512 MB | 140 | 52 | 45 | 38.462% |
문제
For some reason, Farmer John's cows always seem to be running laser light shows.
For their latest show, the cows have procured a large powerful laser -- so large, in fact, that they cannot seem to move it easily from the location where it was delivered. They would like to somehow send the light from the laser to the barn on the other side of FJ's property. Both the laser and the barn can be considered to be located at points in the 2D plane on a map of FJ's farm. The cows plan to point the laser so that it sends a beam of light out either horizontally or vertically (i.e., aligned with the x or y axes). They will then bounce this beam off a number of mirrors to direct it to the barn.
On the farm there are N fence posts (1≤N≤100,000) located at distinct 2D points (also distinct from the laser and the barn) at which the cows can mount mirrors. The cows can choose not to mount a mirror on a fence post, in which case the laser would simply pass straight over the top of the post without changing direction. If the cows do mount a mirror on a fence post, they align it diagonally like / or \ so that it will re-direct a horizontal beam of light in a vertical direction or vice versa.
Please compute the minimum possible number of mirrors the cows need to use in order to re-direct the laser to the barn.
입력
The first line of input contains 5 space-separated integers: N,xL,yL,xB,yB, where (xL,yL) is the location of the laser and (xB,yB) is the location of the barn. All coordinates are between 0 and 1,000,000,000.
The next N lines each contain the x and y locations of a fence post, both integers in the range 0…1,000,000,000.
출력
Please output the minimum number of mirrors needed to direct the laser to the barn, or -1 if this is impossible to do.
This is a very complicated Dijkstra/BFS problem. The edges are basically directly adjacent mirrors that are at either the same X, or the same Y coordinate.(Adjacent meaning the next mirror on the axis)
Only those edges are connected, which removes the need for a complex BFS. The edge weights all vary, so you have to use Dijkstra, unless you go with a modified BFS(basically dijkstra)