Submission #524881

#	Time	Username	Problem	Language	Result	Execution time	Memory
524881		boykut	Chessboard (IZhO18_chessboard)	C++14	0 / 100	19 ms	2724 KiB

chessboard

#include <iostream>
#include <vector>

using namespace std;

const int N = 100000;
int x1[N], y1[N], x2[N], y2[N];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n, k;
	cin >> n >> k;
	int mx = 0;
	for (int i = 0; i < k; i++) {
		cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
		mx = max((x2[i] - x1[i] + 1) * (y2[i] - y1[i] + 1), mx);
	}

	vector<int> D;
	for (int i = 1; i < n; i++) {
		if (n % i == 0) D.push_back(i);
	}

	if (n <= 100 && k == 0) {
		int ans = n;
		for (int d : D) {
			int cnt[] = {0, 0};
			int x = 1;
			for (int i = 1; i * d <= n; i++) {
				for (int j = 1; j * d <= n; j++) {
					if (i % 2 == j % 2) cnt[1] += d * d;
					else cnt[0] += d * d;
				}
			}
			ans = min(ans, min(cnt[0], cnt[1]));
		}
		cout << ans << '\n';
	} else if (D.size() == 1 && mx <= 1) {

	}

	return 0;
}

Compilation message (stderr)

chessboard.cpp: In function 'int main()':
chessboard.cpp:30:8: warning: unused variable 'x' [-Wunused-variable]
   30 |    int x = 1;
      |        ^

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