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

倒搜模拟，矩阵乘法，结束

#include<bits/stdc++.h>
using namespace std;
const int maxn=500005,INF=2000000000;
int X[maxn],Y[maxn],a[maxn],b[maxn];
char cmd[maxn];
int n,M,p=0,q=0,curx=1,cury=1;
char c;
int main() {
    cin>>n>>M;
    for(int i=1; i<=n; i++) cin>>X[i]>>Y[i];
    for(int i=0; i<M; i++) {
        c=getchar();
        while(c!='x'&&c!='m'&&c!='y') c=getchar();
        cmd[i]=c;
        if(c=='m') cin>>a[i]>>b[i];
    }
    for(int i=M-1; i>=0; i--) {
        if(cmd[i]=='x') p=-p,curx=-curx;
        else if(cmd[i]=='y') q=-q,cury=-cury;
        else p+=a[i],q+=b[i];
    }
    for(int i=1; i<=n; i++) printf("%d %d
",X[i]*curx+p,Y[i]*cury+q);
    return 0;
}