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

提出ソース

結果

問題	No.738 平らな農地
ユーザー	たこし
提出日時	2018-09-28 23:40:06
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	1,636 ms / 2,000 ms
コード長	4,939 bytes
コンパイル時間	2,253 ms
コンパイル使用メモリ	215,888 KB
実行使用メモリ	254,464 KB
最終ジャッジ日時	2024-04-20 12:08:22
合計ジャッジ時間	58,681 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	1 ms 5,376 KB
testcase_04	AC	1 ms 5,376 KB
testcase_05	AC	31 ms 7,808 KB
testcase_06	AC	35 ms 8,704 KB
testcase_07	AC	29 ms 8,704 KB
testcase_08	AC	15 ms 5,888 KB
testcase_09	AC	8 ms 5,376 KB
testcase_10	AC	4 ms 5,376 KB
testcase_11	AC	14 ms 6,016 KB
testcase_12	AC	8 ms 5,376 KB
testcase_13	AC	28 ms 7,552 KB
testcase_14	AC	12 ms 5,376 KB
testcase_15	AC	926 ms 100,224 KB
testcase_16	AC	952 ms 101,888 KB
testcase_17	AC	1,135 ms 100,864 KB
testcase_18	AC	1,089 ms 99,328 KB
testcase_19	AC	1,318 ms 106,368 KB
testcase_20	AC	967 ms 102,528 KB
testcase_21	AC	1,239 ms 106,880 KB
testcase_22	AC	986 ms 102,528 KB
testcase_23	AC	1,224 ms 103,808 KB
testcase_24	AC	1,253 ms 102,272 KB
testcase_25	AC	10 ms 5,632 KB
testcase_26	AC	10 ms 5,632 KB
testcase_27	AC	10 ms 5,504 KB
testcase_28	AC	9 ms 5,504 KB
testcase_29	AC	9 ms 5,632 KB
testcase_30	AC	10 ms 5,632 KB
testcase_31	AC	9 ms 5,760 KB
testcase_32	AC	9 ms 5,760 KB
testcase_33	AC	10 ms 5,632 KB
testcase_34	AC	9 ms 5,632 KB
testcase_35	AC	9 ms 5,632 KB
testcase_36	AC	10 ms 5,632 KB
testcase_37	AC	9 ms 5,632 KB
testcase_38	AC	10 ms 5,632 KB
testcase_39	AC	11 ms 5,632 KB
testcase_40	AC	11 ms 5,504 KB
testcase_41	AC	10 ms 5,760 KB
testcase_42	AC	9 ms 5,632 KB
testcase_43	AC	9 ms 5,632 KB
testcase_44	AC	9 ms 5,632 KB
testcase_45	AC	926 ms 118,400 KB
testcase_46	AC	934 ms 109,824 KB
testcase_47	AC	925 ms 115,328 KB
testcase_48	AC	803 ms 112,128 KB
testcase_49	AC	805 ms 111,488 KB
testcase_50	AC	806 ms 115,200 KB
testcase_51	AC	984 ms 116,224 KB
testcase_52	AC	893 ms 111,616 KB
testcase_53	AC	907 ms 113,792 KB
testcase_54	AC	956 ms 116,608 KB
testcase_55	AC	1,000 ms 116,736 KB
testcase_56	AC	963 ms 114,944 KB
testcase_57	AC	902 ms 109,056 KB
testcase_58	AC	911 ms 114,304 KB
testcase_59	AC	878 ms 118,656 KB
testcase_60	AC	863 ms 118,144 KB
testcase_61	AC	899 ms 117,120 KB
testcase_62	AC	856 ms 109,568 KB
testcase_63	AC	1,020 ms 119,040 KB
testcase_64	AC	942 ms 117,120 KB
testcase_65	AC	1,312 ms 101,760 KB
testcase_66	AC	1,399 ms 105,216 KB
testcase_67	AC	993 ms 232,960 KB
testcase_68	AC	980 ms 239,488 KB
testcase_69	AC	1,289 ms 243,200 KB
testcase_70	AC	1,136 ms 251,136 KB
testcase_71	AC	621 ms 5,376 KB
testcase_72	AC	494 ms 5,376 KB
testcase_73	AC	423 ms 5,376 KB
testcase_74	AC	577 ms 5,376 KB
testcase_75	AC	1,235 ms 234,368 KB
testcase_76	AC	1,069 ms 242,688 KB
testcase_77	AC	1,317 ms 234,112 KB
testcase_78	AC	1,425 ms 252,416 KB
testcase_79	AC	1,312 ms 254,464 KB
testcase_80	AC	1,096 ms 244,864 KB
testcase_81	AC	1,202 ms 237,312 KB
testcase_82	AC	1,306 ms 246,656 KB
testcase_83	AC	557 ms 5,376 KB
testcase_84	AC	500 ms 5,376 KB
testcase_85	AC	1,636 ms 171,136 KB
testcase_86	AC	1,456 ms 159,232 KB
testcase_87	AC	603 ms 165,632 KB
testcase_88	AC	555 ms 159,488 KB
testcase_89	AC	2 ms 5,376 KB
testcase_90	AC	2 ms 5,376 KB
testcase_91	AC	1 ms 5,376 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#include <cstdio>
#include <string>

