摘要:
题目 http://www.ioi2009.org/GetResource?id=1271 分析 题目难度不高,有两点注意: 坑如样例。关于排名,题目中这样说: The final standings of the competition list the contestants in descen 阅读全文
摘要:
题目描述 The cows are so very silly about their dinner partners. They have organized themselves into three groups (conveniently numbered 1, 2, and 3) that 阅读全文
摘要:
Sliding Window Time Limit: 12000MS Memory Limit: 65536K Total Submissions: 65974 Accepted: 18744 Case Time Limit: 5000MS Description An array of size 阅读全文
摘要:
Boats Magicians have to come to the great assembly of Aglargond School of Magic. They cancome with boats, among other ways. Organizers have reserved a 阅读全文
摘要:
题目 题目描述 Although Farmer John has no problems walking around the fair to collect prizes or see the shows, his cows are not in such good shape; a full d 阅读全文
摘要:
题目 题目描述 To avoid unsightly burns while tanning, each of the C (1 ≤ C ≤ 2500) cows must cover her hide with sunscreen when they're at the beach. Cow i 阅读全文
摘要:
题目 3 刷墙(wall.c/cpp/pas)3.1 题目描述Will 被指派去刷墙. 他⼀共需要刷N ⾯墙, 每⾯墙要求刷⼀种颜⾊. 他⼀共有N 桶油漆, 这些油漆⼀共有3种颜⾊, 每种颜⾊的油漆分别有C0, C1, C2 桶. 刷⼀⾯墙需要⽤⼀桶油漆, 这N 桶油漆恰好可以刷完这N ⾯墙(C0 阅读全文
摘要:
题目描述 小 K 在 Minecraft 里面建立很多很多的农场,总共 n 个,以至于他自己都忘记了每个 农场中种植作物的具体数量了,他只记得一些含糊的信息(共 m 个),以下列三种形式描 述: 农场 a 比农场 b 至少多种植了 c 个单位的作物。 农场 a 比农场 b 至多多种植了 c 个单位的 阅读全文
摘要:
题目 题目描述 Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of th 阅读全文
摘要:
题目描述 在有向图G 中,每条边的长度均为1 ,现给定起点和终点,请你在图中找一条从起点到终点的路径,该路径满足以下条件: 1 .路径上的所有点的出边所指向的点都直接或间接与终点连通。 2 .在满足条件1 的情况下使路径最短。 注意:图G 中可能存在重边和自环,题目保证终点没有出边。 请你输出符合条 阅读全文