Submission #2902897
Source Code Expand
let () = Scanf.scanf "%d %d\n" @@ fun h w -> let acc = Array.make_matrix (h + 1) (w + 1) 0 in for i = 1 to h do for j = 1 to w do Scanf.scanf "%d " @@ fun c -> acc.(i).(j) <- if i mod 2 = j mod 2 then c else ~- c done done; for i = 1 to h do for j = 2 to w do acc.(i).(j) <- acc.(i).(j) + acc.(i).(j - 1) done done; for i = 2 to h do for j = 1 to w do acc.(i).(j) <- acc.(i).(j) + acc.(i - 1).(j) done done; Printf.printf "%d\n" @@ Array.fold_left (Array.fold_left (Array.fold_left (Array.fold_left max))) 0 @@ Array.init h @@ fun i -> Array.init w @@ fun j -> Array.init (i + 1) @@ fun k -> Array.init (j + 1) @@ fun l -> if acc.(i + 1).(j + 1) - acc.(i + 1).(l) - acc.(k).(j + 1) + acc.(k).(l) = 0 then (i - k + 1) * (j - l + 1) else 0
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | fetburner |
Language | OCaml (4.02.3) |
Score | 100 |
Code Size | 892 Byte |
Status | AC |
Exec Time | 864 ms |
Memory | 212340 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask0_sample-05.txt |
All | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask0_sample-05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample-01.txt | AC | 1 ms | 384 KB |
subtask0_sample-02.txt | AC | 1 ms | 384 KB |
subtask0_sample-03.txt | AC | 1 ms | 2432 KB |
subtask0_sample-04.txt | AC | 1 ms | 384 KB |
subtask0_sample-05.txt | AC | 1 ms | 384 KB |
subtask1_01.txt | AC | 1 ms | 384 KB |
subtask1_02.txt | AC | 1 ms | 384 KB |
subtask1_03.txt | AC | 1 ms | 384 KB |
subtask1_04.txt | AC | 1 ms | 512 KB |
subtask1_05.txt | AC | 2 ms | 896 KB |
subtask1_06.txt | AC | 4 ms | 1792 KB |
subtask1_07.txt | AC | 1 ms | 384 KB |
subtask1_08.txt | AC | 2 ms | 640 KB |
subtask1_09.txt | AC | 861 ms | 211060 KB |
subtask1_10.txt | AC | 115 ms | 30588 KB |
subtask1_11.txt | AC | 843 ms | 210676 KB |
subtask1_12.txt | AC | 844 ms | 211700 KB |
subtask1_13.txt | AC | 844 ms | 210684 KB |
subtask1_14.txt | AC | 862 ms | 211452 KB |
subtask1_15.txt | AC | 864 ms | 211324 KB |
subtask1_16.txt | AC | 817 ms | 204404 KB |
subtask1_17.txt | AC | 695 ms | 169460 KB |
subtask1_18.txt | AC | 1 ms | 384 KB |
subtask1_19.txt | AC | 2 ms | 3328 KB |
subtask1_20.txt | AC | 853 ms | 212340 KB |