为什么只有60分

#include<bits/stdc++.h>
using namespace std;
struct huoba{
    int x,y;
};
struct yingshi{
    int x,y;
};
int main(){
    int n,m,k,c=0;
    int s[1000][1000];
    huoba x[100]={0};
    yingshi y[100];
    cin>>n>>m>>k;
    for(int i=0;i<m;i++){
        cin>>x[i].x>>x[i].y;
    }
    for(int i=0;i<k;i++){
        cin>>y[i].x>>y[i].y;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;i++){
            for(int p=0;p<m;p++){
                if(i==x[p].x&&j==x[p].y){
                    s[j+2][i]=1;
		            s[j][i+2]=1;
		            s[j-2][i]=1;
		            s[j][i-2]=1;
		            s[j+1][i]=1;
		            s[j+1][i+1]=1;
		            s[j+1][i-1]=1;
		            s[j][i+1]=1;
	            	s[j][i]=1;
		            s[j][i-1]=1;
	                s[j-1][i]=1;
		            s[j-1][i+1]=1;
		            s[j-1][i-1]=1;
                }
            }
            for(int p=0;p<k;p++){
                if(i==y[p].x&&j==y[p].y){
                    s[j-2][i-2]=1;
	            	s[j-2][i-1]=1;
            		s[j-2][i]=1;
            		s[j-2][i+1]=1;
	            	s[j-2][i+2]=1;
		
	            	s[j-1][i-2]=1;
	            	s[j-1][i-1]=1;
	            	s[j-1][i]=1;
	            	s[j-1][i+1]=1;
	            	s[j-1][i+2]=1;
		
	            	s[j][i-2]=1;
	            	s[j][i-1]=1;
	            	s[j][i]=1;
	            	s[j][i+1]=1;
	            	s[j][i+2]=1;
		
	            	s[j+1][i-2]=1;
	            	s[j+1][i-1]=1;
	            	s[j+1][i]=1;
	            	s[j+1][i+1]=1;
	            	s[j+1][i+2]=1;
		
		
        	    	s[j+2][i-2]=1;
            		s[j+2][i-1]=1;
            		s[j+2][i]=1;
	            	s[j+2][i+1]=1;
            		s[j+2][i+2]=1;
                }
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(s[i][j]==0){
                c++;
            }
        }
    }
    cout<<c;
    return 0;
}