1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 | #include<iostream> using namespace std; int n,m,k; int x,y; int a[101][101]={0}; int sum=0; int clamp(int p) { if(p<1) p=1; else if(p>n) p=n; return p; } void light(int distance) { for(int i=clamp(x-2);i<=clamp(x+2);i++) { for(int j=clamp(y-2);j<=clamp(y+2);j++) { if( abs(i-x)+abs(j-y) <=distance) a[i][j]=1; } } } int main() { cin>>n>>m>>k; for (int i = 1; i <= m; i++) { cin>>x>>y; light(2); } for (int i = 1; i <= k; i++) { cin>>x>>y; light(4); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if(a[i][j]==0) sum++; } } cout<<sum; system("pause" ); return 0; } |