当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

6013:Lotus and Thermodynamics

题目描述
These days Lotus is interested in Brownian movement, so she wants to write a simulation program to meet her research desire.

The purpose of this procedure is to simulate the irregular movement of some points on a two-dimensional plane, and to support the following operations:

I x y: indicates that a new point $(x, y)$ is found in the plane. The index of the new point is the number of points already existing in the plane plus 1.

M l r x y: indicates that the points whose index belong to $[l, r]$ moved $x$ units right and $y$ units up.

R l r x y a: indicates that the points whose index belong to $[l, r]$ were rotated counterclockwise by the angle $a$. the rotation center is $(x, y)$. $a$ is radian, and $a$ contains at most one decimal place.

F l r x y d: indicates that the points whose index belong to $[l, r]$ scaled d times, the scaling center is $(x, y)$.It's Guaranteed that $d\in[0,1]$, and $d$ contains at most one decimal place.

Q id: Ask for the coordinates of the point whose index is $id$, output a line of two real numbers, separated by a space, Suppose the answers are x,y,you should use printf("%.0lf %.0lf\n",floor(x),floor(y)); to output them.
输入解释
The input includes multiple test cases. The first line contains a single integer $T$, the number of test cases.

The first line of each test case contains a single integer $q\in[1,100000]$, the number of operations.

The next $q$ line, each line contains the description of an operation.
For all number in the input file, it's guaranteed that they are in $[-1000,1000]$

It's guaranteed there are at most 2 test cases with $q > 10000$。
输出解释
For each operation Q, print a line of two real number presenting the answer.
It's guaranteed that the absolute value of the answer won't be greater than $10^7$.
输入样例
2
6
I 4 -1
I 8 3
R 1 1 -4 8 -0.4
Q 1
F 1 2 -1 1 0.1
I -1 9
5
I 0 4
R 1 1 -6 9 1.9
Q 1
R 1 1 1 8 2.4
Q 1
输出样例
-1 -4
-4 16
-2 -1
来自杭电HDUOJ的附加信息
Recommend jiangzijing2015

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 BestCoder Round #91

源链接: HDU-6013

最后修改于 2020-10-25T23:27:34+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
6000/3000MS(Java/Others) 262144/262144K(Java/Others)