제출 #551891

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
551891		sidon	Chessboard (IZhO18_chessboard)	C++17	100 / 100	390 ms	3532 KiB

chessboard

#include <bits/stdc++.h>
using namespace std;
#define int int64_t

int32_t main() {
	int N, K; cin >> N >> K;
	int ans = N * N;

	array<int, 4> a[K];
	for(auto &[i, j, k, l] : a)
		cin >> i >> j >> k >> l;

	for(int s = 1; s < N; ++s) if(!(N % s)) {

#define c(V) (s * ((V) / (2 * s)) + min(s, (V) % (2 * s)))

		int cost = c(N) * (N - c(N)) + c(N) * (N - c(N));

		for(auto [i, j, k, l] : a) {
			int u = k - i + 1, x = c(k) - c(i - 1);
			int v = l - j + 1, y = c(l) - c(j - 1);

			cost += 2 * (x * y + (u - x) * (v - y)) - u * v;
		}
		ans = min(ans, min(cost, N * N - cost));
	}
	cout << ans;
}

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