#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<double>> T(n, vector<double>(2));
for (int i = 0; i < n; ++i) // for循环比foreach易读性强
{
cin >> T[i][0] >> T[i][1];
}
vector<vector<int>> Location(m, vector<int>(4));
for (int i = 0; i < m; ++i)
{
for (int j = 0; j < 4; ++j)
{
cin >> Location[i][j];
}
}
vector<double> product(n), sum(n); // 拉伸不改变角度,旋转不改变长度,故可以分开统计
if (T[0][0] == 1)
{
product[0] = T[0][1];
sum[0] = 0;
}
else
{
product[0] = 1;
sum[0] = T[0][1];
}
for (int i = 1; i < n; ++i)
{
if (T[i][0] == 1)
{
product[i] = product[i - 1] * T[i][1];
sum[i] = sum[i - 1];
}
else
{
product[i] = product[i - 1];
sum[i] = sum[i - 1] + T[i][1];
}
}
for (const auto &loc : Location)
{
int a = loc[0], b = loc[1];
double x = loc[2], y = loc[3];
double sum_ab = sum[b - 1] - (a > 1 ? sum[a - 2] : 0);
double product_ab = product[b - 1] / (a > 1 ? product[a - 2] : 1);
x *= product_ab;
y *= product_ab;
double x1 = x * cos(sum_ab) - y * sin(sum_ab);
double y1 = x * sin(sum_ab) + y * cos(sum_ab);
cout << fixed << setprecision(3) << x1 << " " << y1 << endl;
}
return 0;
}
CCF-CSP 202309-2 坐标变换(其二)满分解法
最新推荐文章于 2024-07-31 17:25:51 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)