結果
問題 |
No.3260 岩井スターグラフ
|
ユーザー |
|
提出日時 | 2025-09-06 13:41:17 |
言語 | Haskell (9.10.1) |
結果 |
AC
|
実行時間 | 263 ms / 2,000 ms |
コード長 | 2,521 bytes |
コンパイル時間 | 9,463 ms |
コンパイル使用メモリ | 205,812 KB |
実行使用メモリ | 42,240 KB |
最終ジャッジ日時 | 2025-09-06 13:41:36 |
合計ジャッジ時間 | 17,387 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
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:86:14: 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"." | 86 | nubOrd = map head.group.sort | ^^^^ [2 of 2] Linking a.out
ソースコード
{-# LANGUAGE LambdaCase #-} {-# OPTIONS_GHC -Wno-unused-imports -Wno-unused-top-binds #-} 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 Data.Function import Control.Exception import Data.Array.Base (STUArray(STUArray), UArray (UArray)) import Data.Array.IO.Internals (IOUArray(IOUArray)) import Data.Ord import GHC.Float myDM x y = (div (x - 1) y, mod (x - 1) y) f y (u, v) | u == 0 = mv + 1 | du == dv = mv - mu | otherwise = mu + mv + 2 where (du, mu) = myDM u y (dv, mv) = myDM v y main :: IO () main = do [x, y, n] <- getIntList uvs <- getIntNTuples n let ans = map (f y) uvs mapM_ print ans --library-------------- modulus :: Int modulus = 10 ^ 9 + 7 addMod, subMod, mulMod :: Int -> Int -> Int addMod x y = (x + y) `mod` modulus subMod x y = (x - y) `mod` modulus mulMod x y = (x * y) `mod` modulus tuplify2 :: [b] -> (b, b) tuplify2 (x:y:_) = (x,y) tuplify2 _ = undefined readInt :: BS.ByteString -> Int readInt = fst . fromJust . BS.readInt readIntTuple :: BS.ByteString -> (Int, Int) readIntTuple = tuplify2 . map readInt . BS.words readIntList :: BS.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 getIntMatArr :: Int -> Int -> IO (UArray (Int, Int) Int) getIntMatArr h w = listArray ((1, 1), (h, w)) . concat <$> getIntNList h yn :: Bool -> IO () yn 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