結果
問題 | No.2304 Distinct Elements |
ユーザー |
![]() |
提出日時 | 2023-05-12 22:13:04 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 75 ms / 3,000 ms |
コード長 | 10,704 bytes |
コンパイル時間 | 1,959 ms |
コンパイル使用メモリ | 183,988 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-28 18:39:54 |
合計ジャッジ時間 | 6,222 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 58 |
ソースコード
#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; }const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }template <class 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 <class 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 <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v<< ','; os << ']'; return os; }template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);},tpl); return is; }template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) {((os << args << ','), ...);}, tpl); return os << ')'; }template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os<< v << ','; os << '}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os <<'}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v <<','; os << '}'; return os; }template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for(auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCALconst 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) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET<< std::endl#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " <<__FILE__ << COLOR_RESET << std::endl : std::cerr)#else#define dbg(x) ((void)0)#define dbgif(cond, x) ((void)0)#endif#include <algorithm>#include <cassert>#include <limits>#include <queue>#include <utility>// Slope trick: fast operations for convex piecewise-linear functions// Implementation idea:// - https://maspypy.com/slope-trick-1-%E8%A7%A3%E8%AA%AC%E7%B7%A8// - https://ei1333.github.io/library/structure/others/slope-trick.cpptemplate <class T, T INF = std::numeric_limits<T>::max() / 2> class slope_trick {T min_f;T displacement_l, displacement_r;std::priority_queue<T, std::vector<T>, std::less<T>> L;std::priority_queue<T, std::vector<T>, std::greater<T>> R;void pushR(const T &a) { R.push(a - displacement_r); }T topR() const { return R.empty() ? INF : R.top() + displacement_r; }T popR() {auto ret = topR();if (R.size()) R.pop();return ret;}void pushL(const T &a) { L.push(a + displacement_l); }T topL() const { return L.empty() ? -INF : L.top() - displacement_l; }T popL() {auto ret = topL();if (L.size()) L.pop();return ret;}public:// Initialize, f(x) = 0 everywhere// Complexity: O(1)slope_trick() : min_f(0), displacement_l(0), displacement_r(0) {static_assert(INF > 0, "INF must be greater than 0");}inline int sizeL() const noexcept { return L.size(); }inline int sizeR() const noexcept { return R.size(); }// argmin f(x), min f(x)// Complexity: O(1)using Q = struct { T min, lo, hi; };Q get_min() const { return {min_f, topL(), topR()}; }// f(x) += b// Complexity: O(1)slope_trick &add_const(const T &b) { return min_f += b, *this; }// f(x) += max(x - a, 0) _/// Complexity: O(log n)slope_trick &add_relu(const T &a) {return min_f += std::max(T(0), topL() - a), pushL(a), pushR(popL()), *this;}// f(x) += max(a - x, 0) \_// Complexity: O(log n)slope_trick &add_irelu(const T &a) {return min_f += std::max(T(0), a - topR()), pushR(a), pushL(popR()), *this;}// f(x) += |x - a| \/// Complexity: O(log n)slope_trick &add_abs(const T &a) { return add_relu(a).add_irelu(a); }// f(x) <- min_{0 <= y <= w} f(x + y) .\ -> \_// Complexity: O(1)slope_trick &move_left_curve(const T &w) { return assert(w >= 0), displacement_l += w, *this; }// f(x) <- min_{0 <= y <= w} f(x - y) /. -> _/// Complexity: O(1)slope_trick &move_right_curve(const T &w) {return assert(w >= 0), displacement_r += w, *this;}// f(x) <- f(x - dx) \/. -> .\/// Complexity: O(1)slope_trick &translate(const T &dx) {return displacement_l -= dx, displacement_r += dx, *this;}// return f(x), f destructiveT get_destructive(const T &x) {T ret = get_min().min;while (L.size()) ret += std::max(T(0), popL() - x);while (R.size()) ret += std::max(T(0), x - popR());return ret;}// f(x) += g(x), g destructiveslope_trick &merge_destructive(slope_trick<T, INF> &g) {if (sizeL() + sizeR() > g.sizeL() + g.sizeR()) {std::swap(min_f, g.min_f);std::swap(displacement_l, g.displacement_l);std::swap(displacement_r, g.displacement_r);std::swap(L, g.L);std::swap(R, g.R);}min_f += g.get_min().min;while (g.L.size()) add_irelu(g.popL());while (g.R.size()) add_relu(g.popR());return *this;}void rclear() {while (R.size()) popR();}};int main() {int N;cin >> N;vector<int> A(N);cin >> A;sort(ALL(A));dbg(A);IREP(i, N) A.at(i) -= i;slope_trick<lint> st;for (int a : A) {st.rclear();st.add_abs(a);}cout << st.get_min().min << endl;}