Submission #449010

---

Source Code Expand

import Data.List
main = getLine >>= main' . read . head . words
    where
        main' n = getContents >>= print . solve n . map (map read . words) . lines

solve :: Int -> [[Int]] -> Int
solve n ys = check cnds ans
    where
        ans = sortBy (\x y -> length y `compare` length x) $ subsequences [1..n]
        cnds = foldr ff [] [1..n]
        ff x acc = (x, foldl ff' [] ys) : acc
            where
                ff' acc [a, b]
                    | a == x = b : acc
                    | b == x = a : acc
                    | otherwise = acc

check :: [(Int, [Int])] -> [[Int]] -> Int
check _ [] = 1
check cnds (y : ys)
    | res = length y
    | otherwise = check cnds ys
    where
        res = all ((length y - 1 ==) . mcount y . getCnd) y
        mcount xs = foldl (\acc x -> if x `elem` xs then acc + 1 else acc) 0
        getCnd = snd . (cnds !!) . pred

Submission Info

Judge Result