CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:juhoh
Submission time:2015-09-29 21:41:20
Language:Haskell
Status:READY
Result:11
Feedback
groupverdictscore
#1ACCEPTED11
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.05 s1details
#12ACCEPTED0.05 s1details
#13ACCEPTED0.06 s1details
#14ACCEPTED0.06 s1details
#15ACCEPTED0.05 s1details
#16ACCEPTED0.05 s1details
#17ACCEPTED0.05 s1details
#18ACCEPTED0.05 s1details
#19ACCEPTED0.06 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.06 s2details
#22ACCEPTED0.05 s2details
#230.04 s2details
#24ACCEPTED0.06 s2details
#25ACCEPTED0.05 s2details
#26ACCEPTED0.05 s2details
#27ACCEPTED0.05 s2details
#28ACCEPTED0.05 s2details
#29ACCEPTED0.05 s2details
#30ACCEPTED0.05 s2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.05 s2details
#33ACCEPTED0.06 s2details
#340.05 s2details
#35ACCEPTED0.06 s2details
#36ACCEPTED0.05 s2details
#37ACCEPTED0.06 s2details
#38ACCEPTED0.05 s2details
#39ACCEPTED0.04 s2details
#40ACCEPTED0.05 s2details
#41ACCEPTED0.06 s3details
#42ACCEPTED0.05 s3details
#43ACCEPTED0.06 s3details
#44ACCEPTED0.05 s3details
#45ACCEPTED0.06 s3details
#46ACCEPTED0.05 s3details
#47ACCEPTED0.06 s3details
#48ACCEPTED0.05 s3details
#49ACCEPTED0.05 s3details
#50ACCEPTED0.06 s3details
#51ACCEPTED0.06 s3details
#52ACCEPTED0.06 s3details
#53ACCEPTED0.05 s3details
#54ACCEPTED0.05 s3details
#55ACCEPTED0.05 s3details
#560.34 s3details
#570.35 s3details
#580.36 s3details
#590.39 s3details
#600.38 s3details
#61ACCEPTED0.06 s4details
#62ACCEPTED0.06 s4details
#63ACCEPTED0.05 s4details
#64ACCEPTED0.06 s4details
#65ACCEPTED0.04 s4details
#66ACCEPTED0.06 s4details
#67ACCEPTED0.05 s4details
#68ACCEPTED0.05 s4details
#69ACCEPTED0.06 s4details
#70ACCEPTED0.06 s4details
#71ACCEPTED0.05 s4details
#72ACCEPTED0.06 s4details
#73ACCEPTED0.05 s4details
#74ACCEPTED0.05 s4details
#75ACCEPTED0.05 s4details
#760.39 s4details
#770.39 s4details
#780.39 s4details
#790.39 s4details
#800.38 s4details

Compiler report

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

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

Code

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

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 n | n == 0       = max (list!!0) (list!!1 - 1)
               | n == len - 1 = max (list!!(len-1)) (list!!(len-2) - 1)
               | otherwise    = 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 plan) !! times
  where
    plan = solvingPlan state
    times = maximum plan

solvingPlan :: State -> State
solvingPlan state = map check indexedState
  where
    check (_, 1) = 0
    check (i, x) = (min (i-0) (len-1-i)) + 1
    indexedState = zip [0..] state
    len = length state

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) ]

ll :: [Move] -> (Group -> Bool) -> State -> [Move]
ll _ _ [] = []
ll moves fn (x:xs) | fn x = (head moves:ll (drop 1 moves) fn xs)
                   | otherwise = (0:ll moves fn xs)

solve :: State -> Solution
solve [] = []
solve [0] = []
solve state = (move:(solve $ makeMove state index))
  where
    index = fst $ maximumBy (comparing snd) $ zip [0..] plan
    move = (ll [1..] isBig state) !! index
    plan = solvingPlan state

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

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

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

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
2 2 1

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

user output
3
2 1 1

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

correct output
4
2 1 1 1 

user output
4
3 2 2 1

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
2 2 1

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

correct output
3
1 2 1 

user output
3
3 2 1

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

correct output
2
1 1 

user output
2
2 1

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

correct output
3
2 1 1 

user output
3
2 1 1

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
2 2 1

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

user output
4
2 3 2 1

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

correct output
3
1 1 1 

user output
3
1 1 1

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
4
2 2 2 1

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 2 1

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
3
3 2 1

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
3
2 2 1

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

correct output
3
2 1 1 

user output
3
2 1 1

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000

correct output
QAQ

user output
QAQ

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000

correct output
3
2 1 1 

user output
3
2 2 1

Test 23

Group: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
4
2 2 1 0

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

correct output
2
1 1 

user output
2
2 1

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

correct output
2
2 1 

user output
2
2 1

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

correct output
4
2 1 1 1 

user output
4
3 2 2 1

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

correct output
3
2 1 1 

user output
3
2 1 1

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

correct output
3
2 1 1 

user output
3
2 2 1

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

correct output
3
3 2 1 

user output
3
3 2 1

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

correct output
4
1 1 1 1 

user output
4
2 2 2 1

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
2 2 2 1

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
2
2 1

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

correct output
4
1 1 1 1 

user output
4
2 2 2 1

Test 34

Group: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
4
2 2 1 0

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 2 1

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ

Test 38

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
31
1 20 20 20 20 20 20 20 20 20 2...

user output
31
21 20 20 19 19 18 18 17 17 16 ...

Test 39

Group: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...

correct output
23
13 13 12 11 11 11 11 10 9 9 9 ...

user output
23
13 12 12 11 11 11 11 10 9 9 9 ...

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

correct output
4
2 1 1 1 

user output
4
1 2 1 1

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

correct output
2
2 1 

user output
2
2 1

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

correct output
3
2 2 1 

user output
3
2 2 1

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

user output
3
3 2 1

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

correct output
3
1 1 1 

user output
3
1 1 1

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
3
2 2 1

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

correct output
4
2 1 1 1 

user output
4
3 2 2 1

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

correct output
3
2 1 1 

user output
3
2 1 1

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

correct output
2
1 1 

user output
2
1 1

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

correct output
3
2 1 1 

user output
3
2 1 1

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

correct output
3
2 2 1 

user output
3
2 2 1

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 2 1

Test 56

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 57

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
1501
1 1000 1000 1000 1000 1000 100...

user output
(empty)

Test 59

Group: 3

Verdict:

input
010101010101010101010101010101...

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

correct output
1272
1 1 648 647 646 646 645 645 64...

user output
(empty)

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 2 1

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

correct output
3
2 2 1 

user output
3
2 2 1

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

correct output
3
2 1 1 

user output
3
2 1 1

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

correct output
4
1 1 1 1 

user output
4
1 1 2 1

Test 67

Group: 4

Verdict: ACCEPTED

input
0100111010

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

correct output
4
1 1 1 1 

user output
4
2 2 2 1

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
2
2 1

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

correct output
4
2 2 2 1 

user output
4
2 2 2 1

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

correct output
3
2 1 1 

user output
3
2 1 1

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

correct output
3
3 2 1 

user output
3
3 2 1

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
2
2 1

Test 74

Group: 4

Verdict: ACCEPTED

input
1011000101

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 2 1

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
30001
1 20000 20000 20000 20000 2000...

user output
(empty)

Test 79

Group: 4

Verdict:

input
010101010101010101010101010101...

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 80

Group: 4

Verdict:

input
111000110000011000001101010010...

correct output
25011
1 12471 12470 12469 12468 1246...

user output
(empty)