摘要:
P1073 最优贸易 P1073 最优贸易 P1073 最优贸易 题目描述 C 国有 n 个大城市和 m 条道路,每条道路连接这 n 个城市中的某两个城市。任意两个 城市之间最多只有一条道路直接相连。这 m 条道路中有一部分为单向通行的道路,一部分 为双向通行的道路,双向通行的道路在统计条数时也计为 阅读全文
摘要:
Purifying Machine Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5027 Accepted: 1455 Description Mike is the owner of a cheese factory. He 阅读全文
摘要:
Repairing Company Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 6947 Accepted: 1869 Description Lily runs a repairing company that servi 阅读全文
摘要:
Machine Schedule Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 13977 Accepted: 5973 Description As we all know, machine scheduling is a v 阅读全文
摘要:
COURSES Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20672 Accepted: 8159 Description Consider a group of N students and P courses. Each 阅读全文
摘要:
Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 29799 Accepted: 12090 Description Every cow's dream is to become the most popu 阅读全文
摘要:
The Perfect Stall Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 22642 Accepted: 10107 Description Farmer John completed his new barn just 阅读全文
摘要:
Arctic Network Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 0 Accepted: 0 Description The Department of National Defence (DND) wishes to 阅读全文
摘要:
Highways Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 27912 Accepted: 12734 Description The island nation of Flatopia is perfectly flat. 阅读全文
摘要:
Constructing Roads Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22048 Accepted: 9389 Description There are N villages, which are numbere 阅读全文