P1789显示WA,求大佬帮助蒟蒻
  • 板块题目总版
  • 楼主Linktux
  • 当前回复0
  • 已保存回复0
  • 发布时间2023/11/11 13:21
  • 上次更新2023/11/11 15:28:04
查看原帖
P1789显示WA,求大佬帮助蒟蒻
1185284
Linktux楼主2023/11/11 13:21
#include <iostream>
#include <cstring>
using namespace std;
int main(){
    int n,m,k,x,y,cnt=0;
    cin>>n>>m>>k;
    bool a[n+1][n+1];
    memset(a,false,sizeof(a));
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        a[x-2][y]=a[x-1][y]=a[x][y]=a[x+1][y]=a[x+2][y]=a[x][y-2]=a[x][y-1]=a[x][y+1]=a[x][y+1]=a[x-1][y-1]=a[x+1][y-1]=a[x-1][y+1]=a[x+1][y+1]=true;
    }
    for(int i=1;i<=k;i++){
        cin>>x>>y;
        a[x-2][y-2]=a[x-2][y-1]=a[x-2][y]=a[x-2][y+1]=a[x-2][y+2]=a[x-1][y-2]=a[x-1][y-1]=a[x-1][y]=a[x-1][y+1]=a[x-1][y+2]=a[x][y-2]=a[x][y-1]=a[x][y]=a[x][y+1]=a[x][y+2]=a[x+1][y-2]=a[x+1][y-1]=a[x+1][y]=a[x+1][y+1]=a[x+1][y+2]=a[x+2][y-2]=a[x+2][y-1]=a[x+2][y]=a[x+2][y+1]=a[x+2][y+2]=true;
    }
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(!a[i][j])cnt++;
    cout<<cnt<<endl;
    return 0;
}
2023/11/11 13:21
加载中...