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

提出ソース

結果

問題	No.2248 max(C)-min(C)
ユーザー	dyktr_06
提出日時	2023-03-17 21:57:39
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	429 ms / 3,000 ms
コード長	5,201 bytes
コンパイル時間	4,548 ms
コンパイル使用メモリ	271,936 KB
実行使用メモリ	18,944 KB
最終ジャッジ日時	2024-09-18 10:50:49
合計ジャッジ時間	13,749 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	3 ms 5,376 KB
testcase_07	AC	3 ms 5,376 KB
testcase_08	AC	3 ms 5,376 KB
testcase_09	AC	3 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	3 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	139 ms 16,820 KB
testcase_19	AC	15 ms 5,376 KB
testcase_20	AC	171 ms 18,812 KB
testcase_21	AC	178 ms 18,092 KB
testcase_22	AC	102 ms 13,548 KB
testcase_23	AC	57 ms 9,852 KB
testcase_24	AC	21 ms 5,908 KB
testcase_25	AC	149 ms 17,512 KB
testcase_26	AC	129 ms 15,820 KB
testcase_27	AC	153 ms 17,248 KB
testcase_28	AC	12 ms 5,376 KB
testcase_29	AC	140 ms 16,244 KB
testcase_30	AC	47 ms 8,560 KB
testcase_31	AC	174 ms 18,900 KB
testcase_32	AC	24 ms 6,328 KB
testcase_33	AC	41 ms 8,112 KB
testcase_34	AC	169 ms 18,816 KB
testcase_35	AC	173 ms 18,808 KB
testcase_36	AC	184 ms 18,776 KB
testcase_37	AC	76 ms 11,536 KB
testcase_38	AC	319 ms 18,812 KB
testcase_39	AC	318 ms 18,816 KB
testcase_40	AC	339 ms 18,812 KB
testcase_41	AC	252 ms 16,536 KB
testcase_42	AC	328 ms 18,816 KB
testcase_43	AC	262 ms 17,228 KB
testcase_44	AC	321 ms 18,816 KB
testcase_45	AC	233 ms 15,260 KB
testcase_46	AC	89 ms 9,564 KB
testcase_47	AC	335 ms 18,864 KB
testcase_48	AC	196 ms 18,812 KB
testcase_49	AC	429 ms 18,808 KB
testcase_50	AC	402 ms 18,944 KB
testcase_51	AC	416 ms 18,812 KB
testcase_52	AC	399 ms 18,812 KB
testcase_53	AC	40 ms 5,992 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <typename T>
struct DoubleEndedPriorityQueue{
    multiset<T> q;
    DoubleEndedPriorityQueue(){ }
    
    void push(const T &x){
        q.insert(x);
    }
    
    void pop_min(){
        assert(!q.empty());
        q.erase(q.begin());
    }
    
    void pop_max(){
        assert(!q.empty());
        q.erase(--q.end());
    }
    
    T get_min() const{
        return *q.begin();
    }
    
    T get_max() const{
        return *(--q.end());
    }
    
    size_t size() const{
        return q.size();
    }
};

ll n;
vll a, b;

void input(){
    in(n);
    vin(a, n);
    vin(b, n);
}

void solve(){
    rep(i, n){
        if(a[i] > b[i]) swap(a[i], b[i]);
    }
    DoubleEndedPriorityQueue<tuple<ll, ll, ll>> q;
    rep(i, n){
        q.push({a[i], (b[i] - a[i]) / 2, 2});
    }
    ll ans = get<0>(q.get_max()) - get<0>(q.get_min());
    while(true){
        auto [x, d, cnt] = q.get_min();
        q.pop_min();
        if(cnt == 0) break;
        q.push({x + d, d, --cnt});
        chmin(ans, get<0>(q.get_max()) - get<0>(q.get_min()));
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード