Codeforces Round #366 (Div. 2) D. Ant Man

D. Ant Man

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Scott Lang is at war with Darren Cross. There are n chairs in a hall where they are, numbered with 1, 2, ..., n from left to right. The i-th chair is located at coordinate xi. Scott is on chair number s and Cross is on chair number e. Scott can jump to all other chairs (not only neighboring chairs). He wants to start at his position (chair number s), visit each chair exactly once and end up on chair number e with Cross.

As we all know, Scott can shrink or grow big (grow big only to his normal size), so at any moment of time he can be either small or large (normal). The thing is, he can only shrink or grow big while being on a chair (not in the air while jumping to another chair). Jumping takes time, but shrinking and growing big takes no time. Jumping from chair number i to chair number j takes |xi - xj| seconds. Also, jumping off a chair and landing on a chair takes extra amount of time.

If Scott wants to jump to a chair on his left, he can only be small, and if he wants to jump to a chair on his right he should be large.

Jumping off the i-th chair takes:

• ci extra seconds if he's small.
• di extra seconds otherwise (he's large).

Also, landing on i-th chair takes:

• bi extra seconds if he's small.
• ai extra seconds otherwise (he's large).

In simpler words, jumping from i-th chair to j-th chair takes exactly:

• |xi - xj| + ci + bj seconds if j < i.
• |xi - xj| + di + aj seconds otherwise (j > i).

Given values of x, a, b, c, d find the minimum time Scott can get to Cross, assuming he wants to visit each chair exactly once.

Input

The first line of the input contains three integers n, s and e (2 ≤ n ≤ 5000, 1 ≤ s, e ≤ n, s ≠ e) — the total number of chairs, starting and ending positions of Scott.

The second line contains n integers x1, x2, ..., xn (1 ≤ x1 < x2 < ... < xn ≤ 109).

The third line contains n integers a1, a2, ..., an (1 ≤ a1, a2, ..., an ≤ 109).

The fourth line contains n integers b1, b2, ..., bn (1 ≤ b1, b2, ..., bn ≤ 109).

The fifth line contains n integers c1, c2, ..., cn (1 ≤ c1, c2, ..., cn ≤ 109).

The sixth line contains n integers d1, d2, ..., dn (1 ≤ d1, d2, ..., dn ≤ 109).

Output

Print the minimum amount of time Scott needs to get to the Cross while visiting each chair exactly once.

Example

input

7 4 3
8 11 12 16 17 18 20
17 16 20 2 20 5 13
17 8 8 16 12 15 13
12 4 16 4 15 7 6
8 14 2 11 17 12 8

output

139

Note

In the sample testcase, an optimal solution would be . Spent time would be17 + 24 + 23 + 20 + 33 + 22 = 139.

 

题目链接：http://codeforces.com/contest/705/problem/D

 

 

题意：在一个数轴上有n个点，每个点有5个值x,a,b,c,d，你每次可以从一个点i跳跃到另外一个点j，如果j比i的值大，则需要花费abs(i-j)+d[i]+a[j]，如果j比i的值小，则需要花费abs(i-j)+c[i]+b[j]，一开始你位于s点，你需要走过所有的点并且最后停在e点，求最小花费。

步骤：

1 初始化：s->e

2 插入编号为1的点，显然1只能插入一个地方，插入后：s->1->e

3 插入编号为2的点，2可以插入两个地方（s和1中间或1和e中间），选择一个花费较低的位置，如s->2->1->e

4 以此类推，所得即为最小花费

……

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 #define maxn 5010
 6 typedef long long ll;
 7 using namespace std;
 8 ll n,s,e,x[maxn],a[maxn],b[maxn],c[maxn],d[maxn];
 9 ll sum = 0;
10 ll Next[maxn];
11 ll distance(ll m, ll n)
12 {
13     if(x[m] > x[n])
14         return x[m] - x[n] + c[m] + b[n];
15     return x[n] - x[m] + d[m] + a[n];
16 }
17 int main()
18 {
19     //freopen("4.txt","r",stdin);
20     cin >> n >> s >> e;
21     for(ll i = 1; i <= n; i++)
22         cin >> x[i];
23     for(ll i = 1; i <= n; i++)
24         cin >> a[i];
25     for(ll i = 1; i <= n; i++)
26         cin >> b[i];
27     for(ll i = 1; i <= n; i++)
28         cin >> c[i];
29     for(ll i = 1; i <= n; i++)
30         cin >> d[i];
31     sum = distance(s,e);
32     Next[s] = e;
33     ll maxm,best;
34     for(ll i = 1; i <= n; i++)
35     {
36         if(i == s || i == e)
37             continue;
38         maxm = 1000000000000000;
39         for(ll j = s; j != e; j = Next[j])
40         {
41             ll k = distance(j,i) + distance(i,Next[j]) - distance(j,Next[j]);
42             if(k < maxm)
43             {
44                 maxm = k;
45                 best = j;
46             }
47         }
48         //cout << maxm << endl;
49         sum += maxm;
50         Next[i] = Next[best];
51         Next[best] = i;
52     }
53     cout << sum;
54     return 0;
55 }

 

转载于:https://www.cnblogs.com/Mino521/p/5753811.html