Codeforces Round #244 (Div. 2) E. Police Patrol

E. Police Patrol

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Imagine that your city is an infinite 2D plane with Cartesian coordinate system. The only crime-affected road of your city is the x-axis. Currently, there are n criminals along the road. No police station has been built on this road yet, so the mayor wants to build one.

As you are going to be in charge of this new police station, the mayor has asked you to choose a suitable position (some integer point) for building it. You should choose the best position for the police station, so that you could minimize the total time of your criminal catching mission. Your mission of catching the criminals will operate only from this station.

The new station will have only one patrol car. You will go to the criminals by this car, carry them on the car, bring them back to the police station and put them in prison. The patrol car can carry at most m criminals at a time. Note that, the criminals don't know about your mission. So, they will stay where they are instead of running away.

Your task is to find the position for the police station, so that total distance you need to cover to catch all the criminals will be minimum possible. Note that, you also can built the police station on the positions where one or more criminals already exist. In such a case all these criminals are arrested instantly.

Input

The first line of the input will have two integers n (1 ≤ n ≤ 10⁶) and m (1 ≤ m ≤ 10⁶) separated by spaces. The next line will contain nintegers separated by spaces. The i^th integer is the position of the i^th criminal on the x-axis. Absolute value of positions will not exceed10⁹. If a criminal has position x, he/she is located in the point (x, 0) of the plane.

The positions of the criminals will be given in non-decreasing order. Note, that there can be more than one criminal standing at some point of the plane.

Note: since the size of the input/output could be very large, don't use slow input/output techniques in your language. For example, do not use input/output streams (cin, cout) in C++.

Output

Print a single integer, that means the minimum possible distance you need to cover to catch all the criminals.

Sample test(s)

input

3 6
1 2 3

output

4

input

5 5
-7 -6 -3 -1 1

output

16

input

1 369
0

output

0

input

11 2
-375 -108 1336 1453 1598 1892 2804 3732 4291 4588 4822

output

18716

题意：

有n个罪犯分布在x轴，每次可以逮捕m个，让你选择一个出发点，使得将全部的罪犯抓获走的距离最小。

思路：

最优的策略是从两端开始抓，现在就是选取哪个点的问题，可以根据一个点到两端的距离=右端点-左端点证明最优点就是中位数的那个点，纸上画了画，比较了一下，是这样的，具体证明不会。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#pragma comment (linker,"/STACK:102400000,102400000")
#define maxn 1005
#define MAXN 1000005
#define OO (1<<31)-1
#define mod 1000000009
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-6
typedef long long ll;
using namespace std;

ll n,m,tot,ans,flag,cnt;
ll a[MAXN],d;

int main()
{
    ll i,j,t;
    while(~scanf("%I64d%I64d",&n,&m))
    {
        for(i=1; i<=n; i++)
        {
            scanf("%I64d",&a[i]);
        }
        ll pos=n/2+1;
        ans=0;
        for(i=n;i>=pos;i-=m)
        {
            ans+=a[i]-a[pos];
        }
        for(i=1;i<=pos;i+=m)
        {
            ans+=a[pos]-a[i];
        }
        cout<<2*ans<<endl;
    }
    return 0;
}