Submission #36701789

---

Source Code Expand

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#include <cassert>
using namespace std;
using ll = long long;
const double pi = 3.14159265359;
const ll INF = 1LL << 60;

template<class T> inline bool chmin(T& a, T b){ if (a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b){ if (a < b){a = b; return true;} return false;}

//using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;  // mint::set_mod(p); later
//using mint = static_modint<1000000009>;

int main()
{
  cin.tie(0); cout.tie(0); ios::sync_with_stdio(false);

  int n;
  ll l;
  cin >> n >> l;

  vector<ll> a(n);
  for (ll &t : a) cin >> t;

  ll ans = INF;

  for (ll na : a){
    ll b = l - na;
    auto p = lower_bound(a.begin(), a.end(), b);

    if (p != a.end()){
      ll x = *p;
      ll y = l - x;
      x += na;
      y += b;
      chmin(ans, abs(x - y));
    }

    if (p != a.begin()){
      p--;
      ll x = *p;
      ll y = l - x;
      x += na;
      y += b;
      chmin(ans, abs(x - y));
    }
  }

  ans += 2*l;
  cout << ans << endl;
  
  return 0;
}

Submission Info

Judge Result