Created
January 29, 2014 10:27
-
-
Save kunishi/8685287 to your computer and use it in GitHub Desktop.
ICPC 2009 Asia Region, Problem A
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fun sort _ nil = nil | |
| sort f (xl as x::xs) = sort f (List.filter (fn y => f y x = LESS) xs) | |
@ (List.filter (fn y => f y x = EQUAL) xl) | |
@ sort f (List.filter (fn y => f y x = GREATER) xs); | |
fun compare x y = | |
if x < y then LESS | |
else if x > y then GREATER | |
else EQUAL; | |
fun solve_one front side = | |
let | |
fun block nil nil = 0 | |
| block (x::xs) nil = x + block xs nil | |
| block nil (y::ys) = y + block nil ys | |
| block (xl as x::xs) (yl as y::ys) = | |
if x = y then x + block xs ys | |
else if x > y then x + block xs yl | |
else y + block xl ys | |
in | |
block (List.rev (sort compare front)) (List.rev (sort compare side)) | |
end; | |
fun solve filename eod = | |
let | |
open TextIO | |
val indata = openIn filename | |
val b = ref NONE | |
fun split s = String.tokens (fn c => c = #" ") s | |
fun toIntList l = List.map (fn s => valOf (Int.fromString s)) l | |
in | |
while (b := inputLine indata; (!b) <> SOME eod) do | |
let | |
val front = toIntList (split (valOf (inputLine indata))) | |
val side = toIntList (split (valOf (inputLine indata))) | |
in | |
output (stdOut, (Int.toString (solve_one front side)) ^ "\n") | |
end; | |
closeIn indata | |
end; | |
solve "2009_asia_a_in.txt" "0 0\n" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
5 5 | |
1 2 3 4 5 | |
1 2 3 4 5 | |
5 5 | |
2 5 4 1 3 | |
4 1 5 3 2 | |
5 5 | |
1 2 3 4 5 | |
3 3 3 4 5 | |
3 3 | |
7 7 7 | |
7 7 7 | |
3 3 | |
4 4 4 | |
4 3 4 | |
4 3 | |
4 2 2 4 | |
4 2 1 | |
4 4 | |
2 8 8 8 | |
2 3 8 3 | |
10 10 | |
9 9 9 9 9 9 9 9 9 9 | |
9 9 9 9 9 9 9 9 9 9 | |
10 9 | |
20 1 20 20 20 20 20 18 20 20 | |
20 20 20 20 7 20 20 20 20 | |
0 0 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment