Submission #51388776

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import Control.Monad
import qualified Data.ByteString.Char8 as BS
import Data.Char
import Data.List
import qualified Data.Vector.Unboxed as UV
import Debug.Trace
main :: IO ()
main = do
  [n,k] <- bsGetLnInts
  cvs <- replicateM n bsGetLnInts
  let ans = abc345e n k cvs
  print ans
bsGetLnInts :: IO [Int]
bsGetLnInts = unfoldr (BS.readInt . BS.dropWhile isSpace) <$> BS.getLine
--data TOP2 = E0 | E1 (Int,Int) | E2 (Int,Int) (Int,Int)
--  deriving Show
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import Control.Monad
import qualified Data.ByteString.Char8 as BS
import Data.Char
import Data.List

import qualified Data.Vector.Unboxed as UV

import Debug.Trace

main :: IO ()
main = do
  [n,k] <- bsGetLnInts
  cvs <- replicateM n bsGetLnInts
  let ans = abc345e n k cvs
  print ans

bsGetLnInts :: IO [Int]
bsGetLnInts = unfoldr (BS.readInt . BS.dropWhile isSpace) <$> BS.getLine

--data TOP2 = E0 | E1 (Int,Int) | E2 (Int,Int) (Int,Int)
--  deriving Show
-- E0 : (-1,0,-1,0), E1 : (w,d,-1,0), E2 : (w,d,x,e)

abc345e :: Int -> Int -> [[Int]] -> Int
abc345e n k cvs = ans
  where
    score0 = UV.fromList $ (0,0,-1,0) : replicate k (-1,0,-1,0)
    (ans,_,_,_) = foldl' step score0 cvs UV.! k
    step score (c:v:_) = UV.generate (succ k) g
      where
        g 0 = f (score UV.! 0) (-1,0,-1,0)
        g i = f (score UV.! i) (score UV.! pred i)

        f (-1,_,_,_) = id
        f (w,d,-1,_) | c /= d    = ins (w + v, c)
                     | otherwise = id
        f (w,d,x,e) | c /= d    = ins (w + v, c)
                    | otherwise = ins (x + v, c)

ins :: (Int,Int) -> (Int,Int,Int,Int) -> (Int,Int,Int,Int)
{-
ins (v,c) (-1,_,_,_) = (v,c,-1,0)
ins (v,c) (w,d,-1,_) | c == d = (max v w, c, -1, 0)
                     | v >= w = (v, c, w, d)
                     | otherwise = (w, d, v, c)
ins (v,c) (w,d,x,e)
  | c == d = (max v w, c, x, e)
  | v >= w = (v, c, w, d)
  | v >= x = (w, d, v, c)
  | True   = (w, d, x, e)
-}
ins (v,c) wdxe@(w,d,x,e)
  | c == d = (max v w, c, x, e)
  | v >= w = (v, c, w, d)
  | v >= x = (w, d, v, c)
  | True   = wdxe

-- Vectorで書き直し。

Submission Info

Compile Error

app/Main.hs:8:1: warning: [-Wunused-imports]
    The import of ‘Debug.Trace’ is redundant
      except perhaps to import instances from ‘Debug.Trace’
    To import instances alone, use: import Debug.Trace()
  |
8 | import Debug.Trace
  | ^^^^^^^^^^^^^^^^^^

app/Main.hs:25:9: warning: [-Wunused-matches]
    Defined but not used: ‘n’
   |
25 | abc345e n k cvs = ans
   |         ^

app/Main.hs:29:5: warning: [-Wincomplete-patterns]
    Pattern match(es) are non-exhaustive
    In an equation for ‘step’:
        Patterns of type ‘UV.Vector (Int, Int, Int, Int)’,
                         ‘[Int]’ not matched:
            _ []
            _ [_]
   |
29 |     step score (c:v:_) = UV.generate (succ k) g
   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...

app/Main.hs:37:18: warning: [-Wunused-matches]
    Defined but not used: ‘e’
   |
37 |         f (w,d,x,e) | c /= d    = ins (w + v, c)
   |                  ^

Judge Result