제출 #338441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338441		Kerim	Chessboard (IZhO18_chessboard)	C++17	70 / 100	370 ms	1260 KiB

chessboard

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
ll res=1e10;
int n,k;
PII arr[MAXN];
ll cnt[2];
void solve(int x,int t){
	if((n/x)&1){
		cnt[0]=cnt[1]=(n*1LL*n-x*1LL*x)/2;
		cnt[t]+=x*1LL*x;
	}
	else
		cnt[0]=cnt[1]=(n*1LL*n)/2;
	ll ans=cnt[1];
	//cout<<x<<" "<<t<<" "<<cnt[0]<<" "<<cnt[1]<<endl;
	for(int i=0;i<k;i++){
		int a=arr[i].ff/x,b=arr[i].ss/x;
		int col=((a%2)^(b%2)^t);
		if(!col)
			ans++;
		else
			ans--;	
	}
	umin(res,ans);
}
int main(){
   // freopen("file.in", "r", stdin);
    scanf("%d%d",&n,&k);
    for(int i=0;i<k;i++){
    	int x,y,xx,yy;
		scanf("%d%d%d%d",&x,&y,&xx,&yy);
		x--;y--;xx--;yy--;
		assert(x==xx and y==yy);	
		arr[i]=mp(x,y);
    }
    for(int i=1;i<n;i++)
    	if(n%i==0)
    		solve(i,0),solve(i,1);
    printf("%lld\n",res);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

chessboard.cpp: In function 'int main()':
chessboard.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   45 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
chessboard.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   scanf("%d%d%d%d",&x,&y,&xx,&yy);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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