C 解法, 执行用时: 69ms, 内存消耗: 14712K, 提交时间: 2021-11-24 21:38:36

#include<stdio.h>
int main()
{
	long n,p,a[1000][1000],i,j,s=0,k=1;
	scanf("%ld %ld",&n,&p);
	p%=4;
	for(i=0;i<n/2;i++)
	{
		for(j=i;j<n-1-i;j++)
		{
			s+=k++;
			a[i][j]=s;
		}
		for(j=i;j<n-1-i;j++)
		{
			s+=k++;
			a[j][n-1-i]=s;
		}
		for(j=i;j<n-1-i;j++)
		{
			s+=k++;
			a[n-1-i][n-1-j]=s;
		}
		for(j=i;j<n-1-i;j++)
		{
			s+=k++;
			a[n-1-j][i]=s;
		}
	}
	if(n%2)
		a[n/2][n/2]=s+k;
	if(p==1)
		for(i=0;i<n;i++)
			for(j=0;j<n/2;j++)
				s=a[i][j],a[i][j]=a[i][n-1-j],a[i][n-1-j]=s;
	if(p==3)
		for(i=0;i<n;i++)
			for(j=0;j<n/2;j++)
				s=a[j][i],a[j][i]=a[n-1-j][i],a[n-1-j][i]=s;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
			printf("%ld ",a[i][j]);
		printf("\n");
	}
}

C++ 解法, 执行用时: 3ms, 内存消耗: 400K, 提交时间: 2021-11-18 14:27:19

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,x,y;
    scanf("%d%d%d%d",&n,&p,&x,&y);
    p%=4;
    if(p==1) y=n-y+1;
    if(p==3) x=n-x+1;
    int t=min(x,min(y,min(n-x+1,n-y+1)));
    long long ans;
    if(x<=y) ans=1ll*t*(4ll*(n-1)-4ll*t)+10ll*t-4ll*n-3ll+x+y;
    else ans=1ll*t*(4ll*n-4ll*t)+2ll*t+1-x-y;
    printf("%lld\n",ans);
}