Difference between revisions of "2018 Multi-University, HDU Day 9"
Jump to navigation
Jump to search
(Created page with "两个半小时签完到，最后两个 Last Hour。人生大起大落真刺激。 == Problem A == Solved by zerol. 02:33 (+) == Problem B == Solved by kblack. 04:43 (+3)...") |
|||
| Line 3: | Line 3: | ||
== Problem A == | == Problem A == | ||
| − | Solved by zerol. 02:33 (+) | + | Solved by zerol & kblack. 02:33 (+) |
| + | |||
| + | 题意：在 n×m 的方格中填 1~nm 的数，使得只有一个数是它所在行列的最大值。 | ||
| + | |||
| + | 题解：显然那唯一一个数就是 nm。考虑从大到小依次填数，每个数肯定得填在一个之前填过的数的同一行或者同一列。 | ||
| + | |||
| + | |||
| + | |||
| + | 无比艰难的签到。 | ||
== Problem B == | == Problem B == | ||
Revision as of 11:30, 20 August 2018
两个半小时签完到，最后两个 Last Hour。人生大起大落真刺激。
Problem A
Solved by zerol & kblack. 02:33 (+)
题意：在 n×m 的方格中填 1~nm 的数，使得只有一个数是它所在行列的最大值。
题解：显然那唯一一个数就是 nm。考虑从大到小依次填数，每个数肯定得填在一个之前填过的数的同一行或者同一列。
无比艰难的签到。
Problem B
Solved by kblack. 04:43 (+3)
Problem D
Solved by kblack. 01:29 (+1)
Problem J
Solved by ultmaster. 04:44 (+2)
Problem K
Solved by zerol. 00:47 (+)