本文介绍了 Patrick 在迎接朋友 Spongebob 来访前需要购买零食的问题。他需要在两个商店间找到最短路径。文章提供了一个包含三个道路长度的输入，要求计算 Patrick 访问两家商店并返回家的最小行走距离。示例展示了两种可能的最优路线。
A. Patrick and Shopping
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is a d1 meter long road between his
最低0.47元/天 解锁文章
扫一扫
682
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
