Submission #2865138


Source Code Expand

import Control.Monad
import Data.List
import qualified Data.ByteString.Char8 as B
import qualified Data.Vector.Storable as V

main=do
    n<-readLn::IO Int
    xs<-unfoldr (B.readInt.B.dropWhile(==' '))<$>B.getLine
    --
    let ys=V.fromList.sort $ xs
    let m1= ys V.! ((n `div` 2)-1)
    let m2= ys V.! (n `div` 2)
    --
    sequence_ $ map (print.(f m1 m2)) xs

f m1 m2 x = if x < m2 then m2 else m1

Submission Info

Submission Time
Task C - Many Medians
User mick0321
Language Haskell (GHC 7.10.3)
Score 300
Code Size 421 Byte
Status AC
Exec Time 655 ms
Memory 50428 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 18
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt AC 2 ms 636 KB
10.txt AC 615 ms 47228 KB
11.txt AC 325 ms 43900 KB
12.txt AC 244 ms 32380 KB
2.txt AC 292 ms 23804 KB
3.txt AC 633 ms 48252 KB
4.txt AC 590 ms 47356 KB
5.txt AC 632 ms 49404 KB
6.txt AC 629 ms 47228 KB
7.txt AC 467 ms 35580 KB
8.txt AC 649 ms 47228 KB
9.txt AC 655 ms 50428 KB
sample1.txt AC 2 ms 508 KB
sample2.txt AC 2 ms 508 KB
sample3.txt AC 2 ms 508 KB