求助!#2 WA P1789
查看原帖
求助!#2 WA P1789
1278637
maple_mustard楼主2024/8/21 12:52
#include<iostream>
#include<cstring>
using namespace std;
int n,m,k,ans=0;
bool map[105][105];
int main(){
    cin>>n>>m>>k;
    int x,y;
    memset(map,0,sizeof(map));
    for(int i=0;i<m;i++){
        cin>>x>>y;
        x+=2;y+=2;
		map[x][y]=true;
		map[x+1][y]=true;
        map[x+1][y+1]=true;
        map[x+1][y-1]=true;
		map[x-1][y]=true;
        map[x-1][y+1]=true;
		map[x-1][y-1]=true;
        map[x][y+1]=true;
        map[x][y-1]=true;
        map[x+2][y]=true;
        map[y][y+2]=true;
        map[x-2][y]=true;
        map[x][y-2]=true;
    }
    int o,p;
    for(int i=1;i<=k;i++){
        cin>>o>>p;
        o+=2;p+=2;
        map[o-2][p-2]=1;
        map[o-2][p-1]=1;
        map[o-2][p]=1;
        map[o-2][p+1]=1;
        map[o-2][p+2]=1;
        map[o-1][p-2]=1;
        map[o-1][p-1]=1;
        map[o-1][p]=1;
        map[o-1][p+1]=1;
        map[o-1][p+2]=1;
        map[o][p-2]=1;
        map[o][p-1]=1;
        map[o][p]=1;
        map[o][p+1]=1;
        map[o][p+2]=1;
        map[o+1][p-2]=1;
        map[o+1][p-1]=1;
        map[o+1][p]=1;
        map[o+1][p+1]=1;
        map[o+1][p+2]=1;
        map[o+2][p-2]=1;
        map[o+2][p-1]=1;
        map[o+2][p]=1;
        map[o+2][p+1]=1;
        map[o+2][p+2]=1;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(map[i+2][j+2]==0){
            	ans++;
			}
        }
    }
    cout<<ans;
    return 0;
}
2024/8/21 12:52
加载中...