CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:ZakkeX
Submission time:2020-10-07 12:50:30 +0300
Language:Haskell
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#20.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#40.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s2, 3details
#70.01 s2, 3details
#80.01 s2, 3details
#90.02 s2, 3details
#10ACCEPTED0.02 s2, 3details
#11ACCEPTED0.18 s3details
#120.18 s3details
#130.22 s3details
#140.43 s3details
#15ACCEPTED0.43 s3details
#160.29 s3details
#170.30 s3details

Compiler report

input/code.hs:2:1: warning: [-Wincomplete-patterns]
    Pattern match(es) are non-exhaustive
    In an equation for `f': Patterns not matched: _ [] _
  |
2 | f maxDiff ((len, maxi):xs) new 
  | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...

input/code.hs:12:1: warning: [-Wmissing-signatures]
    Top-level binding with no type signature: main :: IO ()
   |
12 | main = do
   | ^^^^

input/code.hs:16:1: warning: [-Wtabs]
    Tab character found here, and in one further location.
    Please use spaces instead.
   |
16 |         maxDiff = read $ last $ words ln1 :: Int
   | ^^^^^^^^

Code

f :: Int -> [(Int, Int)] -> Int -> [(Int, Int)]
f maxDiff ((len, maxi):xs) new 
  | abs (new - maxi) <= maxDiff = (len + 1, max maxi new):xs
  | otherwise = (1, new):(len, maxi):xs

g :: Int -> Int
g i = (i + i * i) `div` 2

h :: [(Int, a)] -> Int
h x = foldr (+) 0 $ map g $ map fst x

main = do
    input <- getContents
    let ln1 = head $ lines input
        ln2 = last $ lines input
	maxDiff = read $ last $ words ln1 :: Int
	list = map read $ words ln2 :: [Int]
    print $ h $ foldl (f maxDiff) [(0, 0)] list

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:

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

correct output
317

user output
428

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:

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
4071

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
7403

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
2421

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
713749

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
379304

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
124765

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
4940311201

Test 15

Group: 3

Verdict: ACCEPTED

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
5000050000

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
5000050000

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
2500050001