牛客 2021年度训练联盟热身训练赛第二场 G题Plate Spinning

最新推荐文章于 2022-02-23 17:35:23 发布

最新推荐文章于 2022-02-23 17:35:23 发布

阅读量279

点赞数 1

分类专栏：算法刷题/比赛

本文链接：https://blog.csdn.net/weixin_45884316/article/details/114805766

版权

算法刷题/比赛专栏收录该内容

13 篇文章 3 订阅

订阅专栏

在这里插入图片描述

文章目录

题目描述

Plate spinning is a circus act where a person spins various objects(usually plates and bowls) on poles without them falling off. It involves spinning an object and then returning back to the object in order to add additional speed to prevent it from falling off the pole.
In this problem you will simulate plate spinning where the plates are placed in a circular arrangement (much like the picture to the right). You must determine whether Chester the Clown will be able to maintain the plates spinning or whether one or more plates will end up falling off poles.

The Problem:
Given the number of poles/plates in a circular arrangement and the speed up to which Chester the Clown spins the plates (in degrees per second), determine if he can maintain the act or if plates will fall. For this problem, we will assume that plates degrade (slow down) at a constant rate of 5-degrees-per-second per second and that Chester can move from one pole to any other pole in 0.5 seconds. In addition, assume that Chester can spin up a plate with zero time cost.
A plate falls off when its rate is zero. However, if Chester arrives at a plate exactly at the same time the rate reaches zero, Chester will spin the plate and prevents it from falling, i.e., the rate must reach zero before Chester arrives for the plate to fall.

输入描述:

The first line of the input will be a single positive integer, a, representing the number of acts to evaluate. Each of the following a lines will represent a single act and will contain two positive integers, n and p, separated by a single space, where n represents the number of poles (1 ≤ n ≤ 15) and p represents the speed up to which Chester spins a plate (0 < p ≤ 100) in degrees per second. At the very beginning of each act, all plates are initially spinning at this speed, and he is currently at a plate in the circle (he can choose which plate to start at in order to maximize his chance of success).

输出描述:

For each circus act, output a header “Circus Act i:” on a line by itself where i is the number of the act (starting with 1). Then, on the next line, output “Chester can do it!” if Chester can maintain the act, or output “Chester will fail!” if one or more plates will fall. Leave a blank line after the output for each test case.

输入

3
2 10
5 7
2 12

输出

Circus Act 1:
Chester can do it!

Circus Act 2:
Chester will fail!

Circus Act 3:
Chester can do it!

AC的C++代码

#include <iostream>
using namespace std;

int main()
{
	int T;
	cin>>T;
	for(int i=1;i<=T;i++)
	{
		int n,p;
		cin>>n>>p;
		cout<<"Circus Act "<<i<<":"<<endl;
		if(n==1||0.5*5*n<=p)
			cout<<"Chester can do it!"<<endl<<endl;
		else
			cout<<"Chester will fail!"<<endl<<endl;
	}
 }