結果

問題 No.1205 Eye Drops
コンテスト
ユーザー torus711
提出日時 2020-10-08 05:21:32
言語 Haskell
(9.14.1)
コンパイル:
ghc -rtsopts -with-rtsopts=-K1G -o a.out -O2 _filename_
実行:
./a.out
結果
WA  
実行時間 -
コード長 1,201 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 988 ms
コンパイル使用メモリ 207,428 KB
実行使用メモリ 215,396 KB
最終ジャッジ日時 2026-04-02 21:08:53
合計ジャッジ時間 2,297 ms
ジャッジサーバーID
（参考情報） 		judge1_1 / judge3_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 14 WA * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.14.1/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
Main.hs:39:1: warning: [GHC-94817] [-Wtabs]
    Tab character found here, and in 7 further locations.
    Suggested fix: Please use spaces instead.
   |
39 |         [ _, m ] <- readInts
   | ^^^^^^^^

Main.hs:42:28: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, but defined in GHC.Internal.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
   |
42 |                 illiegal = head ts < head ps
   |                            ^^^^

Main.hs:42:38: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, but defined in GHC.Internal.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
   |
42 |                 illiegal = head ts < head ps
   |                                      ^^^^

Main.hs:47:11: warning: [GHC-53633] [-Woverlapping-patterns]
    Pattern match is redundant
    In an equation for ‘solve’:
        solve (t1 : t2 : ts) (p1 : p2 : ps) | abs (p1 - p2)
                                                <= t2 - t1 = ...
   |
47 |         | abs ( p1 - p2 ) <= t2 - t1 = solve (t2:ts) (p2:ps)
   |           ^^^^^^^^^^^^^^^^^^^^^^^^^^

Main.hs:48:11: warning: [GHC-53633] [-Woverlapping-patterns]
    Pattern match is redundant
    In an equation for ‘solve’:
        solve (t1 : t2 : ts) (p1 : p2 : ps) | otherwise = ...
   |
48 |         | otherwise = False
   |           ^^^^^^^^^

[2 of 2] Linking a.out

ソースコード

diff #
raw source code 

{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}

import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST

import Data.Char
import Data.List
import Data.Maybe

import qualified Data.ByteString.Char8 as B

import Data.Array.ST.Safe
import Data.STRef

import Debug.Trace
import Text.Printf

readInt = readLn :: IO Int
readInteger = readLn :: IO Integer
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readIntegers = map ( fst . fromJust . B.readInteger ) . B.words <$> B.getLine

which a b f = if f then a else b
mp [ a, b ] = ( a, b )

modifyArray a i f = writeArray a i =<< f <$> readArray a i

printList [a] = print a
printList (a:as) = putStr ( show a ) >> putChar ' ' >> printList as

main = do
	[ _, m ] <- readInts
	[ ts, ps ] <-  transpose <$> replicateM m readIntegers
	let
		illiegal = head ts < head ps
	putStrLn $ which "Yes" "No" $ not illiegal && solve (0:ts) (0:ps)

solve (t:ts) _ = True
solve (t1:t2:ts) (p1:p2:ps)
	| abs ( p1 - p2 ) <= t2 - t1 = solve (t2:ts) (p2:ps)
	| otherwise = False
0