結果

問題 No.962 LCPs
コンテスト
ユーザー Leonardone
提出日時 2019-12-25 20:16:31
言語 Haskell
(9.10.1)
結果
AC  
実行時間 75 ms / 2,000 ms
コード長 555 bytes
コンパイル時間 7,347 ms
コンパイル使用メモリ 172,416 KB
実行使用メモリ 25,088 KB
最終ジャッジ日時 2024-09-25 10:38:17
合計ジャッジ時間 11,005 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 64
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )

Main.hs:4:34: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  |
4 | main = interact $ show . solve . tail . lines
  |                                  ^^^^

Main.hs:16:39: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
16 |                  1   -> ([], length $ head xs)
   |                                       ^^^^

Main.hs:18:36: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
18 |                     where rs = map tail xs
   |                                    ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

-- Try yukicoder
-- author: Leonardone @ NEETSDKASU

main = interact $ show . solve . tail . lines

solve vs = g vs
    where
        g [] = 0
        g ("":ts) = g ts 
        g ss@((e:_):_) = w + g zs + g ys where
            (xs, ys) = span (f e) ss
            f _ "" = False
            f c (h:_) = c == h
            (zs, w) = case length xs of
                 0   -> ([], 0)
                 1   -> ([], length $ head xs)
                 len -> (rs, foldl1 (+) $ zipWith (*) [len,len-1..1] [1..len])
                    where rs = map tail xs
0