JZOJ5281. 【NOIP提高组模拟A组8.15】钦点 十字链表

经典的十字链表，暴力搞搞就可以了。

#include<iostream>  
#include<deque>  
#include<cstring>
#include<cstdio>
#include<algorithm> 
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e3+5;
const int M=1e7+5;   
struct nod
{
    int l,r;
}a[N][N];
struct node
{
    int x,y;
    node(){}
    node(int x,int y):x(x),y(y){}
}L[N][N],R[N][N],U[N][N],D[N][N];
int n,m,q;
node now1,swp1,now2,swp2;
node topleft1,topleft2;
char s[M],s1[M];
int main()
{
    scanf("%d%d%d",&n,&m,&q);
    int tot=0;
    fo(i,1,n)
    {
        fo(j,1,m)
        {
            scanf("%s",s1+1);
            int len=strlen(s1+1);
            a[i][j].l=tot+1,a[i][j].r=tot+len;
            fo(i,1,len)s[++tot]=s1[i];
        }
    }
    fo(i,0,n+1)
    fo(j,0,m+1)
    {
        L[i][j]=node(i,j-1);
        R[i][j]=node(i,j+1);
        U[i][j]=node(i-1,j);
        D[i][j]=node(i+1,j);
    }
    while (q--)
    {
        int a,b,c,d,h,w;
        scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&h,&w);
        topleft1=node(a,0);topleft2=node(c,0);
        fo(i,1,b)topleft1=R[topleft1.x][topleft1.y];
        fo(i,1,d)topleft2=R[topleft2.x][topleft2.y];
        now1=topleft1,now2=topleft2;
        fo(i,1,w)
        {
            swp1=U[now1.x][now1.y];
            swp2=U[now2.x][now2.y];
            U[now1.x][now1.y]=swp2;
            U[now2.x][now2.y]=swp1;
            D[swp1.x][swp1.y]=now2;
            D[swp2.x][swp2.y]=now1;
            if (i!=w) now1=R[now1.x][now1.y],now2=R[now2.x][now2.y];  
        }
        for (int i=1;i<=h;i++) {  
            swp1=R[now1.x][now1.y];swp2=R[now2.x][now2.y];  
            R[now1.x][now1.y]=swp2;R[now2.x][now2.y]=swp1;  
            L[swp1.x][swp1.y]=now2;L[swp2.x][swp2.y]=now1;  
            if (i!=h) now1=D[now1.x][now1.y],now2=D[now2.x][now2.y];  
        }  
        for (int i=1;i<=w;i++) {  
            swp1=D[now1.x][now1.y];swp2=D[now2.x][now2.y];  
            D[now1.x][now1.y]=swp2;D[now2.x][now2.y]=swp1;  
            U[swp1.x][swp1.y]=now2;U[swp2.x][swp2.y]=now1;  
            if (i!=w) now1=L[now1.x][now1.y],now2=L[now2.x][now2.y];  
        }  
        for (int i=1;i<=h;i++) {  
            swp1=L[now1.x][now1.y];swp2=L[now2.x][now2.y];  
            L[now1.x][now1.y]=swp2;L[now2.x][now2.y]=swp1;  
            R[swp1.x][swp1.y]=now2;R[swp2.x][swp2.y]=now1;  
            if (i!=h) now1=U[now1.x][now1.y],now2=U[now2.x][now2.y];  
        }  
    }
    fo(i,1,n)
    {
        now1=node(i,0);
        fo(j,1,m)
        {
            now1=R[now1.x][now1.y];
            fo(k,a[now1.x][now1.y].l,a[now1.x][now1.y].r)printf("%c",s[k]);
            printf(" ");
        }
        printf("\n");
    }
}