Submission #378531

#	Time	Username	Problem	Language	Result	Execution time	Memory
378531		ElaineHuang	Chessboard (IZhO18_chessboard)	C++14	39 / 100	83 ms	512 KiB

chessboard

#include<bits/stdc++.h>
#define debug 0
//#define int long long
using namespace std;
int b[10005][2];//black squares
vector<int> factor;
int N;
int p(int f)
{
	int o=((N/f)*(N/f)/2)*f*f;//o->odd blocks
	int e=N*N-o;//e->even blocks
	if(debug) printf("f%d o%d e%d\n",f,o,e);//
	return min(b[f][1]+e-b[f][0],b[f][0]+o-b[f][1]);//e黑//o黑 
}
signed main()
{
	int K,x1,x2,y1,y2;
	scanf("%d %d",&N,&K);
	int g=(int)sqrt(N);
	factor.clear();
	memset(b,0,sizeof(b));
	for(int i=1;i<=g;i++)
	{
		if(!(N%i))
		{
			factor.push_back(i);
		}
		if(debug) printf("i=%d\n",i);//
	}
	if(debug) printf("%d, g%d\n",factor.size(),g);//
	while(K--)
	{
		scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
		x1--,y1--,x2--,y2--;
		for(int i=0;i<factor.size();i++)
		{
			int a;//determine 0 or 1
			int f;//factor
			f=factor[i];
			a=x1/f+y1/f;
			a%=2;
			b[f][a]++;
			
			if(f==N/f) break;
			if(f==1) continue;
			
			f=N/factor[i];
			a=x1/f+y1/f;
			a%=2;
			b[f][a]++;
		}
	}
	int ans=N*N;
	for(int i=0;i<factor.size();i++)
	{
		int f;
		f=factor[i];//p->paint幾格 
		ans=min(p(f),ans);
		if(f==N/f) break;
		if(f==1) continue;
		f=N/f;
		ans=min(p(f),ans);
	}
	printf("%d\n",ans);
	return 0;
}

Compilation message (stderr)

chessboard.cpp: In function 'int main()':
chessboard.cpp:30:21: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   30 |  if(debug) printf("%d, g%d\n",factor.size(),g);//
      |                    ~^         ~~~~~~~~~~~~~
      |                     |                    |
      |                     int                  std::vector<int>::size_type {aka long unsigned int}
      |                    %ld
chessboard.cpp:35:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   for(int i=0;i<factor.size();i++)
      |               ~^~~~~~~~~~~~~~
chessboard.cpp:54:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for(int i=0;i<factor.size();i++)
      |              ~^~~~~~~~~~~~~~
chessboard.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |  scanf("%d %d",&N,&K);
      |  ~~~~~^~~~~~~~~~~~~~~
chessboard.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |   scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 0 / 8
• Subtask 3: 15 / 15
• Subtask 4: 16 / 16
• Subtask 5: 0 / 23
• Subtask 6: 0 / 30