제출 #93109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93109		Makhsud	Chessboard (IZhO18_chessboard)	C++17	8 / 100	99 ms	376 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];

void subt2()
{
	ll c1, c2;
	c1 = c2 = 0;
	for ( int i = 1; i <= k; i ++ ) {
		cin >> x >> y >> xx >> yy;
		a[x%2][y%2] ++;
	}
	c1 = (n*n)/2;
	c2 =  c1 + 1;

	c1 = c1 - ( a[1][0] + a[0][1] );
	c1 = c1 + ( a[1][1] + a[0][0] );

	c2 = c2 - ( a[1][1] + a[0][0] );
	c2 = c2 + ( a[1][0] + a[0][1] );

	cout << min( c1, c2 );
	exit(0);
}

int main()
{
	cin >> n >> k;
	for ( int i = 1; i <= n; i ++ ) {
		if ( n % i == 0 ) cnt ++;
	}
	if ( cnt == 2 ) subt2();
	cout << (n*n)/2;
}

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