Submission #2232967

Source Code Expand

(declaim (optimize (speed 3) (debug 0) (safety 0)))
(format t "~A~%"
    (max (let ((n (read))
               (s (string (read)))
               (x 0))
           (loop for c across s
                 do (setq x (if (char= c #\I) (1+ x) (1- x)))
                 maximize x))
         0))

Submission Info

Submission Time
Task B - Increment Decrement
User qjr
Language Common Lisp (SBCL 1.1.14)
Score 200
Code Size 296 Byte
Status AC
Exec Time 126 ms
Memory 12520 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_alld_01.txt, subtask_1_alldmax_01.txt, subtask_1_alli_01.txt, subtask_1_allimax_01.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 126 ms 12520 KB
sample_02.txt AC 12 ms 3688 KB
subtask_1_alld_01.txt AC 12 ms 3684 KB
subtask_1_alldmax_01.txt AC 12 ms 3688 KB
subtask_1_alli_01.txt AC 11 ms 3680 KB
subtask_1_allimax_01.txt AC 11 ms 3684 KB
subtask_1_max_01.txt AC 12 ms 3680 KB
subtask_1_max_02.txt AC 11 ms 3688 KB
subtask_1_rand_01.txt AC 11 ms 3684 KB
subtask_1_rand_02.txt AC 11 ms 3680 KB