oj.uz

답안 #572513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572513 2022-06-04T14:58:27 Z vovamr Chessboard (IZhO18_chessboard) C++17
47 / 100
 93 ms 3788 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n, m;
	cin >> n >> m;
	ve<pair<pii,pii>> a(m);
	for (auto &[a1, a2] : a) {
		auto &[x1, y1] = a1;
		auto &[x2, y2] = a2;
		cin >> x1 >> y1 >> x2 >> y2;
		--x1, --y1, --x2, --y2;
	}

	auto even = [](ll l, ll r) { if (l > r) {return 0ll;} return r / 2 - (l + 1) / 2 + 1; };
	auto odd = [&even](ll l, ll r) { if (l > r) {return 0ll;} return r - l + 1 - even(l, r); };

	auto run = [&](int d) {

		ll ans1 = 0, ans2 = 0;
		for (auto &[a1, a2] : a) {
			auto &[x1, y1] = a1;
			auto &[x2, y2] = a2;

			ll evx, odx, evy, ody;
			{
				ll mn = x1 / d, mx = x2 / d;
				if (mn == mx) {
					if (mn & 1) evx = 0, odx = x2 - x1 + 1;
					else odx = 0, evx = x2 - x1 + 1;
				}
				else {
					evx = odx = 0;
					evx += d * even(mn + 1, mx - 1);
					odx += d * odd(mn + 1, mx - 1);
					
					if (mn & 1) odx += (mn + 1) * d - x1;
					if (mx & 1) odx += x2 - mx * d + 1;

					if (mn & 1 ^ 1) evx += (mn + 1) * d - x1;
					if (mx & 1 ^ 1) evx += x2 - mx * d + 1;
				}
			}
			{
				ll mn = y1 / d, mx = y2 / d;
				if (mn == mx) {
					if (mn & 1) evy = 0, ody = y2 - y1 + 1;
					else ody = 0, evy = y2 - y1 + 1;
				}
				else {
					evy = ody = 0;
					evy += d * even(mn + 1, mx - 1);
					ody += d * odd(mn + 1, mx - 1);
					
					if (mn & 1) ody += (mn + 1) * d - y1;
					if (mx & 1) ody += y2 - mx * d + 1;

					if (mn & 1 ^ 1) evy += (mn + 1) * d - y1;
					if (mx & 1 ^ 1) evy += y2 - mx * d + 1;
				}
			}

			// corner is white
			ans1 += evx * evy + odx * ody;
			ans1 -= (evx * ody + evy * odx);

			// corner is black
			ans2 += evx * ody + evy * odx;
			ans2 -= (evx * evy + odx * ody);
		}
		ll e = even(1, n / d), o = odd(1, n / d);
		ans1 += d * d * (e * o + o * e);
		ans2 += d * d * (e * e + o * o);
		return min(ans1, ans2);
	};

	ll res = inf;
	for (int d = 1; d * d <= n; ++d) {
		if (n % d) continue;
		chmin(res, run(d));
		if (d * d != n && d > 1) chmin(res, run(n / d));
	}
	cout << res;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Compilation message

chessboard.cpp: In lambda function:
chessboard.cpp:59:13: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   59 |      if (mn & 1 ^ 1) evx += (mn + 1) * d - x1;
      |          ~~~^~~
chessboard.cpp:60:13: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   60 |      if (mx & 1 ^ 1) evx += x2 - mx * d + 1;
      |          ~~~^~~
chessboard.cpp:77:13: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   77 |      if (mn & 1 ^ 1) evy += (mn + 1) * d - y1;
      |          ~~~^~~
chessboard.cpp:78:13: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   78 |      if (mx & 1 ^ 1) evy += y2 - mx * d + 1;
      |          ~~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 1236 KB Output is correct
2 Correct 9 ms 852 KB Output is correct
3 Correct 15 ms 1832 KB Output is correct
4 Correct 19 ms 1868 KB Output is correct
5 Correct 18 ms 2452 KB Output is correct
6 Correct 12 ms 1632 KB Output is correct
7 Correct 3 ms 556 KB Output is correct
8 Correct 12 ms 1620 KB Output is correct
9 Correct 30 ms 3788 KB Output is correct
10 Correct 18 ms 2264 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 14 ms 1104 KB Output is correct
17 Correct 28 ms 2904 KB Output is correct
18 Correct 39 ms 3404 KB Output is correct
19 Correct 81 ms 3096 KB Output is correct
20 Correct 93 ms 3392 KB Output is correct
21 Correct 23 ms 2852 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 19 ms 1620 KB Output is correct
24 Correct 42 ms 3124 KB Output is correct
25 Correct 4 ms 596 KB Output is correct
26 Correct 22 ms 2096 KB Output is correct
27 Correct 29 ms 2380 KB Output is correct
28 Correct 32 ms 3336 KB Output is correct
29 Correct 11 ms 1352 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 1236 KB Output is correct
2 Correct 9 ms 852 KB Output is correct
3 Correct 15 ms 1832 KB Output is correct
4 Correct 19 ms 1868 KB Output is correct
5 Correct 18 ms 2452 KB Output is correct
6 Correct 12 ms 1632 KB Output is correct
7 Correct 3 ms 556 KB Output is correct
8 Correct 12 ms 1620 KB Output is correct
9 Correct 30 ms 3788 KB Output is correct
10 Correct 18 ms 2264 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 14 ms 1104 KB Output is correct
27 Correct 28 ms 2904 KB Output is correct
28 Correct 39 ms 3404 KB Output is correct
29 Correct 81 ms 3096 KB Output is correct
30 Correct 93 ms 3392 KB Output is correct
31 Correct 23 ms 2852 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 19 ms 1620 KB Output is correct
34 Correct 42 ms 3124 KB Output is correct
35 Correct 4 ms 596 KB Output is correct
36 Correct 22 ms 2096 KB Output is correct
37 Correct 29 ms 2380 KB Output is correct
38 Correct 32 ms 3336 KB Output is correct
39 Correct 11 ms 1352 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Incorrect 75 ms 3528 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 28 ms 1236 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 15 ms 1832 KB Output is correct
12 Correct 19 ms 1868 KB Output is correct
13 Correct 18 ms 2452 KB Output is correct
14 Correct 12 ms 1632 KB Output is correct
15 Correct 3 ms 556 KB Output is correct
16 Correct 12 ms 1620 KB Output is correct
17 Correct 30 ms 3788 KB Output is correct
18 Correct 18 ms 2264 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 14 ms 1104 KB Output is correct
35 Correct 28 ms 2904 KB Output is correct
36 Correct 39 ms 3404 KB Output is correct
37 Correct 81 ms 3096 KB Output is correct
38 Correct 93 ms 3392 KB Output is correct
39 Correct 23 ms 2852 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 19 ms 1620 KB Output is correct
42 Correct 42 ms 3124 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 22 ms 2096 KB Output is correct
45 Correct 29 ms 2380 KB Output is correct
46 Correct 32 ms 3336 KB Output is correct
47 Correct 11 ms 1352 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Incorrect 75 ms 3528 KB Output isn't correct
50 Halted 0 ms 0 KB -