CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:Microwave Abuser
Submission time:2020-10-11 14:49:00 +0300
Language:Python3 (PyPy3)
Status:READY
Result:11
Feedback
groupverdictscore
#1ACCEPTED11
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1, 2, 3details
#2ACCEPTED0.05 s1, 2, 3details
#3ACCEPTED0.05 s1, 2, 3details
#4ACCEPTED0.05 s1, 2, 3details
#5ACCEPTED0.05 s1, 2, 3details
#6ACCEPTED0.06 s2, 3details
#70.07 s2, 3details
#8ACCEPTED0.07 s2, 3details
#9ACCEPTED0.08 s2, 3details
#10ACCEPTED0.07 s2, 3details
#11ACCEPTED0.08 s3details
#120.20 s3details
#130.21 s3details
#14ACCEPTED0.14 s3details
#15ACCEPTED0.14 s3details
#16ACCEPTED0.12 s3details
#17ACCEPTED0.12 s3details

Code

def bisect_desc(a, x, lo=0, hi=None):
    if lo < 0:
        raise ValueError('lo must be non-negative')
    if hi is None:
        hi = len(a)
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] > x: lo = mid+1
        else: hi = mid
    return lo

def bisect_asc(a, x, lo=0, hi=None):
    if lo < 0:
        raise ValueError('lo must be non-negative')
    if hi is None:
        hi = len(a)
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] < x: lo = mid+1
        else: hi = mid
    return lo

class Ylitaulukko:
    def __init__(self, start, end):
        self.start = start
        self.end = end

def muodostaYlitaulukot(gayArray, n, k):
    tPointer = 0
    ePointer = 1
    lastEPointer = -1

    curMaxI = 0
    curMinI = 0
    maxPosses = [0]
    minPosses = [0]
    maxVals = [gayArray[0]]
    minVals = [gayArray[0]]
    lastMaxI = 0
    lastMinI = 0

    ylitaulukot = []

    while ePointer < n:
        while (ePointer < n) and (gayArray[ePointer] <= minVals[curMinI] + k) and (gayArray[ePointer] >= maxVals[curMaxI] - k):
            # max min val huolto
            ii = bisect_asc(minVals, gayArray[ePointer])
            lastMinI = ii
            curMinI = min(curMinI, ii)
            if ii == len(minVals):
                minVals.append(gayArray[ePointer])
                minPosses.append(ePointer)
            else:
                minVals[ii] = gayArray[ePointer]
                minPosses[ii] = ePointer

            ii = bisect_desc(maxVals, gayArray[ePointer])
            lastMaxI = ii
            curMaxI = min(curMaxI, ii)
            if ii == len(maxVals):
                maxVals.append(gayArray[ePointer])
                maxPosses.append(ePointer)
            else:
                maxVals[ii] = gayArray[ePointer]
                maxPosses[ii] = ePointer

            ePointer += 1

        # ePointer ei olisi enää laillinen lisäys
        if ePointer != lastEPointer:
            ylitaulukot.append(Ylitaulukko(tPointer, ePointer - 1))
            lastEPointer = ePointer

        #tPointer seuraavaan max/min +1 valueen, poista tämä value. Jos ei ole valueita niin +1
        if (maxPosses[curMaxI] == minPosses[curMinI]) and maxPosses[curMaxI] != n-1:
            tPointer = maxPosses[curMaxI] +1
            curMaxI = 0
            curMinI = 0
            maxPosses = [tPointer]
            minPosses = [tPointer]
            maxVals = [gayArray[tPointer]]
            minVals = [gayArray[tPointer]]
            lastMaxI = 0
            lastMinI = 0
        elif (maxPosses[curMaxI] < minPosses[curMinI]):
            tPointer = maxPosses[curMaxI] +1
            curMaxI += 1
        else:
            tPointer = minPosses[curMinI] +1
            curMinI += 1

        ePointer = max(ePointer, tPointer + 1)

    if ylitaulukot[-1].end != n-1:
        ylitaulukot.append(Ylitaulukko(n-1, n-1))

    return ylitaulukot



def laskeAlitaulukot(ylitaulukot):
    result = 0
    lastEnd = -1
    for ylitaulukko in ylitaulukot:
        length = ylitaulukko.end - ylitaulukko.start + 1
        result += (length*(length+1))/2

        if lastEnd >= ylitaulukko.start:
            length = lastEnd - ylitaulukko.start + 1
            result -= (length*(length+1))/2

        lastEnd = ylitaulukko.end

    return result

def main():
    n, k = [int(i) for i in input().split(" ")]
    gayArray = [int(i) for i in input().split(" ")]
    if n == 1:
        print("1")
    else:
        print(int(laskeAlitaulukot(muodostaYlitaulukot(gayArray, n, k))))

main()

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5050

user output
5050

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 2
5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ...

correct output
317

user output
317

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 10
71 60 61 96 25 10 10 9 84 85 1...

correct output
119

user output
119

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
4006

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 1000000000
553190572 453407680 667300705 ...

correct output
5050

user output
5050

Test 6

Group: 2, 3

Verdict: ACCEPTED

input
2000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
2001000

user output
2001000

Test 7

Group: 2, 3

Verdict:

input
2000 2
4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ...

correct output
6340

user output
6368

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
2000 10
65 88 33 88 41 10 17 38 22 3 8...

correct output
2413

user output
2413

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
1287776

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
2000 1000000000
621947980 510355354 756705418 ...

correct output
2001000

user output
2001000

Test 11

Group: 3

Verdict: ACCEPTED

input
100000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5000050000

user output
5000050000

Test 12

Group: 3

Verdict:

input
100000 2
3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ...

correct output
317066

user output
319531

Test 13

Group: 3

Verdict:

input
100000 10
10 3 6 3 43 60 5 48 15 27 86 4...

correct output
123292

user output
123294

Test 14

Group: 3

Verdict: ACCEPTED

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
4946886742

Test 15

Group: 3

Verdict: ACCEPTED

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
5000050000

Test 16

Group: 3

Verdict: ACCEPTED

input
100000 50000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
3750075000

user output
3750075000

Test 17

Group: 3

Verdict: ACCEPTED

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
3750075000