CF586B.Laurenty and Shop

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

A little boy Laurenty has been playing his favourite game Nota for quite a while and is now very hungry. The boy wants to make sausage and cheese sandwiches, but first, he needs to buy a sausage and some cheese.

The town where Laurenty lives in is not large. The houses in it are located in two rows, nn houses in each row. Laurenty lives in the very last house of the second row. The only shop in town is placed in the first house of the first row.

The first and second rows are separated with the main avenue of the city. The adjacent houses of one row are separated by streets.

Each crosswalk of a street or an avenue has some traffic lights. In order to cross the street, you need to press a button on the traffic light, wait for a while for the green light and cross the street. Different traffic lights can have different waiting time.

The traffic light on the crosswalk from the jj -th house of the ii -th row to the (j+1)(j+1) -th house of the same row has waiting time equal to aija_{ij} ( 1<=i<=2,1<=j<=n11<=i<=2,1<=j<=n-1 ). For the traffic light on the crossing from the jj -th house of one row to the jj -th house of another row the waiting time equals bjb_{j} ( 1<=j<=n1<=j<=n ). The city doesn't have any other crossings.

The boy wants to get to the store, buy the products and go back. The main avenue of the city is wide enough, so the boy wants to cross it exactly once on the way to the store and exactly once on the way back home. The boy would get bored if he had to walk the same way again, so he wants the way home to be different from the way to the store in at least one crossing.

Figure to the first sample.Help Laurenty determine the minimum total time he needs to wait at the crossroads.

输入格式

The first line of the input contains integer nn ( 2<=n<=502<=n<=50 ) — the number of houses in each row.

Each of the next two lines contains n1n-1 space-separated integer — values aija_{ij} ( 1<=aij<=1001<=a_{ij}<=100 ).

The last line contains nn space-separated integers bjb_{j} ( 1<=bj<=1001<=b_{j}<=100 ).

输出格式

Print a single integer — the least total time Laurenty needs to wait at the crossroads, given that he crosses the avenue only once both on his way to the store and on his way back home.

输入输出样例

  • 输入#1

    4
    1 2 3
    3 2 1
    3 2 2 3
    

    输出#1

    12
    
  • 输入#2

    3
    1 2
    3 3
    2 1 3
    

    输出#2

    11
    
  • 输入#3

    2
    1
    1
    1 1
    

    输出#3

    4
    

说明/提示

The first sample is shown on the figure above.

In the second sample, Laurenty's path can look as follows:

  • Laurenty crosses the avenue, the waiting time is 33 ;
  • Laurenty uses the second crossing in the first row, the waiting time is 22 ;
  • Laurenty uses the first crossing in the first row, the waiting time is 11 ;
  • Laurenty uses the first crossing in the first row, the waiting time is 11 ;
  • Laurenty crosses the avenue, the waiting time is 11 ;
  • Laurenty uses the second crossing in the second row, the waiting time is 33 .

In total we get that the answer equals 1111 .In the last sample Laurenty visits all the crossings, so the answer is 44 .

首页