| # | Name | ||
|---|---|---|---|
| A |
standard input/output
2 s, 1024 MB
|
|
|
| B |
standard input/output
2 s, 1024 MB
|
|
|
| C |
standard input/output
2 s, 1024 MB
|
|
|
| D |
standard input/output
2 s, 1024 MB
|
|
|
| E |
standard input/output
2 s, 1024 MB
|
|
|
| F |
standard input/output
4 s, 1024 MB
|
|
|
| G |
standard input/output
6 s, 1024 MB
|
|
|
| H |
standard input/output
6 s, 1024 MB
|
|
|
| I |
standard input/output
6 s, 1024 MB
|
|
|
| J |
standard input/output
6 s, 1024 MB
|
|
|
| K |
standard input/output
8 s, 1024 MB
|
|
|
| L |
standard input/output
12 s, 1024 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2018-12-08 16:44:03
|
Submissions for problem G has been rejudged. Sorry for the inconvenience.
|
|
|
2018-12-08 12:39:45
|
So x and y are a permutation of 1..n in input.
|
|
|
2018-12-08 12:37:46
|
>> As the statement the given graph contains no loops, but the examples do have loops. >> Loops means self-loops.
|
|
|
2018-12-08 12:37:03
|
>> Does the bold text of the problem statement mean "each row contains exactly one rook AND each column contains exactly one rook" ? >> Yes.
|
|
|
2018-12-08 12:32:39
|
Extra spaces in your output may lead to 'Wrong Answer'.
|
| Name |
|---|


