Bittipeli

input/code.hs:5:1: Warning:
    The import of `Debug.Trace' is redundant
      except perhaps to import instances from `Debug.Trace'
    To import instances alone, use: import Debug.Trace()

input/code.hs:29:15: Warning: Defined but not used: `x'

import Data.List
import Data.Char
import Data.Maybe

import Debug.Trace (trace)

type Group = Int
type State = [Group]
type Move = Int
type Solution = [Move]

isBig :: Group -> Bool
isBig = (<) 1

spread :: State -> State
spread list = [simulate c | c <- [0..len-1]]
  where
    simulate 0 = max (list!!0) (list!!1 - 1)
    simulate n | n == len - 1 = max (list!!(len-1)) (list!!(len-2) - 1)
    simulate n = max (list!!n) $ max (list!!(n-1) - 1) (list!!(n+1) - 1)
    len = length list

isSolvable :: State -> Bool
isSolvable [] = True
isSolvable state = all (>0) ((iterate spread checked) !! times)
  where
    checked = map check indexedState
    check (_, 1) = 0
    check (i, x) = (min (i-0) (len-1-i)) + 1
    indexedState = zip [0..] state
    len = length state
    times = maximum checked

makeMove :: State -> Move -> State
makeMove state index = j' ++ n ++ k'
  where
    j = take index state
    j' = take (index - 1) j
    k = drop (index + 1) state
    k' = drop 1 k
    f [] _ = 0
    f list fn = fn list
    n = [ (f j last) + (f k head) ]

solve :: State -> Maybe Solution
solve [] = Just []
solve [a] | isBig a   = Just [0]
          | otherwise = Nothing
solve [a, b] | isBig a && isBig b = Just [0, 0]
             | otherwise          = Nothing
solve state = case solutions of
              [] -> Nothing
              ((_, Nothing):_) -> Nothing
              ((move, Just solution):_) -> Just (move:solution)
  where solutions = filter (isJust.snd) possibleSolutions
        possibleSolutions = [(move, solve $ makeMove state index) | (move, index) <- validMoves]
        validMoves = zip [0..] $ filter isBigPosition [0..len-1]
        isBigPosition pos = isBig (state!!pos)
        len = length state

parseInput :: String -> State
parseInput input = map length $ group $ filter (not . isSpace) input

printSolution :: Maybe [Move] -> IO ()
printSolution solution = putStrLn $ case solution of
  Just s ->
    (show $ length s) ++ "\n" ++ intercalate " " (map (show . (\x -> x+1)) $ s)
  Nothing ->
    "QAQ"

main :: IO ()
main = do input <- getLine
          let state = parseInput input
              solution = if isSolvable state
                         then solve state
                         else Nothing
          printSolution solution

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 1

Verdict: ACCEPTED

Test 16

Group: 1

Verdict: ACCEPTED

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 1

Verdict: ACCEPTED

Test 19

Group: 1

Verdict: ACCEPTED

Test 20

Group: 1

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: ACCEPTED

Test 30

Group: 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: ACCEPTED

Test 32

Group: 2

Verdict: ACCEPTED

Test 33

Group: 2

Verdict: ACCEPTED

Test 34

Group: 2

Verdict: ACCEPTED

Test 35

Group: 2

Verdict: ACCEPTED

Test 36

Group: 2

Verdict: ACCEPTED

Test 37

Group: 2

Verdict: ACCEPTED

Test 38

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 39

Group: 2

Verdict: ACCEPTED

Test 40

Group: 2

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: ACCEPTED

Test 43

Group: 3

Verdict: ACCEPTED

Test 44

Group: 3

Verdict: ACCEPTED

Test 45

Group: 3

Verdict: ACCEPTED

Test 46

Group: 3

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: ACCEPTED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: ACCEPTED

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: ACCEPTED

Test 52

Group: 3

Verdict: ACCEPTED

Test 53

Group: 3

Verdict: ACCEPTED

Test 54

Group: 3

Verdict: ACCEPTED

Test 55

Group: 3

Verdict: ACCEPTED

Test 56

Group: 3

Verdict: RUNTIME ERROR

Test 57

Group: 3

Verdict: RUNTIME ERROR

Test 58

Group: 3

Verdict: RUNTIME ERROR

Test 59

Group: 3

Verdict: RUNTIME ERROR

Test 60

Group: 3

Verdict: RUNTIME ERROR

Test 61

Group: 4

Verdict: ACCEPTED

Test 62

Group: 4

Verdict: ACCEPTED

Test 63

Group: 4

Verdict: ACCEPTED

Test 64

Group: 4

Verdict: ACCEPTED

Test 65

Group: 4

Verdict: ACCEPTED

Test 66

Group: 4

Verdict: ACCEPTED

Test 67

Group: 4

Verdict: ACCEPTED

Test 68

Group: 4

Verdict: ACCEPTED

Test 69

Group: 4

Verdict: ACCEPTED

Test 70

Group: 4

Verdict: ACCEPTED

Test 71

Group: 4

Verdict: ACCEPTED

Test 72

Group: 4

Verdict: ACCEPTED

Test 73

Group: 4

Verdict: ACCEPTED

Test 74

Group: 4

Verdict: ACCEPTED

Test 75

Group: 4

Verdict: ACCEPTED

Test 76

Group: 4

Verdict: RUNTIME ERROR

Test 77

Group: 4

Verdict: RUNTIME ERROR

Test 78

Group: 4

Verdict: RUNTIME ERROR

Test 79

Group: 4

Verdict: RUNTIME ERROR

Test 80

Group: 4

Verdict: RUNTIME ERROR