Submission #503501

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
int N,K,X[10],Y[10];
int board[2001][2001];
void compress(int *x,vector<int> &v) {
	for(int i=0;i<K;i++) {
		v.push_back(x[i]);
		if(x[i]>1) v.push_back(x[i]-1);
		if(x[i]<N) v.push_back(x[i]+1);
	}
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
}
int main() {
	scanf("%d %d",&N,&K);
	for(int i=0;i<K;i++) {
		scanf("%d %d",&Y[i],&X[i]);
	}
	vector<int> vx,vy;
	compress(X,vx);
	compress(Y,vy);
	for(int i=1;i<=N;i++) {
		for(int j=1;j<=N;j++) {
			if((i+j)&1) board[i][j]=-1; else board[i][j]=1;
		}
	}
	for(int i=0;i<K;i++) {
		board[Y[i]][X[i]]*=-1;
	}
	for(int i=1;i<=N;i++) {
		for(int j=2;j<=N;j++) {
			board[i][j]+=board[i][j-1];
		}
	}
	for(int i=1;i<=N;i++) {
		for(int j=2;j<=N;j++) {
			board[j][i]+=board[j-1][i];
		}
	}
	int ans=0;
	for(int i=0;i<vx.size();i++) {
		for(int j=0;j<vy.size();j++) {
			for(int k=i;k<vx.size();k++) {
				for(int l=j;l<vy.size();l++) {
					int x1=vx[i],y1=vy[j],x2=vx[k],y2=vy[l];
					int sum=board[y2][x2];
					sum-=board[y1-1][x2];
					sum-=board[y2][x1-1];
					sum+=board[y1-1][x1-1];
					ans=max(ans,abs(sum));
				}
			}
		}
	}
	printf("%d\n",ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&N,&K);
                      ^
./Main.cpp:20:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&Y[i],&X[i]);
                             ^

Judge Result