Submission #1416120


Source Code Expand

import qualified Data.Set as S 

main = do
 getLine
 as <- map read . words <$> getLine
 let likeTo = S.fromDistinctAscList (zip [1..] as)
 let likeFrom = S.fromList (zip as [1..])
 print $ S.size (S.intersection likeTo likeFrom) `div` 2

Submission Info

Submission Time
Task B - Friendly Rabbits
User aimy
Language Haskell (GHC 7.10.3)
Score 200
Code Size 244 Byte
Status AC
Exec Time 906 ms
Memory 70012 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt
Case Name Status Exec Time Memory
0_00.txt AC 2 ms 508 KB
0_01.txt AC 1 ms 508 KB
0_02.txt AC 2 ms 508 KB
1_00.txt AC 1 ms 508 KB
1_01.txt AC 890 ms 67964 KB
1_02.txt AC 899 ms 67964 KB
1_03.txt AC 894 ms 67964 KB
1_04.txt AC 901 ms 68092 KB
1_05.txt AC 889 ms 70012 KB
1_06.txt AC 897 ms 67964 KB
1_07.txt AC 906 ms 67964 KB
1_08.txt AC 297 ms 25980 KB
1_09.txt AC 714 ms 57724 KB
1_10.txt AC 594 ms 47484 KB
1_11.txt AC 119 ms 11644 KB