Alitaulukot

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

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

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

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

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

{-# LANGUAGE BangPatterns #-}
import Data.List
import qualified Data.ByteString.Char8 as BS
 
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 = foldl' (f maxDiff) [([], 0, 10 ^ 9 + 1)] $ reverse list
 
main = do
    input <- BS.getContents
    let ln1 = head $ BS.lines input
        ln2 = last $ BS.lines input
	unbsread (Just (x, _)) = x
        maxDiff = unbsread $ BS.readInt $ last $ BS.words ln1 :: Int
        !list = map unbsread $ map BS.readInt $! BS.words ln2
    -- print $ h $ foldl' (f maxDiff) [([], 0, 999999999999)] list
    print $ d maxDiff list

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED