結果

問題 No.2947 Sing a Song
ユーザー tomcat1233tomcat1233
提出日時 2024-10-25 22:19:30
言語 Haskell
(9.8.2)
結果
AC  
実行時間 23 ms / 2,000 ms
コード長 2,391 bytes
コンパイル時間 6,850 ms
コンパイル使用メモリ 180,404 KB
実行使用メモリ 9,600 KB
最終ジャッジ日時 2024-10-25 22:19:44
合計ジャッジ時間 10,149 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 11 ms
8,832 KB
testcase_04 AC 11 ms
7,808 KB
testcase_05 AC 16 ms
9,600 KB
testcase_06 AC 11 ms
7,936 KB
testcase_07 AC 10 ms
7,936 KB
testcase_08 AC 12 ms
8,192 KB
testcase_09 AC 12 ms
7,808 KB
testcase_10 AC 12 ms
7,808 KB
testcase_11 AC 11 ms
7,808 KB
testcase_12 AC 13 ms
7,936 KB
testcase_13 AC 11 ms
7,936 KB
testcase_14 AC 12 ms
7,936 KB
testcase_15 AC 12 ms
7,936 KB
testcase_16 AC 11 ms
7,808 KB
testcase_17 AC 12 ms
7,808 KB
testcase_18 AC 13 ms
7,936 KB
testcase_19 AC 13 ms
7,808 KB
testcase_20 AC 12 ms
7,936 KB
testcase_21 AC 11 ms
7,808 KB
testcase_22 AC 14 ms
7,936 KB
testcase_23 AC 16 ms
7,936 KB
testcase_24 AC 16 ms
8,192 KB
testcase_25 AC 16 ms
7,936 KB
testcase_26 AC 16 ms
7,808 KB
testcase_27 AC 23 ms
7,936 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:53:14: 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."
   |
53 | nubOrd = map head.group.sort
   |              ^^^^

Main.hs:59: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."
   |
59 |         h = head xs
   |             ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Control.Monad
import Data.Maybe
import qualified Data.ByteString.Char8 as BS
import Control.Monad.ST             
import Data.Ix
import Data.Array (Array)
import Data.Array.IArray
import Data.Array.IO             
import Data.Array.MArray          
import Data.Array.ST                
import Data.Array.Unboxed (UArray)
import Data.Char
import Data.List as L
import Data.Foldable
import Control.Exception
import Data.Array.Base (STUArray(STUArray), UArray (UArray))
import Data.ByteString.Char8 (ByteString)
import Data.Array.IO.Internals (IOUArray(IOUArray))
import Data.Ord (comparing, Down (Down))
tuplify2 :: [b] -> (b, b)
tuplify2 (x:y:_) = (x,y)
tuplify2 _ = undefined

--Input functions with ByteString
readInt :: ByteString -> Int
readInt = fst . fromJust . BS.readInt
readIntTuple :: ByteString -> (Int, Int)
readIntTuple = tuplify2 . map readInt . BS.words
readIntList :: ByteString -> [Int]
readIntList = map readInt . BS.words

getInt :: IO Int
getInt = readInt <$> BS.getLine
getIntList :: IO [Int]
getIntList = readIntList <$> BS.getLine
getIntListX :: IO [Int]
getIntListX = readIntList <$> BS.getContents
getIntNList :: Integral a => a -> IO [[Int]]
getIntNList n = map readIntList <$> replicateM (fromIntegral n) BS.getLine
getIntMatrix :: IO [[Int]]
getIntMatrix = map readIntList . BS.lines <$> BS.getContents
getIntTuple :: IO (Int, Int)
getIntTuple = readIntTuple <$> BS.getLine
getIntNTuples :: Integral a => a -> IO [(Int, Int)]
getIntNTuples n = map readIntTuple <$> replicateM (fromIntegral n) BS.getLine
getIntTuples :: IO [(Int, Int)]
getIntTuples = map readIntTuple . BS.lines <$> BS.getContents
putYesNo :: Bool -> IO ()
putYesNo bl = putStrLn $ if bl then "Yes" else "No"
putInts :: [Int] -> IO ()
putInts x = putStrLn $ unwords $ map show x
nubOrd :: Eq a => Ord a => [a] -> [a]
nubOrd = map head.group.sort
getMatInt :: Int -> Int -> IO (UArray (Int, Int) Int)
getMatInt h w = listArray ((1, 1), (h, w)) . concat <$> replicateM h getIntList

f s t ls lt a = replicate ss s ++ replicate tt t
  where xs = [(x, y) |x <- [a,a-1..0],let lsx = ls * x, let y = max 0 (div (a - lsx) lt), lsx + lt * y == a]
        h = head xs
        ss = fst h
        tt = snd h

main :: IO ()
main = do
  n <- getInt
  [s, t] <- words <$> getLine
  as <- getIntList
  let ls = length s
  let lt = length t
  let ans = map (f s t ls lt) as
  mapM_ (putStrLn . unwords) ans
0