Help me in solving COPS problem please give hint

My issue

please give hint…

My code

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int t,m,x,y;
	    int m[i];
	    for(int i=0;i<n;i++){
	return 0;

Problem Link: COPS Problem - CodeChef


For each cop can go x*y distance forward and backward .
so u have to check for each cop and visit the houses x*y in forward and backward direction and then return the count of house that is not visited by any cop.