oj.uz

Submission #378765

# Submission time Handle Problem Language Result Execution time Memory
378765 2021-03-17T03:57:49 Z Kevin_Zhang_TW Chessboard (IZhO18_chessboard) C++17
100 / 100
 447 ms 3436 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

#define int ll

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 res = 0;

	ll a = 0, b = 0, c = 0, d = 0;

	auto cal = [&](ll l, ll r, ll ot) -> pair<ll,ll> {
		ll a = 0, b = 0;
		ll lid = l / w +1, rid = r / w - 1;

		if (lid <= rid) {
			ll even = (rid/2) - ((lid-1)/2), odd = rid-lid+1-even;
			a += even * w;
			b += odd * w;
		}

		{
			ll L = l, R = min(r, lid * w - 1);

			if (((1^(l/w))&1))
				a += R-L+1;
			else
				b += R-L+1;
		}
		if (lid-1 != rid+1) {
			ll L = max(l, (rid+1) * w), R = r;

			if (((1^(r/w))&1))
				a += R-L+1;
			else
				b += R-L+1;
		}

//		for (int i = l;i <= r;++i)
//			if (((1^(i/w))&1))
//				++a;
//			else
//				++b;

		if (ot) swap(a, b);
		return {a, b};
	};

	tie(a, b) = cal(x1, x2, y1/w);

	tie(c, d) = cal(y1, y2, y1/w);

	return a * c + b * d;
}
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 'll calgood(ll, ll, ll, ll, ll)':
chessboard.cpp:37:5: warning: unused variable 'res' [-Wunused-variable]
   37 |  ll res = 0;
      |     ^~~
