Codeforces 967 C （二分）

C. Stairs and Elevators

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In the year of $30XX$ participants of some world programming championship live in a single large hotel. The hotel has $n$ floors. Each floor has $m$ sections with a single corridor connecting all of them. The sections are enumerated from $1$ to $m$ along the corridor, and all sections with equal numbers on different floors are located exactly one above the other. Thus, the hotel can be represented as a rectangle of height $n$ and width $m$. We can denote sections with pairs of integers $(i,j)$, where $i$ is the floor, and $j$ is the section number on the floor.

The guests can walk along the corridor on each floor, use stairs and elevators. Each stairs or elevator occupies all sections $(1,x)$, $(2,x)$, $\dots$, $(n,x)$ for some $x$ between $1$ and $m$. All sections not occupied with stairs or elevators contain guest rooms. It takes one time unit to move between neighboring sections on the same floor or to move one floor up or down using stairs. It takes one time unit to move up to $v$ floors in any direction using an elevator. You can assume you don't have to wait for an elevator, and the time needed to enter or exit an elevator is negligible.

You are to process $q$ queries. Each query is a question "what is the minimum time needed to go from a room in section $(x_1,y_1)$ to a room in section $(x_2,y_2)$?"

Input

The first line contains five integers $n,m,c_l,c_e,v$ ($2\le n,m\le {10}^8$, $0\le c_l,c_e\le {10}^5$, $1\le c_l+c_e\le m-1$, $1\le v\le n-1$) — the number of floors and section on each floor, the number of stairs, the number of elevators and the maximum speed of an elevator, respectively.

The second line contains $c_l$ integers $l_1,\dots ,l_{c_l}$ in increasing order ($1\le l_i\le m$), denoting the positions of the stairs. If $c_l=0$, the second line is empty.

The third line contains $c_e$ integers $e_1,\dots ,e_{c_e}$ in increasing order, denoting the elevators positions in the same format. It is guaranteed that all integers $l_i$ and $e_i$ are distinct.

The fourth line contains a single integer $q$ ($1\le q\le {10}^5$) — the number of queries.

The next $q$ lines describe queries. Each of these lines contains four integers $x_1,y_1,x_2,y_2$ ($1\le x_1,x_2\le n$, $1\le y_1,y_2\le m$) — the coordinates of starting and finishing sections for the query. It is guaranteed that the starting and finishing sections are distinct. It is also guaranteed that these sections contain guest rooms, i. e. $y_1$ and $y_2$ are not among $l_i$ and $e_i$.

Output

Print $q$ integers, one per line — the answers for the queries.

Example

input

Copy

5 6 1 1 3
2
5
3
1 1 5 6
1 3 5 4
3 3 5 3

output

Copy

7
5
4

Note

In the first query the optimal way is to go to the elevator in the 5-th section in four time units, use it to go to the fifth floor in two time units and go to the destination in one more time unit.

In the second query it is still optimal to use the elevator, but in the third query it is better to use the stairs in the section 2.

一、原题地址

传送门

二、大致题意

    给一座旅馆在XY坐标轴上的情况，每个点代表一个房间。人上楼有走楼梯和走电梯两种方法，电梯有相对的运行速度。读入电梯和楼梯所在的位置。询问给出的两点间的最快走法。

三、思路

    如果两点在同一层，显然是直接走过去最快。

    两点在不同层时，首先上楼和下楼是必须的。此时只需要找到人到达楼梯口（电梯口）+楼梯口（电梯口）到达终点的最小值即可。

    由于楼梯（电梯）数可能很多，所以用二分确定最接近起始点位置的楼梯（电梯）。

四、代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
const int inf=0x3f3f3f3f;


int n,m,cl,ce,v,q;
int lou[100005];
int dian[100005];
int work(int sx,int sy,int ex,int ey)
{
	if(sx==ex)
		return abs(sy-ey);
	int k=lower_bound(lou,lou+cl,sy)-lou;
	int ans=inf;
	if(k<cl)         
	{
		int pos=lou[k];
		ans=min(abs(sy-pos)+abs(ey-pos)+abs(sx-ex),ans);
	}
	if(k>0)
	{
		int pos=lou[k-1];
		ans=min(abs(sy-pos)+abs(ey-pos)+abs(sx-ex),ans);
	}
	k=lower_bound(dian,dian+ce,sy)-dian;     
	if(k<ce)            
	{
		int pos=dian[k];
		ans=min(abs(sy-pos)+abs(ey-pos)+abs(sx-ex)/v+(((abs(sx-ex)%v)==0)?0:1),ans);
	}
	if(k>0)
	{
		int pos=dian[k-1];
		ans=min(abs(sy-pos)+abs(ey-pos)+abs(sx-ex)/v+(((abs(sx-ex)%v)==0)?0:1),ans);
	}
	return ans;
}
int main()
{
	scanf("%d%d%d%d%d",&n,&m,&cl,&ce,&v);
	for(int i=0;i<cl;i++)
		scanf("%d",&lou[i]);
	for(int i=0;i<ce;i++)
		scanf("%d",&dian[i]);
	sort(lou,lou+cl);
	sort(dian,dian+ce);
	scanf("%d",&q);
	while(q--)
	{
		int sx,sy,ex,ey;
		scanf("%d%d%d%d",&sx,&sy,&ex,&ey);
		printf("%d\n",work(sx,sy,ex,ey));
	}
	getchar();
	getchar();
}

五、反思

    二分写了很久一直WA。网上浏览大佬代码发现lower_bound和upper_bound的使用。

    upper_bound（i） 返回的是键值为i的元素可以插入的最后一个位置（上界）。

    lowe_bound（i） 返回的是键值为i的元素可以插入的位置的第一个位置（下界）。

      在这道题里这两者没有影响。因为当起始点和y坐标与楼梯（电梯）的y坐标重叠时，必然是选择直接上楼（下楼）更快。