結果

問題 No.2921 Seated in Classroom
コンテスト
ユーザー tomcat1233
提出日時 2024-10-12 16:17:36
言語 Haskell
(9.10.1)
結果
AC  
実行時間 183 ms / 2,000 ms
コード長 2,226 bytes
コンパイル時間 8,393 ms
コンパイル使用メモリ 180,176 KB
実行使用メモリ 42,368 KB
最終ジャッジ日時 2024-10-12 16:17:47
合計ジャッジ時間 10,296 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 5
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:54: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."
   |
54 | nubOrd = map head.group.sort
   |              ^^^^
[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


seat :: (Int, Int) -> Int
seat (n, m) = n'+ min 1 nM + m' 
  where n' = fst nDM
        nDM = divMod n 4
        nM = snd nDM
        x = if nM == 0 then m - (4 * n') else m - (4 * n' + (8 - nM))
        mDM = divMod (max x 0) 8
        m' = fst mDM + min 1 (snd mDM)

 
main :: IO ()
main = do
  t <- getInt
  nms <- getIntNTuples t
  let ans = map seat nms
  mapM_ print ans
0