Codeforces 830A. Office Keys 【dp】

A. Office Keys
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key and then go to the office. Once a key is taken by somebody, it couldn't be taken by anybody else.
You are to determine the minimum time needed for all n people to get to the office with keys. Assume that people move a unit distance per 1 second. If two people reach a key at the same time, only one of them can take the key. A person can pass through a point with a key without taking it.
Input
The first line contains three integers n, k and p (1 ≤ n ≤ 1 000, n ≤ k ≤ 2 000, 1 ≤ p ≤ 109) — the number of people, the number of keys and the office location.
The second line contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ 109) — positions in which people are located initially. The positions are given in arbitrary order.
The third line contains k distinct integers b1, b2, ..., bk (1 ≤ bj ≤ 109) — positions of the keys. The positions are given in arbitrary order.
Note that there can't be more than one person or more than one key in the same point. A person and a key can be located in the same point.
Output
Print the minimum time (in seconds) needed for all n to reach the office with keys.
Examples
input

2 4 50
20 100
60 10 40 80

output

50

input

1 2 10
11
15 7

output

7

Note
In the first example the person located at point 20 should take the key located at point 40 and go with it to the office located at point 50. He spends 30 seconds. The person located at point 100 can take the key located at point 80 and go to the office with it. He spends 50seconds. Thus, after 50 seconds everybody is in office with keys.
-----------
단순 DP
d[i][j]= 전 i 개인, 전 j개의 열쇠를 사용하여 모두 p로 이동, 가장 느린 사람이 필요로 하는 최단 시간 d[i][j]=min{d[i][j - 1],max(d[i - 1][j - 1],|a[i]--b [j]|+|p - b[j]|)} O(n2)

#include
#include
#define ll long long
#define pii pair
#define MEM(a,x) memset(a,x,sizeof(a))
#define lowbit(x) ((x)&-(x))

using namespace std;

const int inf=0x3f3f3f3f;
const int N = 2000+5;

int a[N],b[N];
ll d[N][N];
ll slove(int n,int k,int p){
    MEM(d,0x3f);
    fill(d[0],d[0]+k+1,0);
    for(int i=1;i<=n;++i){
        for(int j=1;j<=k;++j){
            d[i][j]=min(d[i][j-1],max(d[i-1][j-1],(ll)abs(a[i]-b[j])+abs(b[j]-p)));
        }
    }
    return d[n][k];
}

int main()
{
    //freopen("/home/lu/code/r.txt","r",stdin);
    int n,k,p;
    while(~scanf("%d%d%d",&n,&k,&p)){
        for(int i=1;i<=n;++i){
            scanf("%d",&a[i]);
        }
        for(int i=1;i<=k;++i){
            scanf("%d",&b[i]);
        }
        sort(a+1,a+n+1);
        sort(b+1,b+k+1);
        printf("%lld
",slove(n,k,p));
    }
    return 0;
}