結果

問題 No.743 Segments on a Polygon
コンテスト
ユーザー momen999
提出日時 2019-03-02 23:13:42
言語 Haskell
(9.10.1)
結果
TLE  
実行時間 -
コード長 624 bytes
コンパイル時間 10,365 ms
コンパイル使用メモリ 173,696 KB
実行使用メモリ 93,056 KB
最終ジャッジ日時 2024-06-23 13:06:34
合計ジャッジ時間 12,533 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other TLE * 1 -- * 9
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:9:18: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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."
  |
9 | solve xs = iter (head xs) xs + solve (tail xs) where
  |                  ^^^^

Main.hs:9:39: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, 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."
  |
9 | solve xs = iter (head xs) xs + solve (tail xs) where
  |                                       ^^^^

Main.hs:15:31: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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."
   |
15 |                     c1 = b1 > head y
   |                               ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Control.Monad
import Data.List

rInteger :: String -> Integer
rInteger = read

solve :: [[Integer]] -> Integer
solve (_:[]) = 0
solve xs = iter (head xs) xs + solve (tail xs) where
    iter _ [] = 0
    iter x (y:ys) | c1 && c2    = 1 + iter x ys
                  | otherwise   = iter x ys
                  where
                    b1 = last x
                    c1 = b1 > head y
                    c2 = b1 < last y

main = do
    [n, m] <- map read . words <$> getLine
    ls <- sort . map (\ [x, y] -> if x > y then [y, x] else [x, y]) . map (map rInteger . words) <$> replicateM n getLine
    print $ solve ls
0