题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
include[HTML_REMOVED]
include[HTML_REMOVED]
include[HTML_REMOVED]
include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
const int N=100010;
define x first
define y second
typedef pair[HTML_REMOVED] PII;
PII q[N];
int main()
{
int n,m;
int t;
int s,d;
double a,b;
cin>>n>>m;
for(int i=0;i<n;i++)
{
cin>>q[i].x>>q[i].y;
}
for(int j=0;j<m;j++)
{
cin>>s>>d>>a>>b;
double s1[N],s2[N];
int t=0;
for(int i=s;i<=d;i++,t++)
{
if(i==s)
{
if(q[i-1].x==1)
{
s1[t]=q[i-1].y*a;
s2[t]=q[i-1].y*b;
}else
{
s1[t]=a*cos(q[i-1].y)-b*sin(q[i-1].y);
s2[t]=a*sin(q[i-1].y)+b*cos(q[i-1].y);
}
}else
{
if(q[i-1].x==1)
{
s1[t]=q[i-1].y*s1[t-1];
s2[t]=q[i-1].y*s2[t-1];
}else
{
s1[t]=s1[t-1]*cos(q[i-1].y)-s2[t-1]*sin(q[i-1].y);
s2[t]=s1[t-1]*sin(q[i-1].y)+s2[t-1]*cos(q[i-1].y);
}
}
}
cout <<fixed << setprecision(3) << s1[t-1] << ' ' << s2[t-1] << endl;
}
return 0;
}
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla