#850396 (C++17) No.2248 max(C)-min(C)

• 問題: No.2248 max(C)-min(C)
• ユーザー: akua
• 提出日時: 2023-03-17 22:11:35
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 955 ms / 3,000 ms
• コード長: 6,861 bytes
• コンパイル時間: 5,616 ms
• コンパイル使用メモリ: 230,328 KB
• 実行使用メモリ: 102,276 KB
• 最終ジャッジ日時: 2023-10-18 15:04:00
• 合計ジャッジ時間: 37,871 ms
• ジャッジサーバーID （参考情報）: judge13 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	382 ms; 81,248 KB
testcase_01	AC	383 ms; 81,248 KB
testcase_02	AC	382 ms; 81,248 KB
testcase_03	AC	384 ms; 81,760 KB
testcase_04	AC	384 ms; 81,648 KB
testcase_05	AC	384 ms; 81,248 KB
testcase_06	AC	384 ms; 81,632 KB
testcase_07	AC	384 ms; 81,632 KB
testcase_08	AC	384 ms; 81,632 KB
testcase_09	AC	384 ms; 81,632 KB
testcase_10	AC	382 ms; 81,248 KB
testcase_11	AC	385 ms; 81,632 KB
testcase_12	AC	383 ms; 81,768 KB
testcase_13	AC	384 ms; 81,632 KB
testcase_14	AC	384 ms; 81,632 KB
testcase_15	AC	384 ms; 81,632 KB
testcase_16	AC	384 ms; 81,760 KB
testcase_17	AC	387 ms; 81,632 KB
testcase_18	AC	545 ms; 98,136 KB
testcase_19	AC	400 ms; 83,740 KB
testcase_20	AC	580 ms; 102,276 KB
testcase_21	AC	575 ms; 101,324 KB
testcase_22	AC	504 ms; 97,016 KB
testcase_23	AC	458 ms; 89,532 KB
testcase_24	AC	409 ms; 84,876 KB
testcase_25	AC	557 ms; 100,668 KB
testcase_26	AC	533 ms; 97,172 KB
testcase_27	AC	550 ms; 100,636 KB
testcase_28	AC	395 ms; 83,376 KB
testcase_29	AC	535 ms; 97,572 KB
testcase_30	AC	438 ms; 88,328 KB
testcase_31	AC	571 ms; 102,276 KB
testcase_32	AC	412 ms; 85,216 KB
testcase_33	AC	432 ms; 87,472 KB
testcase_34	AC	580 ms; 102,276 KB
testcase_35	AC	583 ms; 102,276 KB
testcase_36	AC	589 ms; 102,276 KB
testcase_37	AC	472 ms; 91,744 KB
testcase_38	AC	813 ms; 102,276 KB
testcase_39	AC	829 ms; 102,276 KB
testcase_40	AC	836 ms; 102,276 KB
testcase_41	AC	728 ms; 97,868 KB
testcase_42	AC	802 ms; 102,276 KB
testcase_43	AC	747 ms; 100,328 KB
testcase_44	AC	821 ms; 102,276 KB
testcase_45	AC	687 ms; 96,772 KB
testcase_46	AC	519 ms; 89,312 KB
testcase_47	AC	813 ms; 102,276 KB
testcase_48	AC	679 ms; 102,276 KB
testcase_49	AC	924 ms; 102,276 KB
testcase_50	AC	933 ms; 102,276 KB
testcase_51	AC	955 ms; 102,276 KB
testcase_52	AC	933 ms; 102,276 KB
testcase_53	AC	442 ms; 84,852 KB

ソースコード

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
using namespace std;  
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vvp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
ll gcd(ll x,ll y){
    if(y==0)return x;
    return gcd(y,x%y);
}
 
ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
ll mod =1e9+7;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    if (n<0) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(5000000); 
  using vm=vector<mint> ;
using vvm=vector<vm> ;
int valid(int x,int y,int h,int w){
  if(x>=0 && y>=0 && x<h && y<w)return 1;
  else return 0;
}
struct edge{
  int to; ll cost;
  edge(int to,ll cost) : to(to),cost(cost){}
};
using ve=vector<edge>;
using vve=vector<ve>;
// https://youtu.be/ylWYSurx10A?t=2352
template<typename T>
struct Matrix {
  int h, w;
  vector<vector<T>> d;
  Matrix() {}
  Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector<T>(w,val)) {}
  Matrix& unit() {
   // assert(h == w);
    rep(i,h) d[i][i] = 1;
    return *this;
  }
  const vector<T>& operator[](int i) const { return d[i];}
  vector<T>& operator[](int i) { return d[i];}
  Matrix operator*(const Matrix& a) const {
 //   assert(w == a.h);
    Matrix r(h, a.w);
    rep(i,h)rep(k,w)rep(j,a.w) {
      r[i][j] += d[i][k]*a[k][j];
    }
    return r;
  }
  Matrix pow(long long t) const {
  //  assert(h == w);
    if (!t) return Matrix(h,h).unit();
    if (t == 1) return *this;
    Matrix r = pow(t>>1);
    r = r*r;
    if (t&1) r = r*(*this);
    return r;
  }
  // https://youtu.be/-j02o6__jgs?t=11273
  /* mint only
  mint det() {
    assert(h == w);
    mint res = 1;
    rep(k,h) {
      for (int i = k; i < h; ++i) {
        if (d[i][k] == 0) continue;
        if (i != k) {
          swap(d[i],d[k]);
          res = -res;
        }
      }
      if (d[k][k] == 0) return 0;
      res *= d[k][k];
      mint inv = mint(1)/d[k][k];
      rep(j,h) d[k][j] *= inv;
      for (int i = k+1; i < h; ++i) {
        mint c = d[i][k];
        for (int j = k; j < h; ++j) d[i][j] -= d[k][j]*c;
      }
    }
    return res;
  }
  //*/
};
void solve(int test){
  int n; cin >> n;
  vi a(n),b(n);
  rep(i,n)cin >> a[i];
  rep(i,n)cin >> b[i];
  rep(i,n)if(a[i]>b[i])swap(a[i],b[i]);
  vi v;
  rep(i,n)v.push_back(a[i]);
  rep(i,n)v.push_back(b[i]);
  rep(i,n)v.push_back((a[i]+b[i])/2);
  sort(v.begin(),v.end());
  multiset<int> st;
  vi it(n,0);
  rep(i,n)st.insert(a[i]);
  priority_queue<P,vector<P>,greater<P> > q;
  rep(i,n)q.push(P(a[i],i));
  ll ans=inf;
  for(auto u:v){
    int ok=1;
    while(q.size()){
      if(q.top().first<u){
        int i=q.top().second;
        st.erase(q.top().first);
        q.pop();
        it[i]++;
        if(it[i]==3){
          ok=0;
          break;
        }
        if(it[i]==1){
          st.insert((a[i]+b[i])/2);
          q.push(P((a[i]+b[i])/2,i));
        }
        else {
          st.insert(b[i]);
          q.push(P(b[i],i));
        }
      }
      else break;
    }
    if(!ok)break;
    chmin(ans,*st.rbegin()-u+0ll);
  }
   cout << ans << endl;

  
}
//g++ main.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
   int t=1; //cin >> t;
   rep(test,t)solve(test);
}