結果

問題 No.1205 Eye Drops
ユーザー torus711torus711
提出日時 2020-10-08 05:21:32
言語 Haskell
(9.8.2)
結果
WA  
実行時間 -
コード長 1,201 bytes
コンパイル時間 2,773 ms
コンパイル使用メモリ 180,196 KB
実行使用メモリ 50,304 KB
最終ジャッジ日時 2024-07-20 05:42:03
合計ジャッジ時間 5,112 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 2 ms
6,940 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 2 ms
6,940 KB
testcase_12 WA -
testcase_13 AC 2 ms
6,944 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 2 ms
6,940 KB
testcase_17 WA -
testcase_18 AC 2 ms
6,940 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 2 ms
6,940 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 120 ms
50,176 KB
testcase_33 AC 116 ms
50,176 KB
testcase_34 AC 121 ms
50,176 KB
testcase_35 AC 119 ms
50,176 KB
testcase_36 AC 118 ms
50,304 KB
testcase_37 AC 119 ms
50,304 KB
testcase_38 AC 2 ms
6,940 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: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.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."
   |
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.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."
   |
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 # 

{-# 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