oj.uz

Submission #378701

# Submission time Handle Problem Language Result Execution time Memory
378701 2021-03-17T03:23:22 Z Kevin_Zhang_TW Chessboard (IZhO18_chessboard) C++17
39 / 100
 213 ms 2300 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 300010;

int n, k;
vector<tuple<int,int,int,int>> subr;

ll calgood(int w, int x1, int y1, int x2, int y2) {

	ll res = 0;
	for (int i = x1;i <= x2;++i)
		for (int j = y1;j <= y2;++j) {
			int need = (1^(i/w) ^ (j/w))&1;
			res += need;
		}
	return res;

}
ll calcost(int wid) {
	ll res = calgood(wid, 0, 0, n-1, n-1);
	for (auto [x1, y1, x2, y2] : subr) {
		ll area = 1ll * (x2-x1+1) * (y2-y1+1);
		ll good = calgood(wid, x1, y1, x2, y2);
		ll bad = area - good;
		res -= good;
		res += bad;
	}

	return min(res, 1ll * n * n - res);
}
int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> k;
	DE(n, k);

	if (n > 1000) return -1;
	subr.resize(k);
	for (auto &[x1, y1, x2, y2] : subr)
		cin >> x1 >> y1 >> x2 >> y2, --x1, --x2, --y1, --y2;

	ll res = 1ll * n * n;

	for (int i = 1;i < n;++i)
		if (n % i == 0)
			chmin(res, calcost(i));

	cout << res << '\n';
}

Compilation message

chessboard.cpp: In function 'int32_t main()':
chessboard.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
chessboard.cpp:49:2: note: in expansion of macro 'DE'
   49 |  DE(n, k);
      |  ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 364 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 27 ms 1004 KB Output is correct
17 Correct 36 ms 1980 KB Output is correct
18 Correct 55 ms 2300 KB Output is correct
19 Correct 207 ms 2048 KB Output is correct
20 Correct 213 ms 2156 KB Output is correct
21 Correct 33 ms 1900 KB Output is correct
22 Correct 91 ms 492 KB Output is correct
23 Correct 60 ms 1396 KB Output is correct
24 Correct 49 ms 2028 KB Output is correct
25 Correct 43 ms 620 KB Output is correct
26 Correct 41 ms 1516 KB Output is correct
27 Correct 54 ms 1644 KB Output is correct
28 Correct 50 ms 2028 KB Output is correct
29 Correct 17 ms 1132 KB Output is correct
30 Correct 19 ms 492 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 364 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Runtime error 1 ms 364 KB Execution failed because the return code was nonzero
10 Halted 0 ms 0 KB -