結果

問題 No.3171 Color Restoration
ユーザー tomcat1233
提出日時 2025-06-06 21:35:44
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 2,623 bytes
コンパイル時間 11,249 ms
コンパイル使用メモリ 206,592 KB
実行使用メモリ 6,272 KB
最終ジャッジ日時 2025-06-06 21:35:57
合計ジャッジ時間 8,053 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 13 WA * 13
権限があれば一括ダウンロードができます
コンパイルメッセージ
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: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

ソースコード

diff # 

{-# 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

one = ["gray","brown","green","cyan","blue","yellow","orange","red"]
two = ["gray","green","blue","yellow","red"]
thr = ["gray","green","cyan","blue","violet","orange","red"]

f str = sum cs
  where
    e c color = if c `elem` color then 1 else 0
    cs = map (e str) [one, two, thr]

solve ss
  | length (nubOrd ss) == 1 = True
  | otherwise = sum (map f ss) <= 6 
    
main :: IO ()
main = do
  ss <- words <$> getLine
  yn $ solve ss



--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
0