80分代码,wa了一个点
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int,int> PII;
const int N = 105;
int g[N][N];
int m,n,res;
vector<PII> op;//行0列1
void swap(int &a,int &b)
{
int t=a;
a=b;
b=t;
}
void reserve(int y)
{
res++;
op.push_back(make_pair(1,y));
for(int i=1;i<=n/2;i++)
swap(g[i][y],g[n+1-i][y]);
}
void reserve1(int x)
{
res++;
op.push_back(make_pair(0,x));
for(int i=1;i<=m/2;i++)
swap(g[x][i],g[x][m+1-i]);
}
//fx=m+1-i;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%d",&g[i][j]);
//read(g[i][j]);
bool flag=true;
for(int i=1;i<=n/2;i++)
{
if(flag)
for(int j=1;j<=m/2;j++)
{
if(g[i][j]==j&&g[i][m+1-j]==m+1-j)
{
if(g[n+1-i][j]==j&&g[n+1-i][m+1-j]==m+1-j)continue;
//x,fx 1
//x,fx
else if(g[n+1-i][j]==m+1-j&&g[n+1-i][m+1-j]==j)
//x,fx 2
//fx,x
{
g[n+1-i][j]=j;
g[n+1-i][m+1-j]=m+1-j;
reserve(j);
reserve1(i);
reserve(m+1-j);
reserve1(i);
}
else
{
flag=false;
break;
}
}
else if(g[i][j]==m+1-j&&g[i][m+1-j]==j)
{
if(g[n+1-i][j]==m+1-j&&g[n+1-i][m+1-j]==j)
//fx,x 3
//fx,x
{
reserve1(i);
reserve(m+1-j);
reserve(j);
reserve1(i);
}
else if(g[n+1-i][j]==j&&g[n+1-i][m+1-j]==m+1-j)
//fx,x 4
//x,fx
{
reserve(m+1-j);
reserve1(i);
reserve(m+1-j);
reserve1(i);
}
else
{
flag=false;
break;
}
}
else if(g[i][j]==j&&g[i][m+1-j]==j)
//x,x 5
//fx,fx
{
reserve1(i);
reserve(j);
reserve1(i);
}
else if(g[i][j]==m+1-j&&g[i][m+1-j]==m+1-j)
//fx,fx 6
//x,x
{
reserve1(i);
reserve(m+1-j);
reserve1(i);
}
else
{
flag=false;
break;
}
}
else break;
}
if(flag)
{
cout<<"YES"<<endl;
cout<<res<<endl;
for(int i=0;i<res;i++)
{
cout<<op[i].first<<" "<<op[i].second<<endl;
}
}
else
cout<<"NO"<<endl;
return 0;
}