結果

問題 No.455 冬の大三角
ユーザー aimy
提出日時 2017-08-14 21:34:38
言語 Haskell
(9.10.1)
結果
AC  
実行時間 6 ms / 2,000 ms
コード長 876 bytes
コンパイル時間 7,106 ms
コンパイル使用メモリ 197,120 KB
実行使用メモリ 8,064 KB
最終ジャッジ日時 2024-06-30 02:33:08
合計ジャッジ時間 9,146 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 54
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:19:13: 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."
   |
19 |     (x,y) = head [(i,j) | i<-[0..h-1], j<-[0..w-1], valid (x1,y1) (x2,y2) (i,j)]
   |             ^^^^

Main.hs:26:60: 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."
   |
26 | distinct xs = let sxs = sort xs in and $ zipWith (/=) sxs (tail sxs)
   |                                                            ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.Ratio
import Data.List
import Control.Monad

(%%) n d
  | d == 0 = Nothing
  | otherwise = Just (n%d)

splitOn :: Int -> [a] -> [[a]]
splitOn n = takeWhile (not . null) . unfoldr (return . splitAt n)

main = do
  [h,w] <- map read . words <$> getLine
  space <- lines <$> getContents
  putStrLn $ unlines (triangle h w space)

triangle h w space = splitOn w $ make h w (x1,y1) (x2,y2) (x,y)
  where
    (x,y) = head [(i,j) | i<-[0..h-1], j<-[0..w-1], valid (x1,y1) (x2,y2) (i,j)]
    [(x1,y1),(x2,y2)] = map snd $ filter ((=='*') . fst) $ zip (concat space) [(i,j) | i<-[0..h-1], j<-[0..w-1]]

valid p1@(x1,y1) p2@(x2,y2) p3@(i,j) = ((x1-i)%%(y1-j) /= (x2-i)%%(y2-j)) && distinct [p1,p2,p3]

make h w p1 p2 p3 = [c | i<-[0..h-1], j<-[0..w-1], let c = if elem (i,j) [p1,p2,p3] then '*' else '-']

distinct xs = let sxs = sort xs in and $ zipWith (/=) sxs (tail sxs)
0