oj.uz

Submission #1107808

# Submission time Handle Problem Language Result Execution time Memory
1107808 2024-11-02T06:58:30 Z stdfloat Chessboard (IZhO18_chessboard) C++17
70 / 100
 884 ms 2040 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define pb push_back

#define ff	first
#define ss	second
#define pii	pair<int, int>

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

	int n, k;
	cin >> n >> k;

	pii p1[k], p2[k];
	for (int i = 0; i < k; i++) {
		cin >> p1[i].ff >> p1[i].ss >> p2[i].ff >> p2[i].ss;
		p1[i].ff--; p1[i].ss--; p2[i].ff--; p2[i].ss--;
	}

	ll ans = LLONG_MAX;
	for (int ii = 1; ii * ii <= n; ii++) {
		if (n % ii) continue;

		for (auto i : {ii, n / ii}) {
			if (i == n) continue;

			int x = n / i;
			ll cnt1 = ((ll)((x + 1) >> 1) * ((x + 1) >> 1) + (ll)(x >> 1) * (x >> 1)) * i * i;
			ll cnt2 = ((ll)((x + 1) >> 1) * (x >> 1) + (ll)(x >> 1) * ((x + 1) >> 1)) * i * i;
			for (int j = 0; j < k; j++) {
				pii x = p1[j], y = p2[j];

				vector<pair<pii, pii>> v;
				if (x.ss / i != y.ss / i) {
					if (x.ss % i) {
						v.pb({x, {y.ff, x.ss + i - x.ss % i - 1}}); x.ss += i - x.ss % i;
					}
					if ((y.ss + 1) % i) {
						v.pb({{x.ff, y.ss - y.ss % i}, y}); y.ss -= y.ss % i + 1;
					}
				}
				v.pb({x, y});

				vector<pair<pii, pii>> u1, u2;
				for (auto [x, y] : v) {
					if (x.ff / i == y.ff / i) {
						if (x.ss / i == y.ss / i) u1.pb({x, y});
						else u2.pb({x, y}); ////
					}
					else {
						if (x.ff % i) {
							u1.pb({x, {x.ff + i - x.ff % i - 1, y.ss}}); x.ff += i - x.ff % i;
						}
						if ((y.ff + 1) % i) {
							u1.pb({{y.ff - y.ff % i, x.ss}, y}); y.ff -= y.ff % i + 1;
						}

						u2.pb({x, y});
					}
				}

				for (auto [x, y] : u1) {
					if (((x.ff / i) & 1) == ((x.ss / i) & 1)) {
						cnt1 -= (ll)(y.ff - x.ff + 1) * (y.ss - x.ss + 1);
						cnt2 += (ll)(y.ff - x.ff + 1) * (y.ss - x.ss + 1);
					}
					else {
						cnt1 += (ll)(y.ff - x.ff + 1) * (y.ss - x.ss + 1);
						cnt2 -= (ll)(y.ff - x.ff + 1) * (y.ss - x.ss + 1);
					}
				}

				for (auto [x, y] : u2) {
					bool tr = (((x.ff / i) & 1) == ((x.ss / i) & 1));
					int r = (y.ff - x.ff + 1) / i, c = (y.ss - x.ss + 1) / i;

					cnt1 -= (ll)((r & 1) && (c & 1) ? (tr ? 1 : -1) : 0) * i * min((i - x.ss % i), (y.ss % i + 1));
					cnt2 -= (ll)((r & 1) && (c & 1) ? (tr ? -1 : 1) : 0) * i * min((i - x.ff % i), (y.ff % i + 1));
				}
			}
		
			ans = min({ans, cnt1, cnt2});
		}
	}

	cout << ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1360 KB Output is correct
