Gym - 101064C Cahokia ruins

题目：

Cahokia is the area of an ancient civilization located in the state of Illinois. This place importance comes from the fact that it helps understand the history of North America. Cahokia was composed by 120 mounds, 80 of them still remain nowadays. One of these mounds is called Monks Mound, considered the biggest natural monument in all North America.

Recently, a group of archaeologist of the organization Extraordinary Mystery Investigators (IME, in their language) have discovered secret passages in the underground surroundings of Monks Mound. Because of the importance of this discovery, IME has called one of its famous members, Marcio "the indispensable" Himura, for help. After diving in Thai seas, Marcio is back in action and want to unfold the mysteries of Cahokia. The members of IME want to reach the deepest part of Monk Mound, but to do so, they have to traverse a special room.

This room can be represented by a 2D grid with dimensions H × W meters. The particularity of this room is that the instant somebody enters the room the east and west walls begin to move towards each other until they collide. Marcio suspects that this was made to keep safely treasures from intruders. Each wall is represented by a sequence of H integers a1, a2, ..., aH, where ai is the width (in meters) of the wall at row i. Marcio knows that each wall moves with speed of 1 m / s. The following figure depicts (a) the initial configuration of the room given in the first sample test case, and (b) the collision of the walls after one second.

Marcio is interested in knowing, given an initial configuration of the walls, in how much time the walls collide after someone enter the room. This information is crucial for Marcio to determine an strategy to go through the room. He acknowledges your potential, so he ask for your help to solve this problem.

Input

In the first line we give two space-separated integers, H (2 ≤ H ≤ 105) and W (4 ≤ W ≤ 105). In the second line, there are H space-separated integers representing the east wall. In the third line, there are H space separated-integers representing the west wall. It is ensured that the walls don't overlap at any row.

Output

One number representing in how much time the two walls hit each other. Error of 10 - 9is tolerated.

Examples

Input

4 6
1 1 1 3
1 2 1 1

Output

1

Input

4 100
10 10 20 30
15 35 20 10

Output

27.5

思路：

签到题……

代码：

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
int a[250000],b[250000],c[250000];
int main()
{
    int h,w;
    while(cin>>h>>w){
            memset(a,0,sizeof(a));
         memset(b,0,sizeof(b));
          memset(c,0,sizeof(c));
        for(int i=0;i<h;i++){
            scanf("%d",&a[i]);
        }
        for(int i=0;i<h;i++){
            scanf("%d",&b[i]);
            c[i]=w-(b[i]+a[i]);
        }
        sort(c,c+h);
        cout<<c[0]/2.0<<endl;
    }
    return 0;
}