using namespace std;

#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long double

class Node {
public:
    Node(unsigned long long int lIndex = startLeftIndex, unsigned long long int rIndex = endRightIndex, LL v = unitValue) : leftIndex(lIndex), rightIndex(rIndex), value(v) {

    }

    Node operator + (const Node& monoid) const {
        return Node(startLeftIndex, endRightIndex, this->getValue() + monoid.getValue());
    }

    static Node unit() {
        return Node(unitValue);
    }

    void setValue(LL l) {
        this->value = l;
    }

    LL getValue() const {
        return this->value;
    }

    
    
    
    

    pair<LL, LL> getIndexRange() {
        return make_pair(leftIndex, rightIndex);
    }

    bool isLeafNode() {
        auto it = getIndexRange();
        return it.second - it.first <= 1;
    }

    //値の設定
    void setValue(unsigned long long int index, LL value) {
        auto indexRange = getIndexRange();
        unsigned long long int leftIndex = indexRange.first, midIndex = (indexRange.first + indexRange.second)/2, rightIndex = indexRange.second;
        if(isLeafNode()) {
            if(leftIndex <= index && index < rightIndex) {
                setValue(value);
            } 
            return;
        }

        if(!left_child) {
            left_child = unique_ptr<Node>(new Node(leftIndex, midIndex));
        }
        if(!right_child) {
            right_child = unique_ptr<Node>(new Node(midIndex, rightIndex));
        }

        if(leftIndex <= index && index < midIndex) {
            left_child->setValue(index, value);
        } else {
            right_child->setValue(index, value);
        }

        //戻るときに値を更新していく
        Node lNode, rNode; lNode.setValue(left_child->getValue()); rNode.setValue(right_child->getValue());
        setValue((lNode + rNode).getValue());
    }

    LL query(unsigned long long int l, unsigned long long int r) {
        auto indexRange = getIndexRange();
        if(l <= indexRange.first && indexRange.second <= r) {
            return getValue();
        } else if(indexRange.second <= l || r <= indexRange.first) {
            return Node::unit().getValue();
        } else {
            LL ll = Node::unit().getValue(), rr = Node::unit().getValue();
            if(left_child) {
                ll = left_child->query(l, r);
            }
            if(right_child) {
                rr = right_child->query(l, r);
            }
            Node lNode, rNode;
            lNode.setValue(ll); rNode.setValue(rr);
            return (lNode + rNode).getValue();
        }
    }

private:
    LL value;
    static const LL unitValue = 0;
    static const LL startLeftIndex = 0, endRightIndex = 1145141919;

    unique_ptr<Node> left_child, right_child;
    unsigned long long int leftIndex, rightIndex;
};

template <class T>
class SegmentTree {
public:
    SegmentTree() {
        root = unique_ptr<Node>(new Node());
    }

    void setValue(unsigned long long int index, LL value) {
        root->setValue(index, value);
    }

    LL query(unsigned long long int l, unsigned long long int r) {
        return root->query(l, r);
    }
private:
    unique_ptr<T> root;
};

#define int long long

SegmentTree<Node> segmentTree;
SegmentTree<Node> segmentTreeCount;

const int MAX_N = 100005;
int N, K;
int A[MAX_N];

signed main()
{
    cin >> N >> K;
    for(int i = 0; i < N; i++) {
        cin >> A[i];
    }

    int sum = 0;
    int ans = 1145141919810364;
    for(int i = 0; i < N; i++) {
        sum += A[i];
        segmentTree.setValue(A[i], segmentTree.query(A[i], A[i]+1) + A[i]);
        segmentTreeCount.setValue(A[i], segmentTreeCount.query(A[i], A[i]+1)+1);

        if(i >= K-1) {
            int midL = 0, midR = 1e9+7;
            while(midR-midL > 1) {
                int mid = (midR + midL)/2;
                if(segmentTreeCount.query(0, mid+1) <= (K-1)/2) {
                    midL = mid;
                } else {
                    midR = mid;
                }
            }
            int mid = midR;
            // cerr << i << " " << mid << endl;

            int L = 0, R = 0;
            int lCount = segmentTreeCount.query(0, mid);
            int rCount = segmentTreeCount.query(mid+1, 1e9+7);
            L = mid*lCount - segmentTree.query(0, mid);
            R = segmentTree.query(mid+1, 1e9+7) - mid*rCount;

            ans = min(ans, L+R);

            sum -= A[i-K+1];

            int AA = A[i-K+1];
            segmentTree.setValue(AA, segmentTree.query(AA,AA+1) - AA);
            segmentTreeCount.setValue(AA, segmentTreeCount.query(AA, AA+1)-1);
        }
    }

    cout << ans << endl;

    return 0;
}

yukicoder

結果

テストケース

ソースコード