2 Correct 5 ms 592 KB Output is correct
3 Correct 11 ms 1016 KB Output is correct
4 Correct 11 ms 1104 KB Output is correct
5 Correct 15 ms 1104 KB Output is correct
6 Correct 9 ms 848 KB Output is correct
7 Correct 3 ms 336 KB Output is correct
8 Correct 9 ms 848 KB Output is correct
9 Correct 24 ms 1616 KB Output is correct
10 Correct 15 ms 1104 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 520 KB Output is correct
12 Correct 1 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 10 ms 884 KB Output is correct
17 Correct 20 ms 1628 KB Output is correct
18 Correct 35 ms 1872 KB Output is correct
19 Correct 152 ms 1784 KB Output is correct
20 Correct 177 ms 1872 KB Output is correct
21 Correct 18 ms 1616 KB Output is correct
22 Correct 2 ms 508 KB Output is correct
23 Correct 26 ms 1104 KB Output is correct
24 Correct 31 ms 1616 KB Output is correct
25 Correct 5 ms 336 KB Output is correct
26 Correct 20 ms 1104 KB Output is correct
27 Correct 31 ms 1360 KB Output is correct
28 Correct 35 ms 1952 KB Output is correct
29 Correct 8 ms 848 KB Output is correct
30 Correct 2 ms 336 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1360 KB Output is correct
2 Correct 5 ms 592 KB Output is correct
3 Correct 11 ms 1016 KB Output is correct
4 Correct 11 ms 1104 KB Output is correct
5 Correct 15 ms 1104 KB Output is correct
6 Correct 9 ms 848 KB Output is correct
7 Correct 3 ms 336 KB Output is correct
8 Correct 9 ms 848 KB Output is correct
9 Correct 24 ms 1616 KB Output is correct
10 Correct 15 ms 1104 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 508 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 520 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 10 ms 884 KB Output is correct
27 Correct 20 ms 1628 KB Output is correct
28 Correct 35 ms 1872 KB Output is correct
29 Correct 152 ms 1784 KB Output is correct
30 Correct 177 ms 1872 KB Output is correct
31 Correct 18 ms 1616 KB Output is correct
32 Correct 2 ms 508 KB Output is correct
33 Correct 26 ms 1104 KB Output is correct
34 Correct 31 ms 1616 KB Output is correct
35 Correct 5 ms 336 KB Output is correct
36 Correct 20 ms 1104 KB Output is correct
37 Correct 31 ms 1360 KB Output is correct
38 Correct 35 ms 1952 KB Output is correct
39 Correct 8 ms 848 KB Output is correct
40 Correct 2 ms 336 KB Output is correct
41 Correct 134 ms 1784 KB Output is correct
42 Correct 35 ms 1872 KB Output is correct
43 Correct 71 ms 1616 KB Output is correct
44 Correct 34 ms 1872 KB Output is correct
45 Correct 26 ms 1872 KB Output is correct
46 Correct 134 ms 2040 KB Output is correct
47 Correct 24 ms 1616 KB Output is correct
48 Correct 62 ms 1616 KB Output is correct
49 Correct 31 ms 1616 KB Output is correct
50 Correct 646 ms 1872 KB Output is correct
51 Correct 716 ms 1952 KB Output is correct
52 Correct 653 ms 1848 KB Output is correct
53 Correct 682 ms 1872 KB Output is correct
54 Correct 630 ms 1828 KB Output is correct
55 Correct 733 ms 1872 KB Output is correct
56 Correct 626 ms 1788 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 17 ms 1360 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 11 ms 1016 KB Output is correct
12 Correct 11 ms 1104 KB Output is correct
13 Correct 15 ms 1104 KB Output is correct
14 Correct 9 ms 848 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 9 ms 848 KB Output is correct
17 Correct 24 ms 1616 KB Output is correct
18 Correct 15 ms 1104 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 508 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 520 KB Output is correct
30 Correct 1 ms 504 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 10 ms 884 KB Output is correct
35 Correct 20 ms 1628 KB Output is correct
36 Correct 35 ms 1872 KB Output is correct
37 Correct 152 ms 1784 KB Output is correct
38 Correct 177 ms 1872 KB Output is correct
39 Correct 18 ms 1616 KB Output is correct
40 Correct 2 ms 508 KB Output is correct
41 Correct 26 ms 1104 KB Output is correct
42 Correct 31 ms 1616 KB Output is correct
43 Correct 5 ms 336 KB Output is correct
44 Correct 20 ms 1104 KB Output is correct
45 Correct 31 ms 1360 KB Output is correct
46 Correct 35 ms 1952 KB Output is correct
47 Correct 8 ms 848 KB Output is correct
48 Correct 2 ms 336 KB Output is correct
49 Correct 134 ms 1784 KB Output is correct
50 Correct 35 ms 1872 KB Output is correct
51 Correct 71 ms 1616 KB Output is correct
52 Correct 34 ms 1872 KB Output is correct
53 Correct 26 ms 1872 KB Output is correct
54 Correct 134 ms 2040 KB Output is correct
55 Correct 24 ms 1616 KB Output is correct
56 Correct 62 ms 1616 KB Output is correct
57 Correct 31 ms 1616 KB Output is correct
58 Correct 646 ms 1872 KB Output is correct
59 Correct 716 ms 1952 KB Output is correct
60 Correct 653 ms 1848 KB Output is correct
61 Correct 682 ms 1872 KB Output is correct
62 Correct 630 ms 1828 KB Output is correct
63 Correct 733 ms 1872 KB Output is correct
64 Correct 626 ms 1788 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 1 ms 504 KB Output is correct
67 Incorrect 884 ms 1896 KB Output isn't correct
68 Halted 0 ms 0 KB -