CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:siar
Submission time:2020-10-06 18:39:11 +0300
Language:Python3 (CPython3)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.03 s1, 2, 3details
#20.03 s1, 2, 3details
#30.03 s1, 2, 3details
#40.03 s1, 2, 3details
#50.03 s1, 2, 3details
#60.03 s2, 3details
#70.03 s2, 3details
#80.03 s2, 3details
#90.03 s2, 3details
#100.03 s2, 3details
#110.03 s3details
#120.03 s3details
#130.03 s3details
#140.03 s3details
#150.03 s3details
#160.03 s3details
#170.03 s3details

Code

import time
import random



n, k = 5,2


theList = [3,1,2,6,4]


counter = 0

listsaesa = []

def getAllWindows(L):
    for w in range(1, len(L)+1):
        for i in range(len(L)-w+1):
            if max(L[i:i+w]) - min(L[i:i+w]) <= k:
                yield listsaesa.append(L[i:i+w])


#
# def testis(n):
#     for i in range(0, n):
#         for x in range(i+1, n+1):
#
#             if max(theList[i:x]) - min(theList[i:x]) <= k:
#
#                 counter += 1
#



mygenerator = getAllWindows(theList)

for i in mygenerator:
    psads=0

print(len(listsaesa))







#
# n, k = map(int, input().split())
#
#
# theList = list(map(int, input().strip().split()))
#
# counter = 0
#
# for i in range(0, n):
#     for x in range(i+1, n+1):
#
#         if max(theList[i:x]) - min(theList[i:x]) <= k:
#
#             counter += 1
#
#
# print(counter)

Test details

Test 1

Group: 1, 2, 3

Verdict:

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

correct output
5050

user output
9

Test 2

Group: 1, 2, 3

Verdict:

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

correct output
317

user output
9

Test 3

Group: 1, 2, 3

Verdict:

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

correct output
119

user output
9

Test 4

Group: 1, 2, 3

Verdict:

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
9

Test 5

Group: 1, 2, 3

Verdict:

input
100 1000000000
553190572 453407680 667300705 ...

correct output
5050

user output
9

Test 6

Group: 2, 3

Verdict:

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

correct output
2001000

user output
9

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
9

Test 8

Group: 2, 3

Verdict:

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

correct output
2413

user output
9

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
9

Test 10

Group: 2, 3

Verdict:

input
2000 1000000000
621947980 510355354 756705418 ...

correct output
2001000

user output
9

Test 11

Group: 3

Verdict:

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

correct output
5000050000

user output
9

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
9

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
9

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
9

Test 15

Group: 3

Verdict:

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
9

Test 16

Group: 3

Verdict:

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

correct output
3750075000

user output
9

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
9