求hack
查看原帖
求hack
1280618
An_OIer楼主2024/8/31 14:28
#include <bits/stdc++.h>
using namespace std;
long long n,m,k,a[1001][1001],x,y,ans=0;
long long x1[20]= {0,-1,-2,1,2,0,0,0,0,-1,1,1,-1},
                  lalalalalala[20]= {0,0,0,0,0,-1,1,-2,2,-1,-1,1,1},
                          x2[30]= {0,-2,-2,-2,-2,-2,-1,-1,-1,-1,-1,0,0,0,0,0,1,1,1,1,1,2,2,2,2,2},
                                  y2[30]= {0,-2,-1,0,1,2,-2,-1,0,1,2,-2,-1,0,1,2,-2,-1,0,1,2,-2,-1,0,1,2};
int main()
{
	cin>>n>>m>>k;
	for(long long i=1; i<=m; i++)
	{
		cin>>x>>y;
		long long h1,h2;
		for(long long j=0; j<=12; j++)
		{
			h1=x+x1[j];
			h2=y+lalalalalala[j];
			if(h1<=n&&h1>=1&&h2<=n&&h2>=1)
			{
				a[h1][h2]=1;
			}
		}
	}
	for(long long i=1; i<=k; i++)
	{
		cin>>x>>y;
		long long h1,h2;
		for(long long j=0; j<=25; j++)
		{
			h1=x+x2[j];
			h2=y+y2[j];
			if(h1<=n&&h1>=1&&h2<=n&&h2>=1)
			{
				a[h1][h2]=1;
			}
		}
	}
	for(long long i=1; i<=n; i++)
	{
		for(long long j=1; j<=n; j++)
		{
			if(a[i][j])
			{
				ans++;
			}
		}
	}
	for(long long i=1; i<=n; i++)
	{
		for(long long j=1; j<=n; j++)
		{
			cout<<a[i][j];
		}
		cout<<"\n";
	}
	cout<<n*n-ans;
}
2024/8/31 14:28
加载中...