結果
問題 | No.2304 Distinct Elements |
ユーザー |
![]() |
提出日時 | 2023-05-14 16:39:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 63 ms / 3,000 ms |
コード長 | 6,626 bytes |
コンパイル時間 | 3,972 ms |
コンパイル使用メモリ | 263,500 KB |
最終ジャッジ日時 | 2025-02-13 00:32:05 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 58 |
ソースコード
#line 1 "c.cpp"#include<bits/stdc++.h>#include<atcoder/all>#define rep(i,n) for (int i = 0; i < int(n); ++i)#define repp(i,m,n) for (int i = m; i < int(n); ++i)#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)#define all(v) v.begin(),v.end()using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using ld = long double;using P = pair<int, int>;using PL = pair<long long, long long>;using pdd = pair<long double, long double>;using pil = pair<int,ll>;using pli = pair<ll,int>;template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}template<typename T1, typename T2>void print(pair<T1,T2> a);template<typename T>void print(vector<T> v);template<typename T>void print(vector<vector<T>> v);void print(){ putchar(' '); }void print(bool a){ printf("%d", a); }void print(int a){ printf("%d", a); }void print(long a){ printf("%ld", a); }void print(long long a){ printf("%lld", a); }void print(char a){ printf("%c", a); }void print(char a[]){ printf("%s", a); }void print(const char a[]){ printf("%s", a); }void print(long double a){ printf("%.15Lf", a); }void print(const string& a){ for(auto&& i : a) print(i); }void print(unsigned int a){ printf("%u", a); }void print(unsigned long long a) { printf("%llu", a); }template<class T> void print(const T& a){ cout << a; }int out(){ putchar('\n'); return 0; }template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}void yes(){out("Yes");}void no (){out("No");}void yn (bool t){if(t)yes();else no();}void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}void o(){out("!?");}namespace noya2{const int INF = 1001001007;const long long mod1 = 998244353;const long long mod2 = 1000000007;const long long inf = 2e18;const long double pi = 3.14159265358979323;const long double eps = 1e-7;const vector<int> dx = {0,1,0,-1,1,1,-1,-1};const vector<int> dy = {1,0,-1,0,1,-1,-1,1};const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string alp = "abcdefghijklmnopqrstuvwxyz";const string NUM = "0123456789";} // namespace noya2using namespace noya2;using mint = modint998244353;//using mint = modint1000000007;//using mint = modint;void out(mint a){out(a.val());}void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}void out(vector<vector<mint>> a){for (auto v : a) out(v);}#line 2 "SlopeTrick.hpp"#line 4 "SlopeTrick.hpp"namespace noya2{using namespace std;template< typename T >struct SlopeTrick {const T INF = numeric_limits< T >::max() / 3;T min_f;priority_queue< T, vector< T >, less<> > L;priority_queue< T, vector< T >, greater<> > R;T add_l, add_r;void push_R(const T& a) {R.push(a - add_r);}T top_R() const {if (R.empty()) return INF;else return R.top() + add_r;}T pop_R() {T val = top_R();if (not R.empty()) R.pop();return val;}void push_L(const T& a) {L.push(a - add_l);}T top_L() const {if (L.empty()) return -INF;else return L.top() + add_l;}T pop_L() {T val = top_L();if (not L.empty()) L.pop();return val;}size_t size() {return L.size() + R.size();}SlopeTrick() : min_f(0), add_l(0), add_r(0) {}// f(x) += avoid add_all(const T& a) {min_f += a;}// add \_// f(x) += max(a - x, 0)void add_a_minus_x(const T& a) {min_f += max(T(0), a - top_R());push_R(a);push_L(pop_R());}// add _/// f(x) += max(x - a, 0)void add_x_minus_a(const T& a) {min_f += max(T(0), top_L() - a);push_L(a);push_R(pop_L());}// add \/// f(x) += abs(x - a)void add_abs(const T& a) {add_a_minus_x(a);add_x_minus_a(a);}// \/ -> \_// f_{new} (x) = min f(y) (y <= x)void clear_right() {while (not R.empty()) R.pop();}// \/ -> _/// f_{new} (x) = min f(y) (y >= x)void clear_left() {while (not L.empty()) L.pop();}// \/ -> \_/// f_{new} (x) = min f(y) (x-b <= y <= x-a)void shift(const T& a, const T& b) {assert(a <= b);add_l += a;add_r += b;}// \/. -> .\/// f_{new} (x) = f(x - a)void shift(const T& a) {shift(a, a);}// L, R を破壊するT get(const T& x) {T ret = min_f;while (not L.empty()) {ret += max(T(0), pop_L() - x);}while (not R.empty()) {ret += max(T(0), x - pop_R());}return ret;}void merge(SlopeTrick& st) {if (st.size() > size()) {swap(st.L, L);swap(st.R, R);swap(st.add_l, add_l);swap(st.add_r, add_r);swap(st.min_f, min_f);}while (not st.R.empty()) {add_x_minus_a(st.pop_R());}while (not st.L.empty()) {add_a_minus_x(st.pop_L());}min_f += st.min_f;}};} // namespace noya2#line 77 "c.cpp"void solve(){int n; cin >> n;vector<ll> a(n); cin >> a;sort(all(a));SlopeTrick<ll> slt;rep(i,n){slt.shift(1);slt.clear_right();slt.add_abs(a[i]);}out(slt.min_f);}int main(){fast_io();int t = 1; //cin >> t;while(t--) solve();}