結果

問題 No.3015 右に寄せろ!
ユーザー torus711torus711
提出日時 2025-01-25 13:20:28
言語 Haskell
(9.10.1)
結果
AC  
実行時間 546 ms / 2,000 ms
コード長 1,322 bytes
コンパイル時間 6,503 ms
コンパイル使用メモリ 203,092 KB
実行使用メモリ 150,016 KB
最終ジャッジ日時 2025-01-25 22:44:15
合計ジャッジ時間 11,744 ms
ジャッジサーバーID
(参考情報)
judge10 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.10.1/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
Main.hs:34:11: 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"."
   |
34 | readStr = head <$> readStrs
   |           ^^^^

[2 of 2] Linking a.out

ソースコード

diff #
プレゼンテーションモードにする

{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE FlexibleContexts #-}
{-# OPTIONS_GHC -O2 #-}
{-# OPTIONS_GHC -Wno-tabs #-}
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
import Data.Array.ST.Safe
import Data.STRef
import Debug.Trace
import Text.Printf
readInt = fst . fromJust . B.readInt <$> B.getLine
readInteger = fst . fromJust . B.readInteger <$> B.getLine
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readIntegers = map ( fst . fromJust . B.readInteger ) . B.words <$> B.getLine
readStr = head <$> readStrs
readStrs = map B.unpack . B.words <$> B.getLine
which a b f = if f then a else b
yesno = which "Yes" "No"
mp [ a, b ] = ( a, b )
modifyArray a i f = writeArray a i =<< f <$> readArray a i
printList :: Show a => [a] -> IO ()
printList = putStrLn . intercalate " " . map show
main = getLine >>= print . solve 0 . reverse
solve _ [] = 0
solve zeros ('0':s) = solve ( succ zeros ) s
solve zeros ('1':'1':s) = zeros + solve zeros s
solve zeros (_:s) = solve zeros s
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0