Submission #488351

#	Time	Username	Problem	Language	Result	Execution time	Memory
488351		levsog2004	Chessboard (IZhO18_chessboard)	C++14	70 / 100	207 ms	2508 KiB

chessboard

#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef  long long  ll;
#define all(x) x.begin(),x.end()
#define al(a,n)  (a,a+n)
#define se second
#define fr first
#define m_p make_pair
const ll N = 1005;
const ll mod = 1000 * 1000 * 1000 + 7;
const ll inf = 1000000009;
ll n, m, k, z, t, x, y, ans, pat,a[N][N];
pair<ll, ll> p[N][N];
vector<pair<ll, ll>> v;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < m; ++i)
	{
		cin >> x >> y >> x >> y;
		v.push_back({ x-1,y-1 });
	}
	ans = inf*inf;
	for (int ii = 1; ii <= n/2; ++ii)
	{
		x = 0;
		y = 0;
		if (n % ii == 0)
		{
			for (int i = 0; i < m; ++i)
			{
				if ((v[i].first / ii + v[i].second / ii) % 2 == 0)
				{
					x++;
				}
				else
					y++;
			}
			k = n / ii;
			k *= k;
			z = k / 2;
			if (k % 2 == 1)
				z++;
			k /= 2;
			ans = min(ans, min(z*ii*ii-x+y,k*ii*ii-y+x));
		}
	}
	cout << ans << endl;
	return 0;
}

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