結果
| 問題 |
No.2304 Distinct Elements
|
| コンテスト | |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2023-05-22 04:10:25 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 59 ms / 3,000 ms |
| コード長 | 7,665 bytes |
| コンパイル時間 | 4,032 ms |
| コンパイル使用メモリ | 261,648 KB |
| 最終ジャッジ日時 | 2025-02-13 04:07:46 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 58 |
ソースコード
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;
template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 1000000007;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
struct SlopeTrick{
private:
struct P{
// x: 座標, c: 傾きの変化
long long x, c;
P(long long _x, long long _c) : x(_x), c(_c) {}
friend inline bool operator<(const P &a, const P &b){ return a.x < b.x; }
friend inline bool operator>(const P &a, const P &b){ return a.x > b.x; }
};
long long addL, addR, min_y;
priority_queue<P> L;
priority_queue<P, vector<P>, greater<P>> R;
void pushL(long long x, long long c = 1){
L.emplace(x - addL, c);
}
void pushR(long long x, long long c = 1){
R.emplace(x - addR, c);
}
P getL(){
return P{L.top().x + addL, L.top().c};
}
P getR(){
return P{R.top().x + addR, R.top().c};
}
void popL(){ L.pop(); }
void popR(){ R.pop(); }
public:
SlopeTrick() : addL(0), addR(0), min_y(0) {}
// return: x, f(x)
pair<long long, long long> get_min(){
long long x;
if(L.empty()){
if(R.empty()){
x = 0;
}else{
x = getR().x;
}
}else{
x = getL().x;
}
return make_pair(x, min_y);
}
void shift_L(long long a){
addL += a;
}
void shift_R(long long a){
addR += a;
}
// f(x) <- f(x - a)
void shift_x(long long a){
addL += a, addR += a;
}
// f(x) <- f(x) + a
void shift_y(long long a){
min_y += a;
}
// add (x - a)_+ ____/
void add_xma(long long a, long long c = 1){
long long used = 0;
while(used < c && !(L.empty())){
auto [X, C] = getL();
if(X <= a) break;
popL();
long long tmp = min(c - used, C);
pushR(X, tmp);
if(C != tmp) pushL(X, C - tmp);
min_y += (X - a) * tmp;
used += tmp;
}
if(used) pushL(a, used);
if(c - used) pushR(a, c - used);
}
// add (a - x)_+ \____
void add_amx(long long a, long long c = 1){
long long used = 0;
while(used < c && !(R.empty())){
auto [X, C] = getR();
if(X >= a) break;
popR();
long long tmp = min(c - used, C);
pushL(X, tmp);
if(C != tmp) pushR(X, C - tmp);
min_y += (a - X) * tmp;
used += tmp;
}
if(used) pushR(a, used);
if(c - used) pushL(a, c - used);
}
// add |x - a| \____/
void add_abs_xma(long long a, long long c = 1){
add_xma(a, c);
add_amx(a, c);
}
// chmin left side \_/ -> __/
void chmin_left(){
decltype(L){}.swap(L);
}
// chmin right side \_/ -> \__
void chmin_right(){
decltype(R){}.swap(R);
}
// return: f(x) = min_y + sum (a - x)_+ + sum (x - a)_+
long long f(long long x){
long long y = min_y;
auto LL{L};
while(!(LL.empty())){
auto [X, C] = LL.top();
X += addL;
if(X < x) break;
y += (X - x) * C;
LL.pop();
}
auto RR{R};
while(!(RR.empty())){
auto [X, C] = RR.top();
X += addR;
if(X > x) break;
y += (x - X) * C;
RR.pop();
}
return y;
}
};
ll n;
vll a;
void input(){
in(n);
vin(a, n);
}
void solve(){
Sort(a);
SlopeTrick st;
rep(i, n){
st.chmin_right();
st.add_abs_xma(a[i] - i);
}
out(st.get_min().second);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
input();
solve();
}