結果
問題 | No.1391 ±1 Abs Sum |
ユーザー |
![]() |
提出日時 | 2021-08-06 09:09:55 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 66 ms / 2,000 ms |
コード長 | 3,734 bytes |
コンパイル時間 | 2,333 ms |
コンパイル使用メモリ | 201,736 KB |
最終ジャッジ日時 | 2025-01-23 14:18:23 |
ジャッジサーバーID (参考情報) |
judge3 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#define MOD_TYPE 1#pragma region Macros#include <bits/stdc++.h>using namespace std;#if 1#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endif#if 0#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>#include <ext/pb_ds/tag_and_trait.hpp>#include <ext/rope>using namespace __gnu_pbds;using namespace __gnu_cxx;template <typename T>using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;#endif#if 0#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using Int = boost::multiprecision::cpp_int;using lld = boost::multiprecision::cpp_dec_float_100;#endifusing ll = long long int;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pld = pair<ld, ld>;template <typename T>using smaller_queue = priority_queue<T, vector<T>, greater<T>>;constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);constexpr int INF = (int)1e9 + 10;constexpr ll LINF = (ll)4e18;constexpr ld PI = acos(-1.0);constexpr ld EPS = 1e-7;constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)#define repi(i, n) REPI(i, 0, n)#define MP make_pair#define MT make_tuple#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << "\n";struct io_init{io_init(){cin.tie(0);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);};} io_init;template <typename T>inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}template <typename T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}inline ll CEIL(ll a, ll b){return (a + b - 1) / b;}template <typename A, size_t N, typename T>inline void Fill(A (&array)[N], const T &val){fill((T *)array, (T *)(array + N), val);}template <typename T, typename U>constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept{is >> p.first >> p.second;return is;}template <typename T, typename U>constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept{os << p.first << " " << p.second;return os;}#pragma endregionrandom_device seed_gen;mt19937_64 engine(seed_gen());// --------------------------------------void solve(){int n, k;cin >> n >> k;vector<ll> a(n);rep(i, n) cin >> a[i];vector<ll> csum(n + 1);csum[0] = 0;rep(i, n) csum[i + 1] = csum[i] + a[i];// [l,r) の |A_i - A_j| の和auto f = [&](int i, int l, int r){ll res = 0;int t = lower_bound(all(a), a[i]) - a.begin();if (t < l){res += csum[r] - csum[l];res -= a[i] * (r - l);}else if (t >= r){res -= csum[r] - csum[l];res += a[i] * (r - l);}else{res += a[i] * (t - l);res -= csum[t] - csum[l];res += csum[r] - csum[t];res -= a[i] * (r - t);}return res;};int L = 0;ll ans = LINF;rep(i, n){while (L + k < n and abs(a[L + k] - a[i]) < abs(a[L] - a[i]))L++;ll t = f(i, L, L + k) - f(i, 0, L) - f(i, L + k, n);chmin(ans, t);}cout << ans << "\n";}int main(){solve();}