Submission #3375035
Source Code Expand
let m = 1000000007 let ( +^ ) x y = (x + y) mod m let () = Scanf.scanf "%d %d\n%s" @@ fun n k s -> let dp = Array.init (n + 1) @@ fun _ -> Array.make_matrix (k + 2) (k + 2) 0 in dp.(0).(k).(1) <- 1; String.iteri (fun i -> function | '0' -> for r = -1 to k do dp.(i + 1).(k - 1).(max 0 r) <- dp.(i).(k + 1).(r + 1) +^ dp.(i + 1).(k - 1).(max 0 r); done; for l = 1 to k do dp.(i + 1).(l - 1).(0) <- dp.(i).(l).(0) +^ dp.(i + 1).(l - 1).(0); for r = 0 to k do dp.(i + 1).(l - 1).(r) <- dp.(i).(l).(r + 1) +^ dp.(i + 1).(l - 1).(r); done done | '1' -> for l = -k to 1 do for r = -1 to k - 1 do dp.(i + 1).(min 0 l + 1 + k).(max 0 r + 2) <- dp.(i).(l + k).(r + 1) +^ dp.(i + 1).(min 0 l + 1 + k).(max 0 r + 2) done done | '?' -> for r = -1 to k do dp.(i + 1).(k - 1).(max 0 r) <- dp.(i).(k + 1).(r + 1) +^ dp.(i + 1).(k - 1).(max 0 r); done; for l = 1 to k do dp.(i + 1).(l - 1).(0) <- dp.(i).(l).(0) +^ dp.(i + 1).(l - 1).(0); for r = 0 to k do dp.(i + 1).(l - 1).(r) <- dp.(i).(l).(r + 1) +^ dp.(i + 1).(l - 1).(r); done done; for l = -k to 1 do for r = -1 to k - 1 do dp.(i + 1).(min 0 l + 1 + k).(max 0 r + 2) <- dp.(i).(l + k).(r + 1) +^ dp.(i + 1).(min 0 l + 1 + k).(max 0 r + 2) done done) s; Printf.printf "%d\n" @@ Array.fold_left (Array.fold_left ( +^ )) 0 dp.(n)
Submission Info
Submission Time | |
---|---|
Task | C - 偶然ジェネレータ |
User | fetburner |
Language | OCaml (4.02.3) |
Score | 100 |
Code Size | 1593 Byte |
Status | AC |
Exec Time | 1630 ms |
Memory | 219380 KB |
Compile Error
File "./Main.ml", line 7, characters 25-1300: Warning 8: this pattern-matching is not exhaustive. Here is an example of a value that is not matched: 'a'
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 10 / 10 | 30 / 30 | 60 / 60 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask0-sample-04.txt |
Subtask1 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask0-sample-04.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 |
Subtask2 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask0-sample-04.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt |
Subtask3 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask0-sample-04.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, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask3-01.txt, subtask3-02.txt, subtask3-03.txt, subtask3-04.txt, subtask3-05.txt, subtask3-06.txt, subtask3-07.txt, subtask3-08.txt, subtask3-09.txt, subtask3-10.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 | 384 KB |
subtask0-sample-04.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 | 384 KB |
subtask1-05.txt | AC | 1 ms | 384 KB |
subtask1-06.txt | AC | 1 ms | 384 KB |
subtask1-07.txt | AC | 1 ms | 384 KB |
subtask1-08.txt | AC | 1 ms | 384 KB |
subtask1-09.txt | AC | 1 ms | 384 KB |
subtask1-10.txt | AC | 1 ms | 384 KB |
subtask2-01.txt | AC | 1 ms | 384 KB |
subtask2-02.txt | AC | 1 ms | 384 KB |
subtask2-03.txt | AC | 1 ms | 640 KB |
subtask2-04.txt | AC | 2 ms | 640 KB |
subtask2-05.txt | AC | 2 ms | 640 KB |
subtask2-06.txt | AC | 2 ms | 640 KB |
subtask2-07.txt | AC | 2 ms | 640 KB |
subtask2-08.txt | AC | 2 ms | 640 KB |
subtask2-09.txt | AC | 2 ms | 640 KB |
subtask2-10.txt | AC | 2 ms | 640 KB |
subtask3-01.txt | AC | 6 ms | 1408 KB |
subtask3-02.txt | AC | 30 ms | 6656 KB |
subtask3-03.txt | AC | 3 ms | 768 KB |
subtask3-04.txt | AC | 4 ms | 1280 KB |
subtask3-05.txt | AC | 13 ms | 4736 KB |
subtask3-06.txt | AC | 22 ms | 4992 KB |
subtask3-07.txt | AC | 1630 ms | 219380 KB |
subtask3-08.txt | AC | 3 ms | 768 KB |
subtask3-09.txt | AC | 4 ms | 1024 KB |
subtask3-10.txt | AC | 7 ms | 1536 KB |