CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:ZakkeX
Submission time:2020-10-10 22:19:09 +0300
Language:Haskell
Status:READY
Result:37
Feedback
groupverdictscore
#1ACCEPTED11
#2ACCEPTED26
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s2, 3details
#7ACCEPTED0.01 s2, 3details
#8ACCEPTED0.01 s2, 3details
#9ACCEPTED0.02 s2, 3details
#10ACCEPTED0.02 s2, 3details
#11ACCEPTED0.26 s3details
#12ACCEPTED0.30 s3details
#13ACCEPTED0.36 s3details
#14--3details
#15ACCEPTED0.54 s3details
#16--3details
#17--3details

Compiler report

input/code.hs:1:1: warning: [-Wmissing-signatures]
    Top-level binding with no type signature: first :: (a, b, c) -> a
  |
1 | first (x, _, _) = x
  | ^^^^^

input/code.hs:2:1: warning: [-Wmissing-signatures]
    Top-level binding with no type signature: second :: (a, b, c) -> b
  |
2 | second (_, x, _) = x
  | ^^^^^^

input/code.hs:3:1: warning: [-Wmissing-signatures]
    Top-level binding with no type signature: third :: (a, b, c) -> c
  |
3 | third (_, _, x) = x
  | ^^^^^

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

input/code.hs:14:1: warning: [-Wincomplete-patterns]
    Pattern match(es) are non-exhaustive
    In an equation for a':
        Patterns not matched:
            [] []
            (_:_) []
   |
14 | a' (x:xs) (y:[]) = (y, max (second x) y, min (third x) y):x:xs
   | ^^^^...

Code

first (x, _, _) = x
second (_, x, _) = x
third (_, _, x) = x

f :: Int -> [([Int], Int, Int)] -> Int -> [([Int], Int, Int)]
f maxDiff ((list, maxi, mini):xs) new 
  | new - mini <= maxDiff && maxi - new <= maxDiff = (new:list, max maxi new, min mini new):xs
  | otherwise = ([new], new, new):(list, maxi, mini):xs

a :: [Int] -> [(Int, Int, Int)]
a list = a' [] $ reverse list

a' :: [(Int, Int, Int)] -> [Int] -> [(Int, Int, Int)]
a' (x:xs) (y:[]) = (y, max (second x) y, min (third x) y):x:xs
a' (x:xs) (y:ys) = a' ((y, max (second x) y, min (third x) y):x:xs) ys
a' [] (y:[]) = ((y, y, y)):[]
a' [] (y:ys) = a' ((y, y, y):[]) ys

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

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

-- borderTables :: Int -> [Int] -> [Int] -> Int
-- borderTables maxDiff (x:xs) nextList = first $ getLongestSubtable maxDiff (0, x, x) nextList

-- borderTables :: Int -> [(Int, Int, Int)] -> [(Int, Int, Int)] -> Int
-- borderTables maxDiff ((_, maxi, mini):xs) nextList = first $ getLongestSubtable maxDiff (0, maxi, mini) $ map first nextList

-- alilistan kaikki myöhemmät jäsenet osuvat ainakin samoihin välilistoihin kuin jäsen itse, joten voi dropata osumat pois testilistasta ja matikoida ne

getLongestSubtable :: Int -> (Int, Int, Int) -> [Int] -> (Int, Int, Int)
getLongestSubtable maxDiff (len, maxi, mini) (new:xs) 
  | new - mini <= maxDiff && maxi - new <= maxDiff = getLongestSubtable maxDiff (len+1, max maxi new, min mini new) xs
  | otherwise = (len, maxi, mini)

mapBordertables :: Int -> [(Int, Int, Int)] -> [Int] -> [Int]
mapBordertables _ [] _ = []
mapBordertables _ _ [] = []
mapBordertables maxDiff (x:xs) nextlist = (len * (length xs + 1)):(mapBordertables maxDiff (xs) (drop len nextlist))
    where len = first $ getLongestSubtable maxDiff (0, second x, third x) nextlist

b maxDiff list = foldl (+) 0 $ map g $ map length $ map first $ f' maxDiff list

c maxDiff list = foldl (+) 0 $ map (foldl (+) 0) $ zipWith func wminmax intlist 
    where wminmax = map a $ map first $ f' maxDiff list
          (_:intlist) = map first $ f' maxDiff list
	  func = mapBordertables maxDiff

d maxDiff list = (b maxDiff list) + (c maxDiff list)

f' maxDiff list = foldr (flip (f maxDiff)) [([], 0, 10 ^ 9 + 1)] list

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, 999999999999)] list
    print $ d maxDiff 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: 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: ACCEPTED

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

correct output
6340

user output
6340

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: ACCEPTED

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

correct output
317066

user output
317066

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
123292

user output
123292

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
(empty)

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
(empty)

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
(empty)