CodeForces 1075B Taxi drivers and Lyft

题目传送门

Palo Alto is an unusual city because it is an endless coordinate line. It is also known for the office of Lyft Level 5.

Lyft has become so popular so that it is now used by all mm taxi drivers in the city, who every day transport the rest of the city residents — nn riders.

Each resident (including taxi drivers) of Palo-Alto lives in its unique location (there is no such pair of residents that their coordinates are the same).

The Lyft system is very clever: when a rider calls a taxi, his call does not go to all taxi drivers, but only to the one that is the closest to that person. If there are multiple ones with the same distance, then to taxi driver with a smaller coordinate is selected.

But one morning the taxi drivers wondered: how many riders are there that would call the given taxi driver if they were the first to order a taxi on that day? In other words, you need to find for each taxi driver ii the number aiai — the number of riders that would call the ii-th taxi driver when all drivers and riders are at their home?

The taxi driver can neither transport himself nor other taxi drivers.

Input

The first line contains two integers nn and mm (1≤n,m≤1051≤n,m≤105) — number of riders and taxi drivers.

The second line contains n+mn+m integers x1,x2,…,xn+mx1,x2,…,xn+m (1≤x1<x2<…<xn+m≤1091≤x1<x2<…<xn+m≤109), where xixi is the coordinate where the ii-th resident lives.

The third line contains n+mn+m integers t1,t2,…,tn+mt1,t2,…,tn+m (0≤ti≤10≤ti≤1). If ti=1ti=1, then the ii-th resident is a taxi driver, otherwise ti=0ti=0.

It is guaranteed that the number of ii such that ti=1ti=1 is equal to mm.

Output

Print mm integers a1,a2,…,ama1,a2,…,am, where aiai is the answer for the ii-th taxi driver. The taxi driver has the number ii if among all the taxi drivers he lives in the ii-th smallest coordinate (see examples for better understanding).

Examples

Input

3 1
1 2 3 10
0 0 1 0

Output

3 

Input

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

Output

2 1 

Input

1 4
2 4 6 10 15
1 1 1 1 0

Output

0 0 0 1 

Note

In the first example, we have only one taxi driver, which means an order from any of nn riders will go to him.

In the second example, the first taxi driver lives at the point with the coordinate 22, and the second one lives at the point with the coordinate 66. Obviously, the nearest taxi driver to the rider who lives on the 33 coordinate is the first one, and to the rider who lives on the coordinate 55 is the second one. The rider who lives on the 44 coordinate has the same distance to the first and the second taxi drivers, but since the first taxi driver has a smaller coordinate, the call from this rider will go to the first taxi driver.

In the third example, we have one rider and the taxi driver nearest to him is the fourth one.

题意：输入n，m，分别代表的是n个人，m辆出租车，接下来第二行输入每个人以及车子的坐标，第三行输入1

代表出租车，输入0代表的是人。

题解：主要考虑第一辆出租车以及最后一辆出租车，然后遍历每辆辆出租车之间的人距离两辆车的距离大小，更新数组计数结果即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
#define inf 0x7fffffff
#define ll long long
ll point[300007];
ll num[300007];
ll peo[300007];
ll d[300007];
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        memset(d,0,sizeof(d));
        memset(num,0,sizeof(num));
        int k=1;
        int place;
        for(int i=1;i<=n+m;i++)//记录车和人的坐标
            cin>>point[i];
        for(int i=1;i<=n+m;i++)
        {
            cin>>peo[i];//记录是人还是车
            if(peo[i]==1)
            {
                d[k]=point[i];//如果为车子，记录好每一辆车的坐标
                num[k]=0;
                //cout<<"d[k]:"<<d[k]<<endl;
                k++;
            }
        }
        int q=0;
        for(int i=1;i<=n+m;i++)
        {
            if(m==1)//只有一辆车，结果就是n+m-1
            {
                num[1]=n+m-1;
                break;
            }
            if(point[i]<d[1]){//考虑第一辆车位置之前的人只能做第一辆车
                num[1]++;
                continue;
            }
            if(point[i]>d[m]){//考虑位子在最后一辆车之后的人只能坐最后一辆车
                num[m]=num[m]+1;
                continue;
            }
            if(peo[i]==1)
            {
                q++;
                continue;
            }
            if(point[i]*2>d[q]+d[q+1])//遍历两车之间的人的位置，再决定上哪辆车。距离相同，上坐标靠前的那辆车
            {
                num[q+1]++;
            }
            else
            {
                num[q]++;
            }
        }
        for(int i=1;i<k;i++)
        {
            cout<<num[i]<<" ";
        }
        cout<<endl;
    }
    return 0;
}