#PU1526. USACO 2025 US Open Contest, Platinum — Problem 3. Package Pickup
USACO 2025 US Open Contest, Platinum — Problem 3. Package Pickup
USACO 2025 US Open Contest, Platinum — Problem 3. Package Pickup
题目描述
Note: The time limit for this problem is 4s, 2x the default. Farmer John has distributed cows and packages in a weird pattern across the number line using the following process: Farmer John chooses a number (). Farmer John chooses ( intervals to distribute cows in (). He then places cows at locations . It is guaranteed that is a multiple of . Farmer John chooses ( intervals to distribute packages in (). He then places packages at locations . It is guaranteed that is a multiple of . Once the cows and packages are distributed, Farmer John wants to see how long it takes the cows to pick up the packages. Every second, Farmer John can issue a command to a single cow to move one unit left or right of their current position with his handy walkie talkie. If a cow travels to the position where a package is located, they are able to pick it up. Farmer John wants to know the minimum time in seconds that it would take the cows to pick up every package.
输入格式
The first line contains , , and . The next lines each contain two integers and . The next lines each contain two integers and .
输出格式
(见题面原文)
数据范围
(见题面原文)
样例
样例 1
100 3 7
10 10
20 20
30 30
7 7
11 11
13 13
17 17
24 24
26 26
33 33
22
In the above test case, suppose the cows and packages are numbered from left to
right. Farmer John can follow this procedure to pick up the packages in 22
seconds:
Issue $3$ lefts to cow $1$ so that it picks up package $1$
Issue
$3$ rights to cow $3$ so that it picks up package $7$
Issue $4$ rights
to cow $2$ so that it picks up package $5$
Issue $10$ rights to cow $1$
so that it picks up packages $2$, $3$, and $4$
Issue $2$ rights to cow
$2$ so that it picks up package $6$
样例 2
2 1 1
1 5
2 6
3
There are three cows and three packages. Farmer John can issue one right to each
cow.