#288067 (C++17) No.738 平らな農地

提出ソース

結果

問題	No.738 平らな農地
ユーザー	mai
提出日時	2018-09-28 22:45:45
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,264 bytes
コンパイル時間	3,209 ms
コンパイル使用メモリ	210,300 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-04-20 11:47:51
合計ジャッジ時間	6,666 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	3 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	16 ms 6,944 KB
testcase_16	AC	16 ms 6,944 KB
testcase_17	AC	18 ms 6,944 KB
testcase_18	AC	18 ms 6,944 KB
testcase_19	AC	20 ms 6,944 KB
testcase_20	AC	17 ms 6,940 KB
testcase_21	AC	19 ms 6,944 KB
testcase_22	AC	16 ms 6,944 KB
testcase_23	AC	19 ms 6,944 KB
testcase_24	AC	19 ms 6,940 KB
testcase_25	AC	3 ms 6,940 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,944 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,940 KB
testcase_33	AC	2 ms 6,944 KB
testcase_34	AC	2 ms 6,944 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	3 ms 6,944 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	2 ms 6,940 KB
testcase_39	AC	2 ms 6,944 KB
testcase_40	AC	2 ms 6,940 KB
testcase_41	AC	2 ms 6,944 KB
testcase_42	AC	2 ms 6,944 KB
testcase_43	AC	2 ms 6,944 KB
testcase_44	AC	1 ms 6,940 KB
testcase_45	AC	15 ms 6,940 KB
testcase_46	AC	17 ms 6,940 KB
testcase_47	AC	16 ms 6,944 KB
testcase_48	AC	14 ms 6,944 KB
testcase_49	AC	14 ms 6,944 KB
testcase_50	AC	14 ms 6,940 KB
testcase_51	AC	16 ms 6,944 KB
testcase_52	AC	15 ms 6,940 KB
testcase_53	AC	16 ms 6,944 KB
testcase_54	AC	16 ms 6,944 KB
testcase_55	AC	16 ms 6,944 KB
testcase_56	AC	17 ms 6,944 KB
testcase_57	AC	15 ms 6,940 KB
testcase_58	AC	15 ms 6,944 KB
testcase_59	AC	15 ms 6,940 KB
testcase_60	AC	15 ms 6,944 KB
testcase_61	AC	16 ms 6,940 KB
testcase_62	AC	15 ms 6,940 KB
testcase_63	AC	16 ms 6,940 KB
testcase_64	AC	14 ms 6,944 KB
testcase_65	AC	19 ms 6,940 KB
testcase_66	AC	20 ms 6,940 KB
testcase_67	AC	15 ms 6,944 KB
testcase_68	AC	15 ms 6,944 KB
testcase_69	WA	-
testcase_70	AC	17 ms 6,940 KB
testcase_71	AC	17 ms 6,944 KB
testcase_72	AC	17 ms 6,940 KB
testcase_73	AC	15 ms 6,944 KB
testcase_74	AC	19 ms 6,940 KB
testcase_75	WA	-
testcase_76	AC	16 ms 6,940 KB
testcase_77	WA	-
testcase_78	WA	-
testcase_79	AC	19 ms 6,940 KB
testcase_80	AC	17 ms 6,940 KB
testcase_81	AC	17 ms 6,940 KB
testcase_82	AC	20 ms 6,940 KB
testcase_83	AC	18 ms 6,940 KB
testcase_84	AC	17 ms 6,944 KB
testcase_85	WA	-
testcase_86	WA	-
testcase_87	AC	11 ms 6,940 KB
testcase_88	AC	11 ms 6,940 KB
testcase_89	AC	2 ms 6,940 KB
testcase_90	AC	2 ms 6,944 KB
testcase_91	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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;


typedef ll tsearch_t;
typedef ll fval_t;
tsearch_t tri_search_minimize(tsearch_t left, tsearch_t right, function<fval_t(tsearch_t)> func) {

    for (int lop = 0; lop < 60; ++lop) {
        tsearch_t l = right - (2 * right - 2 * left) / 3;
        tsearch_t r = right - (right - left) / 3;
        fval_t lval = func(l);
        fval_t rval = func(r);

        if (lval <= rval)
            right = r;
        else
            left = l;

        if (right - left <= 2) break;
    }
    fval_t best = func(left);
    tsearch_t bestidx = left;
    for (tsearch_t t = left + 1; t <= right; ++t) {
        tsearch_t f = func(t);
        if (best > f) {
            best = f; bestidx = t;
        }
    }
    return bestidx;
}


ll N, K;
ll A[100010];


ll solve(ll H) {
    
    ll cost = 0;
    repeat(i, K) {
        cost += abs(A[i] - H);
    }
    ll best = cost;
    iterate(i, K, N) {
        cost -= abs(A[i - K] - H);
        cost += abs(A[i] - H);
        minset(best, cost);
    }
    return best;
}

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

    ll h = tri_search_minimize(1, ll(1e9), solve);

    cout << solve(h) << endl;
    

    return 0;
}

yukicoder

結果

テストケース

ソースコード