Комментарии 8
НЛО прилетело и опубликовало эту надпись здесь
Problem A
A Careful Approach
Input: approach.in
If you think participating in a programming contest is stressful, imagine being an air traffic controller. With
human lives at stake, an air traffic controller has to focus on tasks while working under constantly changing
conditions as well as dealing with unforeseen events.
Consider the task of scheduling the airplanes that are landing at an airport. Incoming airplanes report their
positions, directions, and speeds, and then the controller has to devise a landing schedule that brings all
airplanes safely to the ground. Generally, the more time there is between successive landings, the “safer” a
landing schedule is. This extra time gives pilots the opportunity to react to changing weather and other surprises.
Luckily, part of this scheduling task can be automated – this is where you come in. You will be given scenarios
of airplane landings. Each airplane has a time window during which it can safely land. You must compute an
order for landing all airplanes that respects these time windows. Furthermore, the airplane landings should be
stretched out as much as possible so that the minimum time gap between successive landings is as large as
possible. For example, if three airplanes land at 10:00am, 10:05am, and 10:15am, then the smallest gap is five
minutes, which occurs between the first two airplanes. Not all gaps have to be the same, but the smallest gap
should be as large as possible.
Input
The input file contains several test cases consisting of descriptions of landing scenarios. Each test case starts
with a line containing a single integer n (2 ≤ n ≤ 8), which is the number of airplanes in the scenario. This is
followed by n lines, each containing two integers ai, bi, which give the beginning and end of the closed interval
[ai, bi] during which the i
th
plane can land safely. The numbers ai and bi are specified in minutes and satisfy
0 ≤ ai ≤ bi ≤ 1440.
The input is terminated with a line containing the single integer zero.
Output
For each test case in the input, print its case number (starting with 1) followed by the minimum achievable time
gap between successive landings. Print the time split into minutes and seconds, rounded to the closest second.
Follow the format of the sample output.
Sample Input
3
0 10
5 15
10 15
2
0 10
10 20
0
Output for the Sample Input
Case 1: 7:30
Case 2: 20:00
A Careful Approach
Input: approach.in
If you think participating in a programming contest is stressful, imagine being an air traffic controller. With
human lives at stake, an air traffic controller has to focus on tasks while working under constantly changing
conditions as well as dealing with unforeseen events.
Consider the task of scheduling the airplanes that are landing at an airport. Incoming airplanes report their
positions, directions, and speeds, and then the controller has to devise a landing schedule that brings all
airplanes safely to the ground. Generally, the more time there is between successive landings, the “safer” a
landing schedule is. This extra time gives pilots the opportunity to react to changing weather and other surprises.
Luckily, part of this scheduling task can be automated – this is where you come in. You will be given scenarios
of airplane landings. Each airplane has a time window during which it can safely land. You must compute an
order for landing all airplanes that respects these time windows. Furthermore, the airplane landings should be
stretched out as much as possible so that the minimum time gap between successive landings is as large as
possible. For example, if three airplanes land at 10:00am, 10:05am, and 10:15am, then the smallest gap is five
minutes, which occurs between the first two airplanes. Not all gaps have to be the same, but the smallest gap
should be as large as possible.
Input
The input file contains several test cases consisting of descriptions of landing scenarios. Each test case starts
with a line containing a single integer n (2 ≤ n ≤ 8), which is the number of airplanes in the scenario. This is
followed by n lines, each containing two integers ai, bi, which give the beginning and end of the closed interval
[ai, bi] during which the i
th
plane can land safely. The numbers ai and bi are specified in minutes and satisfy
0 ≤ ai ≤ bi ≤ 1440.
The input is terminated with a line containing the single integer zero.
Output
For each test case in the input, print its case number (starting with 1) followed by the minimum achievable time
gap between successive landings. Print the time split into minutes and seconds, rounded to the closest second.
Follow the format of the sample output.
Sample Input
3
0 10
5 15
10 15
2
0 10
10 20
0
Output for the Sample Input
Case 1: 7:30
Case 2: 20:00
блин, заморозка пришла в тот момент, когда итмо сдали задачу J =(
монитор есть здесь(более приятный на глаз) — zibada.ru/pcms/finals/
вот комментарии с snarknews:
Итак, на момент «заморозки» после 4 часов соревнований сданы все задачи, кроме G. 8 задач у команды СПбГУ ИТМО (A,B,D,E,F,I,J,K), по 6 задач у команд СПбГУ (A,B,D,E,F,K), Саратовского ГУ (A,B,D,E,F,H), U of Oxford (A,B,E,F,H,I), Zhejiang U, Tsinghua U (A,B,D,F,H,I) MIT (A,B,F,H,I,K) — соответственно места с 2 по 7.
Далее с 5 задачами следуют команды U of Waterloo, Stanford U (A,B,F,H,I), НГУ (A,B,D,E,F), Тбилисского ГУ (A,B,F,H,I) South China U of Tech (A,B,D,F,H), Sharif U of Tech (A,B,E,F,H), МГУ (A,B,D,E,H), U of Warsaw (A,B,F,H,I), Carnegie Mellon U (A,B,E,F,I), Seoul NU (A,B,F,H,I) и U of Tokyo (A,B,D,F,H) — соответственно места с 8 по 18. У команд Алтайского ГТУ (19 место), УрГУ (20 место), НТУУ «КПИ» (26 место), БГУ (28 место) — 4 задачи, у команд КНУ (33 место), Южно-Уральского ГУ (46 место), Таврического НУ (47 место) — по 3 решённые задачи.
монитор есть здесь(более приятный на глаз) — zibada.ru/pcms/finals/
вот комментарии с snarknews:
Итак, на момент «заморозки» после 4 часов соревнований сданы все задачи, кроме G. 8 задач у команды СПбГУ ИТМО (A,B,D,E,F,I,J,K), по 6 задач у команд СПбГУ (A,B,D,E,F,K), Саратовского ГУ (A,B,D,E,F,H), U of Oxford (A,B,E,F,H,I), Zhejiang U, Tsinghua U (A,B,D,F,H,I) MIT (A,B,F,H,I,K) — соответственно места с 2 по 7.
Далее с 5 задачами следуют команды U of Waterloo, Stanford U (A,B,F,H,I), НГУ (A,B,D,E,F), Тбилисского ГУ (A,B,F,H,I) South China U of Tech (A,B,D,F,H), Sharif U of Tech (A,B,E,F,H), МГУ (A,B,D,E,H), U of Warsaw (A,B,F,H,I), Carnegie Mellon U (A,B,E,F,I), Seoul NU (A,B,F,H,I) и U of Tokyo (A,B,D,F,H) — соответственно места с 8 по 18. У команд Алтайского ГТУ (19 место), УрГУ (20 место), НТУУ «КПИ» (26 место), БГУ (28 место) — 4 задачи, у команд КНУ (33 место), Южно-Уральского ГУ (46 место), Таврического НУ (47 место) — по 3 решённые задачи.
Думаю УЖЕ можно поздравить ребят из команды СпбГУ ИТМО с победой.
Решить за час 3 задачи, чтобы обогнать их практически нереально.
Поздравляю!
Решить за час 3 задачи, чтобы обогнать их практически нереально.
Поздравляю!
Предварительные результаты ACM-ICPC: университет ИТМО — первый, Саратов — второй — itoday.ru/news/16230.html
Точно уже можно поздравлять :)
Точно уже можно поздравлять :)
Рано еще писать про победителей, надо дождаться официальных результатов.
Зарегистрируйтесь на Хабре, чтобы оставить комментарий
Завершился World Final ACM ICPC