結果
問題 | No.2665 Minimize Inversions of Deque |
ユーザー | risujiroh |
提出日時 | 2024-03-08 21:16:24 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 2,885 bytes |
コンパイル時間 | 2,859 ms |
コンパイル使用メモリ | 266,776 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-09-29 18:54:34 |
合計ジャッジ時間 | 6,079 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 40 |
ソースコード
#if __INCLUDE_LEVEL__ == 0#include __BASE_FILE__namespace {void solve() {int n;scan(n);std::vector<int> p(n);scan(p);i64 ans = 0;atcoder::fenwick_tree<int> f(n + 1);std::deque<int> a;a.push_back(p[0]);f.add(p[0], 1);for (const int e : p | views::drop(1)) {const int x = f.sum(0, e);const int y = f.sum(e + 1, n + 1);if (x < y) {a.push_front(e);} else if (y < x) {a.push_back(e);} else if (e < a.front()) {a.push_front(e);} else {a.push_back(e);}f.add(e, 1);ans += std::min(x, y);}print(ans);print(a);}} // namespaceint main() {std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout << std::setprecision(DBL_DECIMAL_DIG);int t;scan(t);while (t--) {solve();}}#else // __INCLUDE_LEVEL__#include <bits/stdc++.h>#include <atcoder/fenwicktree>template <class T, class U = T>bool chmin(T& x, U&& y) {return y < x && (x = std::forward<U>(y), true);}template <class T, class U = T>bool chmax(T& x, U&& y) {return x < y && (x = std::forward<U>(y), true);}template <std::signed_integral T = int>T inf() {T ret;std::memset(&ret, 0x3f, sizeof(ret));return ret;}template <std::floating_point T>T inf() {return std::numeric_limits<T>::infinity();}template <class T>concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;template <class T>concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;namespace std {istream& operator>>(istream& is, Range auto&& r) {for (auto&& e : r) {is >> e;}return is;}istream& operator>>(istream& is, Tuple auto&& t) {return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);}ostream& operator<<(ostream& os, Range auto&& r) {for (string_view sep = ""; auto&& e : r) {os << exchange(sep, " ") << e;}return os;}ostream& operator<<(ostream& os, Tuple auto&& t) {const auto f = [&](auto&... xs) -> ostream& {[[maybe_unused]] string_view sep = "";((os << exchange(sep, " ") << xs), ...);return os;};return apply(f, t);}} // namespace stdvoid scan(auto&&... xs) { std::cin >> std::tie(xs...); }void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }template <class F>class fix {public:explicit fix(F f) : f_(std::move(f)) {}decltype(auto) operator()(auto&&... xs) const {return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);}private:F f_;};inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }inline auto rep(int n) { return rep(0, n); }inline auto rep1(int l, int r) { return rep(l, r + 1); }inline auto rep1(int n) { return rep(1, n + 1); }namespace ranges = std::ranges;namespace views = std::views;using i64 = std::int64_t;#endif // __INCLUDE_LEVEL__