結果
問題 | No.2665 Minimize Inversions of Deque |
ユーザー | sgfc |
提出日時 | 2024-03-08 21:25:22 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 106 ms / 2,000 ms |
コード長 | 3,906 bytes |
コンパイル時間 | 9,132 ms |
コンパイル使用メモリ | 450,104 KB |
実行使用メモリ | 10,500 KB |
最終ジャッジ日時 | 2024-09-29 18:57:38 |
合計ジャッジ時間 | 13,964 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 40 |
ソースコード
#include "bits/stdc++.h"#include <stdio.h>#include <math.h>#include "atcoder/all"#include <float.h>#include <boost/multiprecision/cpp_int.hpp>using namespace boost::multiprecision;using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using mint = modint998244353;using mint2 = modint1000000007;const double eps = 1e-9;#define REP(i, n) for (ll i = 0; i < ll(n); ++i)#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)#define REPD(i, init) for (ll i = init; i >=0; --i)#define REPDI(i, init, n) for (ll i = init; i >=n; --i)#define REPE(i, c) for (const auto& i : c)#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;#define VL(a, n) vector<ll> a; a.assign(n, 0);#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);using vd = vector<double>;using pl = pair<ll, ll>;struct uv { ll u; ll v; ll c; };#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }template <class T = long long> using pql = priority_queue<T>;template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;using vm = vector<mint>; using vvm = vector<vm>;void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end()? V() : mp.at(key); }long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }//セグ木(sum)ll op(ll a, ll b) { return a + b; }ll e() { return 0; }using st = segtree<ll, op, e>;int main() {cin.tie(nullptr);ios::sync_with_stdio(false);TCASE(){ll n;cin >> n;VLI(p, n);REP(i, n) p[i]--;deque<ll> ans;st seg(n);ll ans1 = 0;REP(i, n) {if (ans.empty()) {ans.push_back(p[i]);seg.set(p[i], 1);continue;}ll m1 = seg.prod(0, p[i]);ll m2 = seg.prod(p[i], n);if (m1 > m2) {ans.push_back(p[i]);ans1 += m2;}else if (m1 < m2) {ans.push_front(p[i]);ans1 += m1;}else {if (p[i] < ans.front()) {ans.push_front(p[i]);ans1 += m1;}else {ans.push_back(p[i]);ans1 += m2;}}seg.set(p[i], 1);}cout << ans1 << endl;REP(i, n) ans[i] += 1;ov(ans);cout << endl;}}