摘要:
题目大意:墙上有一块区域被分成了n个矩形,每个矩形要涂上各自的颜色。为了保证完美要求这一块区域可以进行涂色的条件是它上方的所有区域都已经涂好颜色,这样就不会有后续的操作影响这块区域的颜色。但是如果两块区域颜色不同就要换涂颜色用的刷子。问最少需要换几次。解题思路:区域涂色的大体次序是由拓扑排序决定的,... 阅读全文
摘要:
LabyrinthTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2911Accepted Submission(s): 1007Problem D... 阅读全文
摘要:
Xor SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 7837Accepted Submission(s): 3350Problem D... 阅读全文
摘要:
Disk ScheduleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2560Accepted Submission(s): 366Proble... 阅读全文
摘要:
Energy ConversionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11867Accepted Submission(s): 2861... 阅读全文