結果

問題 No.962 LCPs
ユーザー LeonardoneLeonardone
提出日時 2019-12-25 20:16:31
言語 Haskell
(9.8.2)
結果
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
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 3 ms
6,944 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 2 ms
6,944 KB
testcase_14 AC 2 ms
6,940 KB
testcase_15 AC 2 ms
6,940 KB
testcase_16 AC 1 ms
6,940 KB
testcase_17 AC 75 ms
25,088 KB
testcase_18 AC 69 ms
21,888 KB
testcase_19 AC 64 ms
21,888 KB
testcase_20 AC 61 ms
20,992 KB
testcase_21 AC 62 ms
20,864 KB
testcase_22 AC 64 ms
20,224 KB
testcase_23 AC 64 ms
20,480 KB
testcase_24 AC 62 ms
20,864 KB
testcase_25 AC 62 ms
20,736 KB
testcase_26 AC 61 ms
19,840 KB
testcase_27 AC 57 ms
16,640 KB
testcase_28 AC 58 ms
17,024 KB
testcase_29 AC 62 ms
19,840 KB
testcase_30 AC 61 ms
19,840 KB
testcase_31 AC 55 ms
13,800 KB
testcase_32 AC 55 ms
16,000 KB
testcase_33 AC 63 ms
20,736 KB
testcase_34 AC 55 ms
15,872 KB
testcase_35 AC 61 ms
19,968 KB
testcase_36 AC 60 ms
18,560 KB
testcase_37 AC 54 ms
19,712 KB
testcase_38 AC 55 ms
20,224 KB
testcase_39 AC 48 ms
16,000 KB
testcase_40 AC 55 ms
19,968 KB
testcase_41 AC 56 ms
20,096 KB
testcase_42 AC 54 ms
20,224 KB
testcase_43 AC 54 ms
19,968 KB
testcase_44 AC 55 ms
19,968 KB
testcase_45 AC 55 ms
19,712 KB
testcase_46 AC 54 ms
20,352 KB
testcase_47 AC 21 ms
11,776 KB
testcase_48 AC 15 ms
9,728 KB
testcase_49 AC 23 ms
12,160 KB
testcase_50 AC 24 ms
13,056 KB
testcase_51 AC 20 ms
11,520 KB
testcase_52 AC 16 ms
10,752 KB
testcase_53 AC 21 ms
12,544 KB
testcase_54 AC 16 ms
10,624 KB
testcase_55 AC 13 ms
9,728 KB
testcase_56 AC 24 ms
12,928 KB
testcase_57 AC 42 ms
15,616 KB
testcase_58 AC 42 ms
15,360 KB
testcase_59 AC 42 ms
15,488 KB
testcase_60 AC 53 ms
15,488 KB
testcase_61 AC 52 ms
15,744 KB
testcase_62 AC 52 ms
15,744 KB
testcase_63 AC 26 ms
9,856 KB
testcase_64 AC 31 ms
16,640 KB
testcase_65 AC 27 ms
9,984 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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