Robot Arm CodeForces - 618E

点击打开链接

很巧妙的一道题 每个区间只维护右端点相对于左端点的相对位置 而不是相对于原点

这样利用线段树维护区间的功能 使总区间[1,n]维护答案

#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0)

struct node
{
    int l;
    int r;
    double x;
    double y;
    double a;
};

node tree[1200010];
int n;

void pushup(int cur)
{
    double r,a;
    r=sqrt(tree[2*cur+1].x*tree[2*cur+1].x+tree[2*cur+1].y*tree[2*cur+1].y);
    a=atan2(tree[2*cur+1].y,tree[2*cur+1].x);
    tree[cur].x=tree[2*cur].x+r*cos(tree[2*cur].a+a);
    tree[cur].y=tree[2*cur].y+r*sin(tree[2*cur].a+a);
    tree[cur].a=tree[2*cur].a+tree[2*cur+1].a;
    return;
}

void build(int l,int r,int cur)
{
    int m;
    tree[cur].l=l;
    tree[cur].r=r;
    if(l+1==r)
    {
        tree[cur].x=1.0;
        tree[cur].y=0.0;
        tree[cur].a=0.0;
        return;
    }
    m=(l+r)/2;
    build(l,m,2*cur);
    build(m,r,2*cur+1);
    pushup(cur);
    return;
}

void update(int tar,double valr,double vala,int cur)
{
    double r,a;
    if(tree[cur].l+1==tree[cur].r)
    {
        r=sqrt(tree[cur].x*tree[cur].x+tree[cur].y*tree[cur].y);
        a=atan2(tree[cur].y,tree[cur].x);
        r+=valr,a+=vala;
        tree[cur].x=r*cos(a);
        tree[cur].y=r*sin(a);
        tree[cur].a=a;
        return;
    }
    if(tar<=tree[2*cur].r) update(tar,valr,vala,2*cur);
    else update(tar,valr,vala,2*cur+1);
    pushup(cur);
    return;
}

int main()
{
    double val;
    int q,op,tar;
    while(scanf("%d%d",&n,&q)!=EOF)
    {
        build(0,n,1);
        while(q--)
        {
            scanf("%d%d%lf",&op,&tar,&val);
            if(op==1) update(tar,val,0.0,1);
            else update(tar,0.0,(1.0-val/360.0)*2*PI,1);
            printf("%.10f %.10f\n",tree[1].x,tree[1].y);
        }
    }
    return 0;
}