結果
問題 |
No.3262 水色コーダーさん、その問題d問題ですよ?(1<=d<=N)
|
ユーザー |
|
提出日時 | 2025-09-06 15:01:00 |
言語 | Haskell (9.10.1) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 2,513 bytes |
コンパイル時間 | 10,907 ms |
コンパイル使用メモリ | 205,764 KB |
実行使用メモリ | 10,240 KB |
最終ジャッジ日時 | 2025-09-06 15:01:12 |
合計ジャッジ時間 | 10,165 ms |
ジャッジサーバーID (参考情報) |
judge / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 24 |
コンパイルメッセージ
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:38:46: 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"." | 38 | ans = length $ filter id $ map (\x -> f (head x) (tail x)) ps | ^^^^ Main.hs:38:55: warning: [GHC-63394] [-Wx-partial] In the use of ‘tail’ (imported from Data.List, but defined in GHC.Internal.List): "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"." | 38 | ans = length $ filter id $ map (\x -> f (head x) (tail x)) ps | ^^^^ Main.hs:85: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"." | 85 | 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 f (a, b) xs | null xs = True | a > d = False | otherwise = f (x, d) ts where ((c, d) : ts) = xs x = max a c main :: IO () main = do n <- getInt lrs <- getIntNTuples n let ps = permutations lrs ans = length $ filter id $ map (\x -> f (head x) (tail x)) ps 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