-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy path1075B-Taxi_drivers_and_Lyft.cpp
109 lines (106 loc) · 2.19 KB
/
1075B-Taxi_drivers_and_Lyft.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/*
written by Pankaj Kumar.
country:-INDIA
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef map<ll,ll> ml;
typedef set<char>sc;
typedef set<ll> sl;
#define pan cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
// define values.
// #define mod 1000000007
#define phi 1.618
/* Bit-Stuff */
#define get_set_bits(a) (__builtin_popcount(a))
#define get_set_bitsll(a) ( __builtin_popcountll(a))
#define get_trail_zero(a) (__builtin_ctz(a))
#define get_lead_zero(a) (__builtin_clz(a))
#define get_parity(a) (__builtin_parity(a))
/* Abbrevations */
#define ff first
#define ss second
#define mp make_pair
#define line cout<<endl;
#define pb push_back
#define Endl "\n"
// loops
#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
// Some print
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
#define cc ll test;cin>>test;while(test--)
// sort
#define all(V) (V).begin(),(V).end()
#define srt(V) sort(all(V))
#define srtGreat(V) sort(all(V),greater<ll>())
// function
ll power(ll x,ll y,ll mod)
{
ll res=1;
// x=x%mod;
while(y>0)
{
if(y%2==1)
{
res*=x;
// res=res%mod;
}
y/=2; x*=x; // x=x%mod;
}
return res;
}
/* ascii value
A=65,Z=90,a=97,z=122
*/
/* -----------------------------------------------------------------------------------*/
ll solve()
{
ll n,m;
cin>>n>>m;
vector<ll>temp(n+m),a,b,ans(m,0);
forin(temp,(n+m));
for(ll i=0;i<(n+m);i++)
{
ll x;
cin>>x;
if(x==1)
b.pb(temp[i]);
else
a.pb(temp[i]);
}
for(ll i=0;i<n;i++)
{
ll pos=(ll)(lower_bound(all(b),a[i])-b.begin());
if(pos==m)
ans[m-1]++;
else if(pos==0)
ans[0]++;
else
{
if(b[pos]-a[i]<a[i]-b[pos-1])
ans[pos]++;
else
ans[pos-1]++;
}
}
for(auto x:ans)
cout<<x<<" ";
line;
return 0;
}
int main()
{
//freopen("input.txt"a, "r", stdin);
pan;
solve();
// cc
// {
// solve();
// }
return 0;
}