1 solutions
-
0
Guest MOD
-
2
代码:
#include<bits/stdc++.h> typedef long long ll; using namespace std; const int N=1010; int ma[N][N]; int main(){ cin.sync_with_stdio(false); ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); int n,m,k; cin>>n>>m>>k; memset(ma,0,sizeof(ma)); for(int i=0;i<m;i++){ int x,y; cin>>x>>y; x+=2; y+=2; ma[x][y]++; ma[x+1][y+1]++; ma[x+1][y-1]++; ma[x+1][y]++; ma[x+2][y]++; ma[x][y+1]++; ma[x][y+2]++; ma[x][y-2]++; ma[x][y-1]++; ma[x-1][y-1]++; ma[x-1][y+1]++; ma[x-1][y]++; ma[x-2][y]++; } for(int i=0;i<k;i++){ int x,y; cin>>x>>y; x+=2; y+=2; for(int j=x-2;j<=x+2;j++){ for(int l=y-2;l<=y+2;l++){ ma[j][l]++; } } } int s=0; for(int i = 1+2;i <= n+2;i++){ for(int j=1+2;j<=n+2;j++){ if(ma[i][j]==0)s++; } } cout<<s<<endl; return 0; }
- 1
Information
- ID
- 417
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 23
- Accepted
- 14
- Uploaded By