Submission #34760057

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import Control.Monad
import qualified Data.ByteString.Char8 as BS
import Data.Char
import Data.List
import qualified Data.Set as S
main = do
-- 読み込み
  [n,m] <- bsGetLnInts
  co <- BS.getContents
  let (ss,ts) = splitAt n $ BS.lines co
  let ans = abc268d n m ss ts
  BS.putStrLn ans
bsGetLnInts :: IO [Int]
bsGetLnInts = BS.getLine >>= return . unfoldr (BS.readInt . BS.dropWhile isSpace)
noanswer = BS.pack "-1"
abc268d :: Int -> Int -> [BS.ByteString] -> [BS.ByteString] -> BS.ByteString
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import Control.Monad
import qualified Data.ByteString.Char8 as BS
import Data.Char
import Data.List

import qualified Data.Set as S

main = do
-- 読み込み
  [n,m] <- bsGetLnInts
  co <- BS.getContents
  let (ss,ts) = splitAt n $ BS.lines co
  let ans = abc268d n m ss ts
  BS.putStrLn ans

bsGetLnInts :: IO [Int]
bsGetLnInts = BS.getLine >>= return . unfoldr (BS.readInt . BS.dropWhile isSpace)

noanswer = BS.pack "-1"

abc268d :: Int -> Int -> [BS.ByteString] -> [BS.ByteString] -> BS.ByteString
abc268d 1 m [s] ts
  | elem s ts = noanswer
  | BS.length s < 3 = noanswer
  | otherwise = s
abc268d n m ss ts
  | null zs = noanswer
  | otherwise = head zs
  where
    tS = S.fromList ts
    slen = sum (map BS.length ss)
    usmax = 16 - slen
    usmin = 3 - slen
    zs =
      [ z
      | ss1 <- permutations ss
      , k <- [max usmin (pred n) .. usmax]
      , ks <- combinations (pred n) k
      , let z = BS.concat $ zipWith f (0 : ks) ss1
      , S.notMember z tS
      ]

f k s = BS.append (BS.take k usb) s

usb = BS.pack $ replicate 16 '_'

combinations 1 x = [[x]]
combinations n x = [a:bs | a <- [1 .. x-n+1], bs <- combinations (pred n) (x-a)]

{-
8個の順列の個数は 8! = 40320
下線を1以上、合計が16文字以下になるようにいれる方法は (n-1)～使える個数 C (n-1)
総当たりしても間に合う
-}

Submission Info

Compile Error

Loaded package environment from /home/contestant/.ghc/x86_64-linux-8.8.3/environments/default

Judge Result