CF1492A - Three swimmers

已于 2022-10-11 14:15:38 修改
阅读量476 收藏
点赞数
分类专栏： 思维 文章标签： 图论 c++ 算法
于 2021-02-24 22:23:03 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Luowaterbi/article/details/114045461
版权
该博客讨论了一道编程题目，涉及三个以不同速度游泳的人。内容包括题意解析、解题思路和AC代码。问题核心在于计算从到达泳池的那一刻起，最短需要等待多久才能看到任意一个游泳者完成一圈。解决方案考虑了时间p是否为游泳速度的倍数，从而得出等待时间。

摘要生成于 C知道 ，由 DeepSeek-R1 满血版支持， 前往体验 >

1492A - Three swimmers

题意：

三个人在游泳，分别以每a，b，c分钟游一圈。你在p分钟后到泳池，问最短需要等待多长时间可以看到任意一个人。

题解：

p如果是a或者b或者c的倍数，显然等待时间为0，否则为 a − p a-p%a a−p，b，c同理，取个min就行。

AC代码：

#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
最低0.47元/天 解锁文章
K - Three swimmers
qq_51676888的博客
02-27 204
K - Three swimmers Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool. It takes the first swimmer exactly a minutes to swim across the entire pool and come back, exactly b minutes f
Codeforces Round #704 (Div.2)A. Three swimmers
m0_50534498的博客
02-25 339
A. Three swimmersA. Three swimmersInputOutputExampleNoteEditorial（官方题解）Tutorial（教程） A. Three swimmers Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool. It takes the first swimm
Codeforces1492 A. Three swimmers（数学）
zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz
03-01 170
题意： 解法： 如果p能被a,b,c中的任意一个整除,那么答案为0. 否则答案为a-p%a,b-p%b,c-p%c中的最小值,即对他们游完剩下部分的时间取min. code： #include <bits/stdc++.h> #define int long long using namespace std; void solve(){ int p,a,b,c;cin>>p>>a>>b>>c; if(p%a==0||p%b==
A. Three swimmers
无知的我
03-20 302
time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool. It takes th
Codeforces Round #704 (Div. 2)-A. Three swimmers-题解
热门推荐
<font color="Pink">Tisfy的博客</font>
02-23 1万+
Codeforces Round #704 (Div. 2)-A. Three swimmers 传送门 Time Limit: 1 second Memory Limit: 512 megabytes Problem Description Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool. It take
Three swimmers
AsUs.的博客
02-23 395
A. Three swimmers time limit per test1 second memory limit per test512 megabytes inputstandard input outputstandard output Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool. It tak
Kinematic model of a magnetic-microrobot swarm in a rotating magnetic dipole field
XU Yangxin的博客
08-03 245
这篇文章很好，研究了永磁铁驱动的蜂群的运动学建模。重心为各偶极子的位置平均，形状为一个协方差矩阵；再研究了整体前进方向的变化，浓度的变化，协方差矩阵（形状）的变化，尺寸（标准差）的变化。 在一个旋转磁极子场中的磁微机器人蜂群的运动学模型 Kinematic model of a magnetic-microrobot swarm in a rotating magnetic dipole field [1] Paper Link Authors: Chaluvadi, BhanuKiran, et al.
Morphologies and Swimming Characteristics of Rotating Magnetic Swimmers with Soft Tails at Low Reynolds Numbers
02-11
Morphologies and Swimming Characteristics of Rotating Magnetic Swimmers with Soft Tails at Low Reynolds Numbers
codeforces A. Three swimmers
qq_34832548的博客
02-24 166
A. Three swimmers time limit per test1 second memory limit per test512 megabytes inputstandard input outputstandard output Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool. It tak
Codeforces Round #704 (Div. 2), problem: (A) Three swimmers
weixin_46006714的博客
02-24 251
A. Three swimmers time limit per test1 second memory limit per test512 megabytes inputstandard input outputstandard output Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool. It tak
【codeforces题解】2021/2/23 Codeforces Round #704 (Div. 2)
hhhenjoy的博客
03-04 165
A. Three swimmers 问题简要描述： 三个人在泳池游一个来回分别需要的时间为a，b，c； 在时间p时到泳池的出发点，至少等多久一个人游到出发点。 输入输出： 直接计算，代码如下： #include<iostream> using namespace std; long long min(long long a, long long b, long long c) { long long r = a; if (b < r) r = b; if (c < r)
Codeforces Round #704 (Div. 2) 赛后补题题解
hz0010的博客
02-26 689
#704 div2题解A.Three swimmersB. Card DeckC. Maximum widthD. Genius's GambitE. Almost Fault-Tolerant Database div2任意门. 这次题目本来有 很大机会 做出C，实力不够哇 A.Three swimmers 题目 Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim fr
A. Three Indices
无知的我
10-08 544
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a permutationp1,p2,…,pnp1,p2,…,pn. Recall that sequence ofnnintegers is called apermutationif it contains all integers ...
Codeforces Round #704 (Div. 2) 题解
张小生的先生的博客
03-04 254
Codeforces Round #704 (Div. 2) A. Three swimmers int main() { ios; int t; cin >> t; while (t--) { ll p,a,b,c; cin >> p >> a >> b >> c; ll t1=p/a+(p%a==0?0:1); ll t2=p/b+(p%b==0?0:1); ll t3=p/c+(p%c==0?0:1); t1
Cards
Luowaterbi的博客
09-19 870
A. Cards time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output When Serezha was three years old, he was given a set of cards with lette...
Multiplication Table
Luowaterbi的博客
09-19 577
B. Multiplication Table time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Sasha grew up and went to first grade. To celebrate this ...
Codeforce 1296 F Berland Beauty
Luowaterbi的博客
02-05 562
给一颗无根树，你要给每条边赋边权，满足每对到的路径上最小边权为。 树上任意两点之间的路径可以知道的，我们把所有w按从大到小排序，然后把a到b的路径上的边没有赋边权的全设为w，已经有边权的不变，同时计算这条路径上最小边权minn，如果最后minn=w，证明赋权成功，否则失败。 w一定要从大到小，这样才能保证后来的不会覆盖先前的。如果把覆盖成了，那么之前到的路径上最小边权就...
CodeForces1388B - Captain Flint and a Long Voyage
Luowaterbi的博客
07-31 535
题意 将一个nnn位十进制的数，转换成2进制，然后删除2进制的最后nnn位，问剩下的二进制最大的时候，十进制数最小为多少。 题解 写一下0~9的2进制代码，发现只有8，9是4位。同样进制下比较数的大小，最先比的就是位数，那么2进制数的数位应该尽量多，这样删去后n位剩下的位数也是最多的。那么这个十进制数肯定每一位上只有9，8，可以确定剩下2进制数的位数。9是(1001)2(1001)_2(1001)2​，8是(1000)2(1000)_2(1000)2​，同等位数下比较肯定9是更优的。因此我们删去nnn位后剩
swimmer_plot教程
最新发布
11-16
Swimmer Plot是Python的一个可视化库Seaborn中的一个示例，它用于创建一个简单的二维图形，展示不同游泳者在一段时间内速度的变化。这个教程通常会教授如何使用seaborn的`relplot()`函数来创建线图，并显示数据点代表特定的游泳者。 步骤如下： 1. 首先，你需要安装必要的库，如`seaborn`, `pandas`, 和 `matplotlib`。你可以通过pip命令进行安装：`pip install seaborn pandas matplotlib` 2. 导入所需的模块：`import seaborn as sns`, `import pandas as pd`, `import matplotlib.pyplot as plt` 3. 加载swimmer_data.csv文件（通常包含游泳者ID、时间戳和速度的数据），并加载到一个Pandas DataFrame中。 4. 使用`relplot()`函数创建swimmer plot，设置x轴为时间，y轴为速度，颜色由游泳者ID区分。 5. 可能还会演示如何添加标题、图例以及调整其他图表样式。 例如： ```python # 加载数据 df = pd.read_csv('swimmer_data.csv') # 创建swimmer plot sns.relplot(x="time", y="speed", hue="swimmer_id", data=df) # 显示图表 plt.title("Swimmers Speed Over Time") plt.show() ```
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值