Luogu P2129 L国的战斗续之多路出击 模拟

诡异而冗长的名字下一般没什么难题

坐标的本质是与原点的相对位置关系，所以改变全部坐标只要改变坐标系就好了。

#include<iostream> 
#include<cstdio>
using namespace std;
typedef long long ll;

const ll Maxn = 5e5+10;

ll x[Maxn],y[Maxn],ox,oy,xt,yt,n,m,p[Maxn],q[Maxn];
char opt[Maxn];

void read(ll& a){
    a = 0;char c = getchar(),l = c;
    while(c < '0'||c > '9')l = c,c = getchar();
    while('0' <= c&&c <= '9')a = a*10+c-'0',c = getchar();
    if(l == '-')a = -a;
}

void read(ll& a,ll& b){
    read(a),read(b);
}

int main(){
    xt = yt = 1,ox = oy = 0;
    read(n,m);
    for(ll i = 1;i <= n;i++)read(x[i],y[i]);
    for(int i = 1;i <= m;i++){
        cin >> opt[i];
        if(opt[i] == 'm')read(p[i],q[i]);
    }
    while(m){
        if(opt[m] == 'x')xt = -xt;
        else if(opt[m] == 'y')yt = -yt;
        else ox -= xt*p[m],oy -= yt*q[m];
        m--;
    }
    for(ll i = 1;i <= n;i++)printf("%lld %lld
",xt*(x[i]-ox),yt*(y[i]-oy));
return 0;
}