結果

問題 No.2248 max(C)-min(C)
ユーザー sayan maitisayan maiti
提出日時 2023-03-17 23:19:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,822 bytes
コンパイル時間 2,641 ms
コンパイル使用メモリ 218,928 KB
実行使用メモリ 20,380 KB
最終ジャッジ日時 2024-09-18 12:22:50
合計ジャッジ時間 10,566 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 3 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 4 ms
5,376 KB
testcase_08 AC 4 ms
5,376 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 AC 3 ms
5,376 KB
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 3 ms
5,376 KB
testcase_13 AC 3 ms
5,376 KB
testcase_14 AC 4 ms
5,376 KB
testcase_15 AC 3 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 3 ms
5,376 KB
testcase_18 AC 198 ms
18,160 KB
testcase_19 AC 21 ms
5,376 KB
testcase_20 AC 241 ms
20,252 KB
testcase_21 AC 219 ms
19,580 KB
testcase_22 AC 143 ms
14,592 KB
testcase_23 AC 82 ms
10,392 KB
testcase_24 AC 30 ms
6,136 KB
testcase_25 AC 204 ms
18,812 KB
testcase_26 AC 174 ms
17,080 KB
testcase_27 AC 206 ms
18,648 KB
testcase_28 AC 16 ms
5,376 KB
testcase_29 AC 182 ms
17,556 KB
testcase_30 AC 64 ms
9,072 KB
testcase_31 AC 235 ms
20,380 KB
testcase_32 AC 34 ms
6,460 KB
testcase_33 AC 60 ms
8,628 KB
testcase_34 AC 238 ms
20,376 KB
testcase_35 AC 241 ms
20,252 KB
testcase_36 AC 238 ms
20,252 KB
testcase_37 AC 104 ms
12,096 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 AC 86 ms
14,744 KB
testcase_49 AC 230 ms
20,252 KB
testcase_50 AC 229 ms
20,380 KB
testcase_51 AC 235 ms
20,252 KB
testcase_52 AC 227 ms
20,376 KB
testcase_53 AC 30 ms
6,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
Someday at the sound of the night blooming
Simply take away the loneliness from me
Well then, goodbye, my drifting emotions
I'll close my eyes and have a good night. See you tomorrow

At the moment, it's just a little bit hard
I won't cry or something, I'm just trying to walk it off
I don't know what will be on my mind a few minutes later, and I still won't know even today

Wobbly, Wobbly, Wobbly, Wobbly floating
Ah, I'm such a bad child. An inferior student

Is that okay? Is that really okay?
I can't laugh well today, is that okay?
Are you ready? Hey! I said "are you ready?"
Let's just doze off into the warm corners of the night

Is that okay? Ah, Is that really okay?
I don't know what to say, is that okay?
Like that, come on, just like that
I'll dance with you, lalulalila~ See you later

Credits:- MIMI
Song:- Escape
*/


// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define fastio()                  \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
//typedef __int128 bigll;
typedef long long ll;
#define ull unsigned long long
#define ld long double
#define pow power
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define siz(a) int((a).size())
#define For(i,a,b) for(int (i)=(a);(i) < (b); ++(i))
#define Forl(i,a,b) for(ll (i)=(a);(i) < (b); ++(i))
#define Forn(i,a,b) for(int (i)=(a);(i) >= (b); --(i))
#define Fornl(i,a,b) for(ll (i)=(a);(i) >= (b); --(i))
#define endl "\n"
#define pi 3.14159265
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
const ll mod = 1000 * 1000 * 1000 + 7;
const ll mod1 = 998244353;
const ll INF  = 1ll*1000*1000*1000*1000*1000*1000 + 7; 
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//typedef tree<pair<ll, ll>,null_type,less<pair<ll, ll>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;


ll power(ll x, ll y) 
{ 
   ll res = 1;      
  
   
    while (y > 0) 
    { 
       
        if (y & 1) 
            res = (long long)(res*x);  // adding powers wherever bit is set
  

        y = y>>1; 

        x = (long long)(x*x); // increasing power by 2

        //cout<<x<<'\n'; 
    } 
    return res; 
} 




// Stolen Templates

template<typename F, typename S>
ostream& operator <<(ostream& ostream, pair<F, S>& p) {
    cout << p.first << " " << p.second;
    return ostream;
}
 
template<typename T>
ostream& operator <<(ostream& ostream, vector<T>& v) {
    for(auto& element : v) {
        cout << element << " ";
    }
    return ostream;
}
 
template<typename T>
ostream& operator <<(ostream& ostream, vector<vector<T>>& v) {
    for(auto& row : v) {
        for(auto& cell : row) {
            cout << cell << " ";
        }
        cout << "\n";
    }
    return ostream;
}
 
template<typename F, typename S>
istream& operator >>(istream& istream, pair<F, S>& p) {
    cin >> p.first >> p.second;
    return istream;
}
 
template<typename T>
istream& operator >>(istream& istream, vector<T>& v) {
    for(auto& element : v) {
        cin >> element;
    }
    return istream;
}

void print() {
    cout << endl;
}

template <typename T> void print(const T& t) {
    cout << t << endl;
}

template <typename First, typename... Rest> void print(const First& first, const Rest&... rest) {
    cout << first << " ";
    print(rest...); // recursive call using pack expansion syntax
}

void dbg() {
    cerr << endl;
}

template <typename T> void dbg(const T& t) {
    cerr << t << endl;
}

template <typename First, typename... Rest> void dbg(const First& first, const Rest&... rest) {
    cerr << first << " ";
    dbg(rest...); // recursive call using pack expansion syntax
}

// Stolen Templates end here

// ostream& operator << (ostream&, bigll val) {
//     string temp;
//     while (val > 0) { temp.pb(val % 10 + '0'); val /= 10; }
//     for(int i = siz(temp) - 1; i >= 0; i--)cout<<temp[i];
//     return cout;
// } // inside class

// istream& operator >> (istream&, bigll & val) {
//     string temp; cin>>temp; val = 0;
//     for(int i = 0; i < siz(temp); i++)val = val * 10 + temp[i] - '0';
//     return cin;
// } // for cin we use & because we want the original object we are sending not a copy of it


int main()
{

// #ifndef ONLINE_JUDGE    
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif


// If you plan on using set / map do check if it will TLE or not
fastio();


    ll n;
    cin>>n;

    vector <ll> a(n),b(n);
    cin>>a>>b;
    vector <ll> vux;

    For(i,0,n) {
        if (a[i] > b[i])swap(a[i], b[i]);
        vux.pb(a[i]);
        vux.pb(b[i]);
        vux.pb((a[i] + b[i]) / 2);
    }

    sort(all(vux));
    ll m = siz(vux);
    ll req = vux[m / 2];

    set <ll> fin;

    For(i,0,n) {
        //ll to_insert = 0;
        //to_insert = a[i];
        vector <pll> temp;
        temp.pb({abs(a[i] - req), 0});
        temp.pb({abs(b[i] - req), 2});
        temp.pb({abs((a[i] + b[i]) / 2 - req), 1});
        sort(all(temp));

        if (temp[0].ss == 0)fin.insert(a[i]);
        if (temp[0].ss == 1)fin.insert((a[i] + b[i]) / 2);
        if (temp[0].ss == 2)fin.insert(b[i]);
    }

    cout<<*fin.rbegin() - *fin.begin();

return 0;
}

// check all product based operations for integer overflow
// careful of renamed variables especially in loops
//python interactive_runner.py python local_testing_tool.py 0 -- c.exe
0