Apartments

#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define fill(arr,val) memset(arr,val,sizeof(arr))
#define FOR(i, a, b) for(__typeof(b) i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for(__typeof(a) i = a, _b = b; i >= _b; --i)
#define ALL(a) (a).begin(), (a).end()
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ii pair<int,int>
#define iii pair<int,pair<int,int>>
#define dq deque<int>
#define nend '\n'
using namespace std;
const ll hashi=2e9+11;
ll add(ll a, ll b) {
    return (a+b)%hashi;
}
ll sub(ll a, ll b) {
    return ((a-b)%hashi+hashi)%hashi;
}
ll mul(ll a, ll b) {
    return (a*b)%hashi;
}

const ll inf=1e18;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
const int N=2e5+3;
int n,m,x,k,l,r,mid;
ll a[N];
int ans=0;
int main() {
    ///freopen(".INP","r",stdin);
    ///freopen(".OUT","w",stdout);
    fast;
    cin >> n >> m >> k;
    FOR(i,1,n) cin >> a[i];
    sort(a+1,a+1+n);
    FOR(i,1,m) {
        cin >> x;
        l=1; r=n;
        int pos1=-1,pos2=-1;
        while (l<=r) {
            mid = (l+r)>>1;
            if (a[mid]>=x) {
                pos1=mid;
                r=mid-1;
            }else l=mid+1;
        }
        l=1; r=n;
        while (l<=r) {
            mid = (l+r)>>1;
            if (a[mid]<=x) {
                pos2=mid;
                l=mid+1;
            }else r=mid-1;
        }
        if (pos1!=-1||pos2!=-1) {
            bool check1=false,check2=false;
            int dis1=abs(a[pos1]-x),dis2=abs(a[pos2]-x);
            if (dis1<=k) { ///pos1 valid
                check1 = 1;
            }
            if (dis2<=k) { ///pos2 valid
                check2 = 1;
            }
            if (check1 or check2) {
                ans++;
                if (check1 and check2) {
                    if (dis1<=dis2) {
                        a[pos1]=1e18; ///remove pos1, take pos1
                    }else a[pos2]=1e18;
                }else if (check1 and !check2) {a[pos1]=1e18;
                }else if (check2 and !check1) a[pos2]=1e18;

            }
            sort(a+1,a+1+n);
        }
    }
    cout << ans;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED