제출 #93138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93138		Makhsud	Chessboard (IZhO18_chessboard)	C++17	39 / 100	144 ms	504 KiB

chessboard

#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll n, k, cnt, x, y, xx, yy;
ll a[3][3];
ll di[50005][5][5];

vector <ll> d;
void subt_3_4_5()
{
	ll mn = INT_MAX, a1, a2;
	for ( int i = 1; i < n; i ++ ){
		if ( n % i == 0 ) {
			d.push_back( i );
		}
	}
	for ( int i = 1; i <= k; i ++ ){
		cin >> x >> y >> xx >> yy;
		for ( auto e: d ) {
			ll r, c;
			r = (x/e) + ( (x%e) && 1 );
			c = (y/e) + ( (y%e) && 1 );
			di[e][r%2][c%2] ++;
		}
	}
	for ( auto e: d ) {
		a1 = a2 = 0;
		for ( int i = 1; i <= (n/e); i ++ ) {
			if ( i % 2 ) {
				a1 += (e*e) * ((n/e)/2);
				a2 += (e*e) * (((n/e)+1)/2);
			}
			else {
				a2 += (e*e) * ((n/e)/2);
				a1 += (e*e) * (((n/e)+1)/2);
			}
		}
		a1 -= di[e][1][0] + di[e][0][1];
		a1 += di[e][0][0] + di[e][1][1];
		a2 += di[e][1][0] + di[e][0][1];
		a2 -= di[e][0][0] + di[e][1][1];
		mn = min ( mn, min ( a1, a2 ) );
	}
	cout << mn;
	exit(0);
}
int main()
{
	cin >> n >> k;
	subt_3_4_5();

}

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