Submission #1535625


Source Code Expand

main = do
  getLine
  tas <- map (map read . words) . lines <$> getContents
  print (report tas)
 
report :: [[Integer]] -> Integer
report ([t,a]:tas) = uncurry (+) (foldl asum (t,a) tas)
 
asum (at,aa) [t,a] = let n = max (div1 at t) (div1 aa a) in (n*t, n*a)

div1 x y = let (q,r) = divMod x y in q + signum r

Submission Info

Submission Time
Task C - AtCoDeer and Election Report
User aimy
Language Haskell (GHC 7.10.3)
Score 300
Code Size 323 Byte
Status AC
Exec Time 10 ms
Memory 1532 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 15
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 508 KB
0_001.txt AC 1 ms 508 KB
0_002.txt AC 1 ms 508 KB
1_003.txt AC 1 ms 508 KB
1_004.txt AC 8 ms 1404 KB
1_005.txt AC 3 ms 1020 KB
1_006.txt AC 4 ms 1148 KB
1_007.txt AC 3 ms 1020 KB
1_008.txt AC 2 ms 1020 KB
1_009.txt AC 2 ms 1020 KB
1_010.txt AC 2 ms 892 KB
1_011.txt AC 2 ms 1020 KB
1_012.txt AC 2 ms 1020 KB
1_013.txt AC 9 ms 1404 KB
1_014.txt AC 10 ms 1532 KB