結果

問題 No.2248 max(C)-min(C)
ユーザー mikammikam
提出日時 2023-03-17 22:13:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 439 ms / 3,000 ms
コード長 4,116 bytes
コンパイル時間 4,881 ms
コンパイル使用メモリ 275,784 KB
実行使用メモリ 49,124 KB
最終ジャッジ日時 2024-09-18 11:19:03
合計ジャッジ時間 17,255 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 4 ms
5,376 KB
testcase_07 AC 4 ms
5,376 KB
testcase_08 AC 4 ms
5,376 KB
testcase_09 AC 4 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 3 ms
5,376 KB
testcase_13 AC 4 ms
5,376 KB
testcase_14 AC 3 ms
5,376 KB
testcase_15 AC 4 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 4 ms
5,376 KB
testcase_18 AC 367 ms
42,780 KB
testcase_19 AC 36 ms
8,400 KB
testcase_20 AC 426 ms
48,036 KB
testcase_21 AC 404 ms
45,824 KB
testcase_22 AC 268 ms
34,300 KB
testcase_23 AC 162 ms
22,608 KB
testcase_24 AC 55 ms
11,128 KB
testcase_25 AC 379 ms
45,580 KB
testcase_26 AC 334 ms
39,900 KB
testcase_27 AC 366 ms
44,780 KB
testcase_28 AC 28 ms
7,420 KB
testcase_29 AC 344 ms
41,164 KB
testcase_30 AC 128 ms
18,992 KB
testcase_31 AC 439 ms
48,268 KB
testcase_32 AC 66 ms
12,096 KB
testcase_33 AC 119 ms
16,828 KB
testcase_34 AC 428 ms
48,436 KB
testcase_35 AC 433 ms
48,052 KB
testcase_36 AC 419 ms
48,296 KB
testcase_37 AC 201 ms
26,924 KB
testcase_38 AC 417 ms
48,360 KB
testcase_39 AC 416 ms
48,672 KB
testcase_40 AC 418 ms
48,140 KB
testcase_41 AC 356 ms
41,960 KB
testcase_42 AC 418 ms
49,112 KB
testcase_43 AC 362 ms
43,732 KB
testcase_44 AC 429 ms
49,124 KB
testcase_45 AC 322 ms
39,500 KB
testcase_46 AC 164 ms
21,964 KB
testcase_47 AC 422 ms
48,148 KB
testcase_48 AC 337 ms
38,560 KB
testcase_49 AC 364 ms
34,164 KB
testcase_50 AC 364 ms
35,624 KB
testcase_51 AC 357 ms
34,212 KB
testcase_52 AC 354 ms
35,544 KB
testcase_53 AC 47 ms
8,692 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
template<class T> void print(T& a){cout <<a<< '\n';}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout<< a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;}
void YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
//using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}
int op(int a,int b){return min(a,b);}
int e(){return INF;}
signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n);
    vi a(n),b(n);cin>>a>>b;
    if(n==1){
        print(0);
        exit(0);
    }
    vp c;
    rep(i,n){
        c.push_back({a[i],i});
        c.push_back({b[i],i});
        c.push_back({(a[i]+b[i])/2,i});
    }
    sort(all(c));
    segtree<int,op,e> seg(vi(n,0));
    multiset<int> st;
    int m = c.size();
    int r = 0;
    bool ok = false;
    int ans = INF;
    rep(l,m){
        while(r<m&&!ok){
            auto [val,id] = c[r];
            st.insert(val);
            seg.set(id,seg.get(id)+1);
            r++;
            if(seg.all_prod()>0)ok = true;
        }
        if(ok){
            chmin(ans,c[r-1].first-c[l].first);
        }
        auto [val,id] = c[l];
        st.erase(st.find(val));
        seg.set(id,seg.get(id)-1);
        if(seg.all_prod()==0)ok=false;
    }
    print(ans);
    return 0;
}
0