結果
問題 | No.694 square1001 and Permutation 3 |
ユーザー |
|
提出日時 | 2020-08-09 00:48:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,087 ms / 3,000 ms |
コード長 | 2,863 bytes |
コンパイル時間 | 1,347 ms |
コンパイル使用メモリ | 107,472 KB |
最終ジャッジ日時 | 2025-01-12 19:11:38 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 13 |
ソースコード
#include <iostream>#include <algorithm>#include <vector>#include <map>#include <functional>template <class T>std::map<T, int> compress(std::vector<T>& v) {std::sort(v.begin(), v.end());v.erase(std::unique(v.begin(), v.end()), v.end());std::map<T, int> rev;for (int i = 0; i < (int)v.size(); ++i) rev[v[i]] = i;return rev;}template <class T>struct SegmentTree {using Merger = std::function<T(T, T)>;int length;std::vector<T> dat;T unit;Merger merge;SegmentTree() = default;SegmentTree(int n, const T& unit, const Merger& merge): length(1), unit(unit), merge(merge) {while (length < n) length <<= 1;dat.assign(length * 2, unit);}template <class Container>SegmentTree(const Container& elems, const T& unit, const Merger& merge): length(1), unit(unit), merge(merge) {int n = elems.size();while (length < n) length <<= 1;dat.assign(length * 2, unit);std::copy(elems.begin(), elems.end(), dat.begin() + length);for (int nidx = length - 1; nidx >= 1; --nidx) {T vl = dat[nidx * 2 + 0];T vr = dat[nidx * 2 + 1];dat[nidx] = merge(vl, vr);}}void update(int nidx, const T& elem) {nidx += length;dat[nidx] = elem;while (nidx > 0) {nidx >>= 1;T vl = dat[nidx * 2 + 0];T vr = dat[nidx * 2 + 1];dat[nidx] = merge(vl, vr);}}T fold(int ql, int qr) const {ql = std::max(ql, 0);qr = std::min(qr, length);ql += length, qr += length;T lacc = unit, racc = unit;while (ql < qr) {if (ql & 1) {lacc = merge(lacc, dat[ql]);++ql;}if (qr & 1) {--qr;racc = merge(dat[qr], racc);}ql >>= 1, qr >>= 1;}return merge(lacc, racc);}T get(int idx) const { return dat[idx + length]; }T fold_all() const { return dat[1]; }};using lint = long long;void solve() {int n;std::cin >> n;std::vector<int> xs(n);for (auto& x : xs) std::cin >> x;int m;{auto ys = xs;auto revx = compress(ys);m = ys.size();for (auto& x : xs) x = revx[x];}SegmentTree<lint>seg(m, 0, [](auto a, auto b) { return a + b; });lint sum = 0;for (auto x : xs) {sum += seg.fold(x + 1, m);seg.update(x, seg.get(x) + 1);}for (auto x : xs) {std::cout << sum << "\n";sum -= seg.fold(0, x);sum += seg.fold(x + 1, m);}}int main() {std::cin.tie(nullptr);std::ios::sync_with_stdio(false);solve();return 0;}