2019.08.10考试报告

题都没改完，所以没有报告

 2019.08.11晚上8点：

终于改完T3了，酸爽啊～～～

考试的心态，做题出现的问题好像没啥记得了。

把坑我的T3代码粘一下吧

#include<bits/stdc++.h>
#define AA cout<<"Alita"<<endl
#define DD cout<<"Dybala"<<endl
#define m(a) memset(a,0,sizeof(a))
using namespace std;
const int N=2050;
int pre,tot,n,m,Q,t[N][N],head[N],f[N*N][4],w[N*N];
int a[N],A[N],b[N],B[N],c[N],C[N],d[N],D[N];
inline int read()
{
        int sum,k=1;char s;
        while(s=getchar(),s<'0'||s>'9') if(s=='-') k=-1;sum=s-'0';
        while(s=getchar(),s>='0'&&s<='9') sum=sum*10+s-'0';
        return k*sum;
}
int get(int x,int y) 
{
        for(int i=0;i<=3;i++) if(f[x][i]==y) return i;
        return 0;
}
int change(int x){return (x+2)%4;}
int search(int x,int y)
{
        if(x*y==0) return t[x][y];
        int ans=f[head[x]][1];
        for(int sum=0,i=f[head[x]][1],j=head[x],tmp;sum<y-1;sum++)
        {
                tmp=i;
                i=f[i][change(get(i,j))];
                ans=i;
                j=tmp;
        }
        return ans;
}
signed main()
{
        //freopen("1.in","r",stdin);
        //freopen("1.out","w",stdout);
        n=read();m=read();Q=read();
        for(int i=0;i<=n+1;i++)
        {
                for(int j=0;j<=m+1;j++)
                {
                        t[i][j]=++tot;
                }
                head[i]=t[i][0];
        }
        for(int i=0;i<=n+1;i++)
        {
                for(int j=0;j<=m+1;j++)
                {
                        if(i) f[t[i][j]][0]=t[i-1][j];
                        f[t[i][j]][1]=t[i][j+1];
                        f[t[i][j]][2]=t[i+1][j];
                        if(j) f[t[i][j]][3]=t[i][j-1];
                }
        }
        for(register int i=1;i<=n;++i)
        {
                for(register int j=1;j<=m;++j)
                {
                        w[t[i][j]]=read();
                }
        }
        for(register int q=1,x,y,z;q<=Q;q++)
        {
                x=read();y=read();z=read();
                if(z==1) continue;
                a[1]=search(x,y); a[2]=search(x,y+1);
                A[1]=search(x-1,y); A[2]=search(x-1,y+1);
                c[1]=search(x+z-1,y); c[2]=search(x+z-1,y+1);
                C[1]=search(x+z,y); C[2]=search(x+z,y+1);
                for(int i=y+2;i<=y+z-1;i++)
                {
                        a[i-y+1]=f[a[i-y]][change(get(a[i-y],a[i-y-1]))];
                        A[i-y+1]=f[a[i-y+1]][(get(a[i-y+1],a[i-y])+1)%4];
                        c[i-y+1]=f[c[i-y]][change(get(c[i-y],c[i-y-1]))];
                        C[i-y+1]=f[c[i-y+1]][(get(c[i-y+1],c[i-y])+3)%4];
                }
                b[1]=search(x,y+z-1); b[2]=search(x+1,y+z-1);
                B[1]=search(x,y+z); B[2]=search(x+1,y+z);
                d[1]=search(x,y); d[2]=search(x+1,y);
                D[1]=search(x,y-1); D[2]=search(x+1,y-1);
                for(int i=x+2;i<=x+z-1;i++)
                {
                        b[i-x+1]=f[b[i-x]][change(get(b[i-x],b[i-x-1]))];
                        B[i-x+1]=f[b[i-x+1]][(get(b[i-x+1],b[i-x])+1)%4];
                        d[i-x+1]=f[d[i-x]][change(get(d[i-x],d[i-x-1]))];
                        D[i-x+1]=f[d[i-x+1]][(get(d[i-x+1],d[i-x])+3)%4];
                }
                for(int i=1;i<=z;i++) //外部
                {
                        f[A[i]][get(A[i],a[i])]=d[z-i+1];
                        f[B[i]][get(B[i],b[i])]=a[i];
                        f[C[i]][get(C[i],c[i])]=b[z-i+1];
                        f[D[i]][get(D[i],d[i])]=c[i];
                        f[a[i]][get(a[i],A[i])]=B[i];
                        f[b[i]][get(b[i],B[i])]=C[z-i+1];
                        f[c[i]][get(c[i],C[i])]=D[i];
                        f[d[i]][get(d[i],D[i])]=A[z-i+1];
                }
        }
        for(int i=1,x,y;i<=n;i++)
        {
                x=head[i],y=f[x][1];
                for(int j=1,tmp;j<=m;j++)
                {
                        printf("%d ",w[y]);
                        tmp=y;
                        y=f[y][change(get(y,x))];
                        x=tmp;
                }
                puts("");
        }
        return 0;
}

emmmmm，明天考好点吧