Submission #38446874

Source Code Expand

import Data.Array

main = do
  [n,m] <- map read . words <$> getLine
  uvs <- map (map read . words) . lines <$> getContents
  let ans = abc287c n m uvs
  putStrLn $ if ans then "Yes" else "No"

abc287c :: Int -> Int -> [[Int]] -> Bool
abc287c n m uvs = n == succ m && cnt 1 == 2 && cnt 2 == n - 2
  where
    g = accumArray (+) 0 (1,n) [(u,1) | uv <- uvs, u <- uv]
    cnt k = length $ filter (k ==) $ elems g

Submission Info

Submission Time
Task C - Path Graph?
User joetheshootingst
Language Haskell (GHC 8.8.3)
Score 0
Code Size 424 Byte
Status WA
Exec Time 939 ms
Memory 17652 KiB

Compile Error

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

Judge Result

Set Name Sample All AfterContest
Score / Max Score 0 / 0 0 / 300 0 / 0
Status
AC × 3
AC × 30
WA × 6
AC × 4
Set Name Test Cases
Sample 00_example_00.txt, 00_example_01.txt, 00_example_02.txt
All 00_example_00.txt, 00_example_01.txt, 00_example_02.txt, 01_dense_00.txt, 02_path_00.txt, 02_path_01.txt, 02_path_02.txt, 02_path_03.txt, 02_path_04.txt, 02_path_05.txt, 02_path_06.txt, 02_path_07.txt, 02_path_08.txt, 02_path_09.txt, 03_paths_00.txt, 03_paths_01.txt, 03_paths_02.txt, 04_cycles_00.txt, 04_cycles_01.txt, 04_cycles_02.txt, 04_cycles_03.txt, 04_cycles_04.txt, 04_cycles_05.txt, 05_corner_00.txt, 05_corner_01.txt, 05_corner_02.txt, 05_corner_03.txt, 05_corner_04.txt, 05_corner_05.txt, 06_random_00.txt, 06_random_01.txt, 06_random_02.txt, 06_random_03.txt, 06_random_04.txt, 07_small_00.txt, 07_small_01.txt
AfterContest 08_after_contest_00.txt, 08_after_contest_01.txt, 08_after_contest_02.txt, 08_after_contest_03.txt
Case Name Status Exec Time Memory
00_example_00.txt AC 8 ms 3832 KiB
00_example_01.txt AC 2 ms 3688 KiB
00_example_02.txt AC 2 ms 3896 KiB
01_dense_00.txt AC 2 ms 3820 KiB
02_path_00.txt AC 939 ms 17648 KiB
02_path_01.txt AC 934 ms 17440 KiB
02_path_02.txt AC 387 ms 10092 KiB
02_path_03.txt AC 701 ms 15104 KiB
02_path_04.txt AC 391 ms 10808 KiB
02_path_05.txt AC 767 ms 15608 KiB
02_path_06.txt AC 319 ms 9692 KiB
02_path_07.txt AC 815 ms 16340 KiB
02_path_08.txt AC 370 ms 9764 KiB
02_path_09.txt AC 24 ms 5744 KiB
03_paths_00.txt AC 2 ms 3784 KiB
03_paths_01.txt AC 5 ms 3940 KiB
03_paths_02.txt AC 5 ms 3716 KiB
04_cycles_00.txt AC 2 ms 3808 KiB
04_cycles_01.txt AC 2 ms 3648 KiB
04_cycles_02.txt AC 3 ms 3820 KiB
04_cycles_03.txt AC 2 ms 3940 KiB
04_cycles_04.txt AC 3 ms 3648 KiB
04_cycles_05.txt AC 3 ms 3792 KiB
05_corner_00.txt WA 859 ms 17652 KiB
05_corner_01.txt WA 836 ms 17568 KiB
05_corner_02.txt WA 849 ms 17612 KiB
05_corner_03.txt WA 846 ms 17564 KiB
05_corner_04.txt WA 842 ms 17416 KiB
05_corner_05.txt WA 850 ms 17508 KiB
06_random_00.txt AC 3 ms 3820 KiB
06_random_01.txt AC 7 ms 3800 KiB
06_random_02.txt AC 6 ms 3860 KiB
06_random_03.txt AC 2 ms 3644 KiB
06_random_04.txt AC 6 ms 3816 KiB
07_small_00.txt AC 2 ms 3812 KiB
07_small_01.txt AC 3 ms 3716 KiB
08_after_contest_00.txt AC 888 ms 13344 KiB
08_after_contest_01.txt AC 795 ms 13008 KiB
08_after_contest_02.txt AC 45 ms 5864 KiB
08_after_contest_03.txt AC 3 ms 3844 KiB