【CF 981F】Round Marriage（二分）

Description

http://codeforces.com/contest/981/problem/F

---

Solution

首先分别将目标序列-L、+L的结果加到序列前面和后面。

考虑二分答案w，那么每个点可匹配的范围为$a_i - w \dots a_i + w$，对应了目标序列上的一段，而我们需要在每个点的范围内取一个点且这些点构成了公差为1的等差数列。我们将第i个点的范围$L_i,R_i$变成$L_i-i,R_i-i$，我们只要判断这些区间是否有交即可。

---

Code

/************************************************
 * Au: Hany01
 * Prob: queue
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia
#define MOD (20000909)

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 2e5 + 5;

int n, L, a[maxn], b[maxn * 3], tot;

inline int check(int w) {
    static int l, r, L, R; L = -INF, R = INF;
    For(i, 1, n) {
        l = lower_bound(b + 1, b + 1 + tot, a[i] - w) - b - i,
        r = upper_bound(b + 1, b + 1 + tot, a[i] + w) - b - 1 - i;
        chkmax(L, l), chkmin(R, r);
        if (L > R) return 0;
    }
    return 1;
}

inline int Pow(int a, int b) {
    int Ans = 1;
    for ( ; b; b >>= 1, a = (LL)a * a % MOD) if (b & 1) Ans = (LL)Ans * a % MOD;
    return Ans;
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("queue.in", "r", stdin);
    freopen("queue.out", "w", stdout);
#endif

    n = read(), L = read();
    For(i, 1, n) a[i] = read();
    For(i, n + 1, n << 1) b[i] = read();
    sort(a + 1, a + 1 + n), sort(b + n + 1, b + 1 + (n << 1));
    For(i, n + 1, n << 1) b[i - n] = b[i] - L, b[i + n] = b[i] + L;
    tot = 3 * n;

    static int l = 0, r = L >> 1, mid;
    while (l < r) {
        mid = (l + r) >> 1;
        if (check(mid)) r = mid; else l = mid + 1;
    }
    printf("%d\n", l);

    return 0;
}