#include #include #include using namespace std; #include #include #include template struct segtree{ using F=function; const F calcfn,updatefn; int n; T defvalue; vectordat; segtree(int n_=0,T defvalue_=numeric_limits::max(), const F calcfn_=[](T a,T b){return a&v) { for(int i=0;i=0;i--)dat[i]=calcfn(dat[i*2+1],dat[i*2+2]); } void update(int i,T a) { i+=n-1; dat[i]=updatefn(dat[i],a); while(i>0) { i=(i-1)/2; dat[i]=calcfn(dat[2*i+1],dat[2*i+2]); } } T query(int a,int b)//[a,b) { int L=(a<0?0:a>n?n:a)+n-1; int R=(b<0?0:b>n?n:b)+n-1; T lret=defvalue,rret=defvalue; for(;L>=1,R>>=1) { if(!(L&1))lret=calcfn(lret,dat[L]); if(!(R&1))rret=calcfn(dat[--R],rret); } return calcfn(lret,rret); } }; main() { int N,Q; cin>>N>>Q; segtree,double> >P( N, make_pair(make_pair(0,0),0), [](pair,double>a,pair,double>b) { return make_pair( make_pair( a.first.first+cos(a.second)*b.first.first-sin(a.second)*b.first.second, a.first.second+sin(a.second)*b.first.first+cos(a.second)*b.first.second ), a.second+b.second ); }, [](pair,double>a,pair,double>b) { return b; } ); vector,double> >A(N); vectorAL(N,1); vectorAth(N,0); for(int i=0;i>t; if(t==0) { int i,x;cin>>i>>x; i--; Ath[i]=x*3.14159265358979323846/180; P.update(i,make_pair(make_pair(AL[i]*cos(Ath[i]),AL[i]*sin(Ath[i])),Ath[i])); } else if(t==1) { int i,x;cin>>i>>x; i--; AL[i]=x; P.update(i,make_pair(make_pair(AL[i]*cos(Ath[i]),AL[i]*sin(Ath[i])),Ath[i])); } else { int i;cin>>i; pairp=P.query(0,i).first; cout<