結果

問題 No.738 平らな農地
ユーザー maimai
提出日時 2018-09-29 00:43:07
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 6,973 bytes
コンパイル時間 2,914 ms
コンパイル使用メモリ 228,456 KB
実行使用メモリ 12,160 KB
最終ジャッジ日時 2024-10-12 07:49:16
合計ジャッジ時間 10,686 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,816 KB
testcase_05 AC 4 ms
6,816 KB
testcase_06 AC 4 ms
6,820 KB
testcase_07 AC 4 ms
6,816 KB
testcase_08 AC 3 ms
6,816 KB
testcase_09 AC 2 ms
6,816 KB
testcase_10 AC 2 ms
6,820 KB
testcase_11 AC 3 ms
6,820 KB
testcase_12 AC 2 ms
6,816 KB
testcase_13 AC 3 ms
6,820 KB
testcase_14 AC 3 ms
6,816 KB
testcase_15 AC 95 ms
9,216 KB
testcase_16 AC 101 ms
9,344 KB
testcase_17 AC 114 ms
9,344 KB
testcase_18 AC 112 ms
9,216 KB
testcase_19 AC 134 ms
9,728 KB
testcase_20 AC 99 ms
9,344 KB
testcase_21 AC 128 ms
9,728 KB
testcase_22 AC 99 ms
9,344 KB
testcase_23 AC 117 ms
9,600 KB
testcase_24 AC 118 ms
9,472 KB
testcase_25 AC 3 ms
6,816 KB
testcase_26 AC 2 ms
6,820 KB
testcase_27 AC 3 ms
6,820 KB
testcase_28 AC 2 ms
6,816 KB
testcase_29 AC 2 ms
6,820 KB
testcase_30 AC 2 ms
6,820 KB
testcase_31 AC 3 ms
6,820 KB
testcase_32 AC 2 ms
6,820 KB
testcase_33 AC 2 ms
6,820 KB
testcase_34 AC 2 ms
6,816 KB
testcase_35 AC 2 ms
6,820 KB
testcase_36 AC 3 ms
6,820 KB
testcase_37 AC 2 ms
6,820 KB
testcase_38 AC 2 ms
6,816 KB
testcase_39 AC 2 ms
6,816 KB
testcase_40 AC 2 ms
6,816 KB
testcase_41 AC 3 ms
6,816 KB
testcase_42 AC 2 ms
6,820 KB
testcase_43 AC 3 ms
6,820 KB
testcase_44 AC 2 ms
6,816 KB
testcase_45 AC 109 ms
10,368 KB
testcase_46 AC 106 ms
9,856 KB
testcase_47 AC 100 ms
10,112 KB
testcase_48 AC 94 ms
9,984 KB
testcase_49 AC 95 ms
9,728 KB
testcase_50 AC 97 ms
9,984 KB
testcase_51 AC 110 ms
10,112 KB
testcase_52 AC 106 ms
9,728 KB
testcase_53 AC 109 ms
9,984 KB
testcase_54 AC 121 ms
10,112 KB
testcase_55 AC 116 ms
10,112 KB
testcase_56 AC 115 ms
9,984 KB
testcase_57 AC 98 ms
9,728 KB
testcase_58 AC 106 ms
9,984 KB
testcase_59 AC 108 ms
10,240 KB
testcase_60 AC 101 ms
10,240 KB
testcase_61 AC 103 ms
10,112 KB
testcase_62 AC 102 ms
9,728 KB
testcase_63 AC 114 ms
10,240 KB
testcase_64 AC 109 ms
10,112 KB
testcase_65 AC 132 ms
9,344 KB
testcase_66 AC 134 ms
9,600 KB
testcase_67 AC 87 ms
11,520 KB
testcase_68 AC 88 ms
11,648 KB
testcase_69 AC 107 ms
11,776 KB
testcase_70 AC 97 ms
12,160 KB
testcase_71 AC 32 ms
6,820 KB
testcase_72 AC 29 ms
6,816 KB
testcase_73 AC 25 ms
6,816 KB
testcase_74 AC 31 ms
6,816 KB
testcase_75 AC 98 ms
11,520 KB
testcase_76 AC 91 ms
11,648 KB
testcase_77 AC 103 ms
11,392 KB
testcase_78 AC 113 ms
12,032 KB
testcase_79 AC 125 ms
12,160 KB
testcase_80 AC 103 ms
11,776 KB
testcase_81 AC 104 ms
11,520 KB
testcase_82 AC 113 ms
11,776 KB
testcase_83 AC 28 ms
6,816 KB
testcase_84 AC 32 ms
6,820 KB
testcase_85 AC 180 ms
11,904 KB
testcase_86 AC 167 ms
11,392 KB
testcase_87 AC 84 ms
11,776 KB
testcase_88 AC 81 ms
11,264 KB
testcase_89 AC 2 ms
6,816 KB
testcase_90 AC 2 ms
6,820 KB
testcase_91 AC 2 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_reference<remove_const<decltype(l)>::type>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os;
}
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) noexcept {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() noexcept { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) noexcept {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) noexcept { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


template<typename T = ll>
class Bitree {
public:
    int size_;
    vector<T> data_;
    Bitree(int size_) :size_(size_), data_(size_ + 1) {}

    // 1..rの範囲の値の和を求める．
    T sum(int r) {
        T s = 0;
        while (r) {
            s += data_[r];
            r -= r & -r; //  r&-r と書くことで最下のビットを得る
        }
        return s;
    }
    // l..rの範囲の値の和を求める
    inline T sum(int l, int r) { return sum(r) - sum(l - 1); }
    // idxの要素の値をval増やす
    void add(int idx, T val) {
        while (idx <= size_) {
            data_[idx] += val;
            idx += idx & -idx;
        }
    }
};


typedef ll bsearch_t;
bsearch_t bin_search(bsearch_t false_val, bsearch_t true_val, function<bool(bsearch_t)> func) {
    while (abs(true_val - false_val) > 1) {
        bsearch_t c = (true_val + false_val) / 2;
        (func(c) ? true_val : false_val) = c;
    }
    return true_val;
}


ll N, K;
ll A[100010];





int main() {
    scanner >> N >> K;
    scanner.in(A, A + N);

    vector<ll> unzip(N + 1);
    map<ll, int> zip;
    {
        repeat(i, N) zip[A[i]] = 0;
        int j = 0;
        for (auto& p : zip) p.second = ++j, unzip[j] = p.first;
    }

    Bitree<int> bitb(N + 1);
    Bitree<ll> bits(N + 1);

    repeat(i, K - 1) {
        bitb.add(zip[A[i]], 1);
        bits.add(zip[A[i]], A[i]);
    }

    ll best = 1e18;
    iterate(i, K - 1, N) {
        bitb.add(zip[A[i]], 1);
        bits.add(zip[A[i]], A[i]);

        int t = bin_search(0, N + 1, [&](int i) {return bitb.sum(i) >= (K + 1) / 2; });
        ll h = unzip[t];

        minset(best, h*(ll)bitb.sum(1, t) - bits.sum(1, t) + bits.sum(t, N) - h * (ll)bitb.sum(t, N));
        bitb.add(zip[A[i - (K - 1)]], -1);
        bits.add(zip[A[i - (K - 1)]], -A[i - (K - 1)]);
    }


    cout << best << endl;


    return 0;
}
0