Submission #34180710

---

Source Code Expand

import sys
import collections
import math
import itertools
sys.setrecursionlimit(150000)

INF = 10**15
deb = 10

##Range Update Query with lazyBIT###
##usage : rbit = RAQandRSQ(n)

#####segfunc#####
def segfunc(x, y):
    return x+y

#####ide_ele#####
ide_ele = 0

class LazySegmentTree:
    """
    init(init_val, ide_ele): 配列init_valで初期化 O(N)
    add(l, r, x): 区間[l, r)にxを加算 O(logN)
    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
    """
    def __init__(self, init_val, segfunc, ide_ele):
        """
        init_val: 配列の初期値
        segfunc: 区間にしたい操作
        ide_ele: 単位元
        num: n以上の最小の2のべき乗
        data: 値配列(1-index)
        lazy: 遅延配列(1-index)
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.data = [ide_ele] * 2 * self.num
        self.lazy = [0] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.data[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])

    def gindex(self, l, r):
            """
            伝搬する対象の区間を求める
            lm: 伝搬する必要のある最大の左閉区間
            rm: 伝搬する必要のある最大の右開区間
            """
            l += self.num
            r += self.num
            lm = l >> (l & -l).bit_length()
            rm = r >> (r & -r).bit_length()

            while r > l:
                if l <= lm:
                    yield l
                if r <= rm:
                    yield r
                r >>= 1
                l >>= 1
            while l:
                yield l
                l >>= 1

    def propagates(self, *ids):
        """
        遅延伝搬処理
        ids: 伝搬する対象の区間 
        """
        for i in reversed(ids):
            v = self.lazy[i]
            if not v:
                continue
            self.lazy[2 * i] = v
            self.lazy[2 * i + 1] = v
            self.data[2 * i] = v
            self.data[2 * i + 1] = v
            self.lazy[i] = 0

    def update(self, l, r, x):
        """
        区間[l, r)の値にxを加算
        l, r: index(0-index)
        x: additional value
        """
        *ids, = self.gindex(l, r)
        self.propagates(*ids)
       
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                self.lazy[l] = x
                self.data[l] = x
                l += 1
            if r & 1:
                self.lazy[r - 1] = x
                self.data[r - 1] = x
            r >>= 1
            l >>= 1
        for i in ids:
            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1]) ####+ self.lazy[i]


    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る
        l: index(0-index)
        r: index(0-index)
        """
        *ids, = self.gindex(l, r)
        self.propagates(*ids)

        res = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.data[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.data[r - 1])
            l >>= 1
            r >>= 1
        return res

N,M,K = map(int,input().split())
_cards = list(map(int, input().split()))
cards = list(reversed(sorted(_cards)))

seg = LazySegmentTree(cards[0:K],segfunc,ide_ele)

if K==1 : 
    print (cards[0]+M)
    exit(0)
    
base = K - 2

while M>0 :
    want = cards[base] * (K-1 - base) - seg.query(base+1,K)
    if want < M :
        M -= want 
        seg.update(base+1,K, cards[base])
        cards[K-1] = cards[base]
    else  : 
        df = M // (K-1 - base)
        mx = 0 ; mxdf = 0
        for j in range(1,df+1) : 
            if cards[base] & cards[K-1] +j > mx :
                mx = cards[K-1] +j 
                mxdf = j 
        cards[K-1] += mxdf 
        M = 0 
    if base == 0 : 
        break 
    base -= 1
    

print( cards[K-1] + M//K )
    
# print(cards[0:K],base,M)

# print(seg.data)
# print(seg.lazy)

Submission Info

Judge Result