chessboard.cpp: In function 'int32_t main()':
chessboard.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
chessboard.cpp:99:2: note: in expansion of macro 'DE'
   99 |  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 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 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
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2284 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 21 ms 1516 KB Output is correct
4 Correct 19 ms 1772 KB Output is correct
5 Correct 25 ms 2028 KB Output is correct
6 Correct 17 ms 1388 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 17 ms 1388 KB Output is correct
9 Correct 41 ms 3180 KB Output is correct
10 Correct 23 ms 1900 KB Output is correct

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 496 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 496 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 14 ms 1132 KB Output is correct
17 Correct 31 ms 2924 KB Output is correct
18 Correct 43 ms 3436 KB Output is correct
19 Correct 93 ms 3052 KB Output is correct
20 Correct 106 ms 3436 KB Output is correct
21 Correct 30 ms 2924 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 23 ms 1644 KB Output is correct
24 Correct 39 ms 3180 KB Output is correct
25 Correct 5 ms 620 KB Output is correct
26 Correct 27 ms 2156 KB Output is correct
27 Correct 32 ms 2412 KB Output is correct
28 Correct 42 ms 3308 KB Output is correct
29 Correct 13 ms 1388 KB Output is correct
30 Correct 2 ms 364 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2284 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 21 ms 1516 KB Output is correct
4 Correct 19 ms 1772 KB Output is correct
5 Correct 25 ms 2028 KB Output is correct
6 Correct 17 ms 1388 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 17 ms 1388 KB Output is correct
9 Correct 41 ms 3180 KB Output is correct
10 Correct 23 ms 1900 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 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 496 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 14 ms 1132 KB Output is correct
27 Correct 31 ms 2924 KB Output is correct
28 Correct 43 ms 3436 KB Output is correct
29 Correct 93 ms 3052 KB Output is correct
30 Correct 106 ms 3436 KB Output is correct
31 Correct 30 ms 2924 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 23 ms 1644 KB Output is correct
34 Correct 39 ms 3180 KB Output is correct
35 Correct 5 ms 620 KB Output is correct
36 Correct 27 ms 2156 KB Output is correct
37 Correct 32 ms 2412 KB Output is correct
38 Correct 42 ms 3308 KB Output is correct
39 Correct 13 ms 1388 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 90 ms 2924 KB Output is correct
42 Correct 48 ms 3308 KB Output is correct
43 Correct 71 ms 2924 KB Output is correct
44 Correct 47 ms 3180 KB Output is correct
45 Correct 50 ms 3436 KB Output is correct
46 Correct 101 ms 3180 KB Output is correct
47 Correct 39 ms 3052 KB Output is correct
48 Correct 54 ms 3052 KB Output is correct
49 Correct 44 ms 2924 KB Output is correct
50 Correct 371 ms 3180 KB Output is correct
51 Correct 404 ms 3308 KB Output is correct
52 Correct 393 ms 3180 KB Output is correct
53 Correct 387 ms 3308 KB Output is correct
54 Correct 365 ms 3072 KB Output is correct
55 Correct 401 ms 3436 KB Output is correct
56 Correct 349 ms 3192 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 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 32 ms 2284 KB Output is correct
10 Correct 8 ms 876 KB Output is correct
11 Correct 21 ms 1516 KB Output is correct
12 Correct 19 ms 1772 KB Output is correct
13 Correct 25 ms 2028 KB Output is correct
14 Correct 17 ms 1388 KB Output is correct
15 Correct 4 ms 620 KB Output is correct
16 Correct 17 ms 1388 KB Output is correct
17 Correct 41 ms 3180 KB Output is correct
18 Correct 23 ms 1900 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 496 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 14 ms 1132 KB Output is correct
35 Correct 31 ms 2924 KB Output is correct
36 Correct 43 ms 3436 KB Output is correct
37 Correct 93 ms 3052 KB Output is correct
38 Correct 106 ms 3436 KB Output is correct
39 Correct 30 ms 2924 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 23 ms 1644 KB Output is correct
42 Correct 39 ms 3180 KB Output is correct
43 Correct 5 ms 620 KB Output is correct
44 Correct 27 ms 2156 KB Output is correct
45 Correct 32 ms 2412 KB Output is correct
46 Correct 42 ms 3308 KB Output is correct
47 Correct 13 ms 1388 KB Output is correct
48 Correct 2 ms 364 KB Output is correct
49 Correct 90 ms 2924 KB Output is correct
50 Correct 48 ms 3308 KB Output is correct
51 Correct 71 ms 2924 KB Output is correct
52 Correct 47 ms 3180 KB Output is correct
53 Correct 50 ms 3436 KB Output is correct
54 Correct 101 ms 3180 KB Output is correct
55 Correct 39 ms 3052 KB Output is correct
56 Correct 54 ms 3052 KB Output is correct
57 Correct 44 ms 2924 KB Output is correct
58 Correct 371 ms 3180 KB Output is correct
59 Correct 404 ms 3308 KB Output is correct
60 Correct 393 ms 3180 KB Output is correct
61 Correct 387 ms 3308 KB Output is correct
62 Correct 365 ms 3072 KB Output is correct
63 Correct 401 ms 3436 KB Output is correct
64 Correct 349 ms 3192 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 436 ms 3308 KB Output is correct
68 Correct 423 ms 3180 KB Output is correct
69 Correct 361 ms 2924 KB Output is correct
70 Correct 391 ms 3180 KB Output is correct
71 Correct 394 ms 3052 KB Output is correct
72 Correct 394 ms 3052 KB Output is correct
73 Correct 389 ms 2924 KB Output is correct
74 Correct 415 ms 3180 KB Output is correct
75 Correct 403 ms 3052 KB Output is correct
76 Correct 426 ms 3436 KB Output is correct
77 Correct 90 ms 3436 KB Output is correct
78 Correct 49 ms 3180 KB Output is correct
79 Correct 72 ms 2924 KB Output is correct
80 Correct 77 ms 3180 KB Output is correct
81 Correct 67 ms 2924 KB Output is correct
82 Correct 63 ms 3308 KB Output is correct
83 Correct 53 ms 3052 KB Output is correct
84 Correct 263 ms 3308 KB Output is correct
85 Correct 444 ms 3436 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 447 ms 3436 KB Output is correct
89 Correct 86 ms 876 KB Output is correct
90 Correct 1 ms 364 KB Output is correct