結果

問題 No.2029 Swap Min Max Min
ユーザー cutmdocutmdo
提出日時 2022-08-05 22:41:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 5,019 bytes
コンパイル時間 3,547 ms
コンパイル使用メモリ 254,796 KB
実行使用メモリ 8,832 KB
最終ジャッジ日時 2024-09-15 20:04:47
合計ジャッジ時間 5,620 ms
ジャッジサーバーID
（参考情報） 		judge4 / 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 14 ms
6,144 KB
testcase_04 AC 5 ms
5,376 KB
testcase_05 AC 8 ms
5,376 KB
testcase_06 AC 14 ms
5,376 KB
testcase_07 AC 16 ms
6,656 KB
testcase_08 AC 21 ms
7,936 KB
testcase_09 AC 7 ms
5,376 KB
testcase_10 AC 5 ms
5,376 KB
testcase_11 AC 9 ms
5,376 KB
testcase_12 AC 10 ms
5,376 KB
testcase_13 AC 23 ms
8,064 KB
testcase_14 AC 21 ms
5,376 KB
testcase_15 AC 25 ms
8,320 KB
testcase_16 AC 21 ms
5,376 KB
testcase_17 AC 22 ms
7,936 KB
testcase_18 AC 25 ms
8,704 KB
testcase_19 AC 21 ms
5,376 KB
testcase_20 AC 21 ms
5,376 KB
testcase_21 AC 21 ms
5,376 KB
testcase_22 AC 20 ms
5,376 KB
testcase_23 AC 23 ms
8,576 KB
testcase_24 AC 23 ms
8,576 KB
testcase_25 AC 20 ms
5,376 KB
testcase_26 AC 20 ms
5,376 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 AC 2 ms
5,376 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 2 ms
5,376 KB
testcase_35 AC 2 ms
5,376 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 21 ms
7,808 KB
testcase_39 AC 20 ms
5,376 KB
testcase_40 AC 17 ms
5,376 KB
testcase_41 AC 21 ms
8,192 KB
testcase_42 AC 22 ms
8,192 KB
testcase_43 AC 19 ms
5,376 KB
testcase_44 AC 23 ms
8,832 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/debug.hpp"
#include "./CompetitiveProgrammingCpp/Timer.hpp"
#include "./CompetitiveProgrammingCpp/sample.hpp"
#else
#define dump(...)
template<class T>constexpr inline auto d_val(T a, T b) { return a; }
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VVVVL = std::vector<VVVL>;
using VVVVVL = std::vector<VVVVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::deque;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
auto pow(signed, signed) { assert(false); }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }

/* constant value */
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

//=============================================================================================



class CumulativeSum {
    const ll size;
    std::vector<ll> sumList;
public:

    CumulativeSum() = delete;
    CumulativeSum(const std::vector<ll>& v) :size(v.size()), sumList(size + 1) {
        for(ll i = 0; i < size; ++i) {
            sumList[i + 1] = sumList[i] + v[i];
        }
    }
    ll get(ll n) {
        return sumList[n + 1];
    }
    ll get(ll l, ll r) {
        if(r < l) { return 0LL; }
        l = std::max(l, 0LL); r = std::min(r, size - 1);
        return sumList[r + 1] - sumList[l];
    }
};

signed main() {
    ll n;
    cin >> n;
    VL a(n);
    cin >> a;

    ll val = (n >> 1);
    cout << val << " ";
    if(n & 1) {
        ll ans = 0;
        ll need = 1;
        REP(i, n) if(a[i] <= val) {
            ans += std::abs(need - i);
            need += 2;
        }
        cout << ans << endl;
    } else {
        VL pos; pos.reserve(n);
        REP(i, n) if(a[i] > val) {
            pos.emplace_back(i);
        }
        ll sz = pos.size();
        VL left(sz), right(sz);
        REP(i, sz) {
            left[i] = std::abs(2 * i - pos[i]);
            right[i] = std::abs(2 * i + 1 - pos[i]);
        }
        auto ls = CumulativeSum(left);
        auto rs = CumulativeSum(right);
        ll ans = std::min(ls.get(sz - 1), rs.get(sz - 1));
        REP(i, sz - 1) {
            chmin(ans, ls.get(0, i) + rs.get(i + 1, sz - 1));
        }
        cout << ans << endl;
    }
}
0