結果

問題 No.2248 max(C)-min(C)
コンテスト
ユーザー srjywrdnprkt
提出日時 2023-05-04 23:29:26
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 335 ms / 3,000 ms
コード長 1,038 bytes
コンパイル時間 1,246 ms
コンパイル使用メモリ 117,128 KB
最終ジャッジ日時 2025-02-12 17:01:56
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 51
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/c++/13/bits/memory_resource.h:47,
                 from /usr/include/c++/13/string:58,
                 from /usr/include/c++/13/bits/locale_classes.h:40,
                 from /usr/include/c++/13/bits/ios_base.h:41,
                 from /usr/include/c++/13/ios:44,
                 from /usr/include/c++/13/ostream:40,
                 from /usr/include/c++/13/iostream:41,
                 from main.cpp:1:
In constructor ‘constexpr std::_Head_base<_Idx, _Head, false>::_Head_base(_UHead&&) [with _UHead = int&; long unsigned int _Idx = 2; _Head = int]’,
    inlined from ‘constexpr std::_Tuple_impl<_Idx, _Head>::_Tuple_impl(_UHead&&) [with _UHead = int&; long unsigned int _Idx = 2; _Head = int]’ at /usr/include/c++/13/tuple:514:38,
    inlined from ‘constexpr std::_Tuple_impl<_Idx, _Head, _Tail ...>::_Tuple_impl(_UHead&&, _UTail&& ...) [with _UHead = int&; _UTail = {int&}; <template-parameter-2-3> = void; long unsigned int _Idx = 1; _Head = int; _Tail = {int}]’ at /usr/include/c++/13/tuple:293:38,
    inlined from ‘constexpr std::_Tuple_impl<_Idx, _Head, _Tail ...>::_Tuple_impl(_UHead&&, _UTail&& ...) [with _UHead = int&; _UTail = {int&, int&}; <template-parameter-2-3> = void; long unsigned int _Idx = 0; _Head = int; _Tail = {int, int}]’ at /usr/include/c++/13/tuple:293:38,
    inlined from ‘constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {int&, int&, int&}; bool _Valid = true; typename std::enable_if<_TCC<_Valid>::__is_implicitly_constructible<_UElements ...>(), bool>::type <anonymous> = true; _Elements = {int, int, int}]’ at /usr/include/c++/13/tuple:891:54,
    inlined from ‘int main()’ at main.cpp:32:17:
/usr/include/c++/13/tuple:201:11: warning: ‘u’ may be used uninitialized [-Wmaybe-uninitialized]
  201 |         : _M_head_impl(std::forward<_UHead>(__h)) { }
      |           ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function ‘int main()’:
ma

ソースコード

diff #
raw source code 

#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

template<typename T> using pq = priority_queue<T, vector<T>, greater<T>>;

int main(){

    int N, mx=0, c, ans=1e9, u, v;
    cin >> N;
    vector<int> A(N), B(N);
    vector<vector<int>> C(N, vector<int>(3));
    pq<tuple<int, int, int>> que;
    for (int i=0; i<N; i++) cin >> A[i];
    for (int i=0; i<N; i++) cin >> B[i];

    for (int i=0; i<N; i++){
        if (A[i] > B[i]) swap(A[i], B[i]);
        C[i][0] = A[i]; C[i][1] = (A[i]+B[i])/2; C[i][2] = B[i];
        que.push({A[i], i, u});
        mx = max(mx, A[i]);
    }

    while(1){
        tie(c, u, v) = que.top();
        que.pop();
        ans = min(ans, mx-c);
        if (v == 2) break;
        mx = max(mx, C[u][v+1]);
        que.push({C[u][v+1], u, v+1});
    }

    cout << ans << endl;

    return 0;
}
0