25-05-2006, 15:06
|
|
|
חבר מתאריך: 09.05.05
הודעות: 303
|
|
code jam עזרה בהבנת הבעיה
אני לא מצליח לתרגם את האתגר אם למישהו משעמם אבל ממש ממש משעמם והוא יודע אנגלית ממש טוב
אז אם אתה יכול לתרגם את זה אז בבבבבבבבבבבבבבבקקקקקקקקקקקשששששששההההההה(בקשה)
A multinational firm wants to create a communication network between asteroids. To achieve this, they will use brand new equipment where communication is made between pairs of stations in the following manner:
Each station throws a ray pointing directly to the other, and at the point where both rays meet, information is exchanged and brought back to the original stations. It is possible to save power this way because the maximum ranges of the two stations are combined to produce a greater range. For example, if two stations are ten miles apart, it is sufficient for one station to have power for a range of 6 miles and the other to have power for a range of 4 miles.
The firm wants every asteroid to be able to communicate directly with each of the other asteroids. One station will be bought for each asteroid. The cost of this equipment increases rapidly with power, so it is always better to buy stations that are as weak as possible while still providing enough range for the required communication. There are multiple configurations that will satisfy the firm's requirement. Choose the one where the range of the most powerful station is minimized, and if there are still multiple configurations, choose the one among them where the range of the second most powerful station is minimized, and so on.
You will be given the 3-D coordinates of the asteroids in three vector <int>s x, y and z. The x, y and z coordinates of the ith asteroid will be given by the ith element of x, y and z respectively. Choose the stations' ranges as described above and return the range of the least powerful station.
|