結果

問題 No.2029 Swap Min Max Min
ユーザー 👑 hitonanodehitonanode
提出日時 2022-08-06 18:36:24
言語 C++23(draft)
(gcc 11.2.0 + boost 1.78.0)
結果
AC  
実行時間 22 ms / 2,000 ms
コード長 6,244 Byte
コンパイル時間 1,558 ms
使用メモリ 6,204 KB
最終ジャッジ日時 2022-08-06 18:36:32
合計ジャッジ時間 5,152 ms
ジャッジサーバーID
(参考情報)
judge13 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
3,476 KB
testcase_01 AC 2 ms
3,400 KB
testcase_02 AC 1 ms
3,464 KB
testcase_03 AC 11 ms
4,780 KB
testcase_04 AC 4 ms
3,600 KB
testcase_05 AC 7 ms
3,480 KB
testcase_06 AC 12 ms
3,620 KB
testcase_07 AC 13 ms
4,784 KB
testcase_08 AC 19 ms
5,740 KB
testcase_09 AC 6 ms
3,876 KB
testcase_10 AC 5 ms
3,428 KB
testcase_11 AC 7 ms
4,268 KB
testcase_12 AC 7 ms
3,472 KB
testcase_13 AC 21 ms
6,120 KB
testcase_14 AC 18 ms
3,864 KB
testcase_15 AC 22 ms
6,204 KB
testcase_16 AC 16 ms
3,868 KB
testcase_17 AC 19 ms
6,168 KB
testcase_18 AC 22 ms
6,124 KB
testcase_19 AC 18 ms
3,756 KB
testcase_20 AC 17 ms
3,816 KB
testcase_21 AC 17 ms
3,872 KB
testcase_22 AC 17 ms
3,848 KB
testcase_23 AC 19 ms
6,088 KB
testcase_24 AC 18 ms
6,128 KB
testcase_25 AC 16 ms
3,868 KB
testcase_26 AC 15 ms
3,856 KB
testcase_27 AC 1 ms
3,348 KB
testcase_28 AC 1 ms
3,504 KB
testcase_29 AC 1 ms
3,500 KB
testcase_30 AC 2 ms
3,400 KB
testcase_31 AC 2 ms
3,524 KB
testcase_32 AC 2 ms
3,368 KB
testcase_33 AC 1 ms
3,548 KB
testcase_34 AC 1 ms
3,408 KB
testcase_35 AC 1 ms
3,400 KB
testcase_36 AC 2 ms
3,548 KB
testcase_37 AC 2 ms
3,524 KB
testcase_38 AC 17 ms
5,816 KB
testcase_39 AC 14 ms
3,780 KB
testcase_40 AC 14 ms
3,888 KB
testcase_41 AC 17 ms
6,048 KB
testcase_42 AC 17 ms
6,156 KB
testcase_43 AC 15 ms
3,748 KB
testcase_44 AC 18 ms
6,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) 0
#define dbgif(cond, x) 0
#endif

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    dbg(A);
    if (N % 2) {
        int nxt = 1;
        lint ret = 0;
        REP(i, N) {
            if (A[i] <= N / 2) {
                ret += abs(i - nxt);
                nxt += 2;
            }
        }
        cout << N / 2 << ' ' << ret << endl;
    } else {
        vector<lint> left{0}, right{0};
        int nxt = 1;
        REP(i, N) {
            if (A[i] <= N / 2) {
                lint tmp = left.back() + abs(i - nxt);
                left.push_back(tmp);
                nxt += 2;
            }
        }
        nxt = N - 2;
        IREP(i, N) {
            if (A[i] <= N / 2) {
                lint tmp = right.back() + abs(i - nxt);
                right.push_back(tmp);
                nxt -= 2;
            }
        }
        dbg(left);
        dbg(right);
        lint ret = 1LL << 60;
        REP(i, left.size()) {
            chmin(ret, left[i] + right[right.size() - 1 - i]);
        }
        cout << N / 2 << ' ' << ret << endl;
    }
}
0