| # | Name | ||
|---|---|---|---|
| A |
standard input/output
1 s, 256 MB
|
|
|
| B |
standard input/output
1 s, 256 MB
|
|
|
| C |
standard input/output
1 s, 256 MB
|
|
|
| D |
standard input/output
2 s, 256 MB
|
|
|
| E |
standard input/output
2 s, 256 MB
|
|
|
| F |
standard input/output
2 s, 256 MB
|
|
|
| G |
standard input/output
4 s, 256 MB
|
|
|
| H |
standard input/output
4 s, 512 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2018-09-02 18:08:54
|
Announcement |
Problem D. Valid BFS?
***** The BFS algorithm in this problem always starts with 1, however, it is not guaranteed that a[1] = 1. |