oj.uz

Submission #1107795

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

using ll = long long;

#define pb push_back

#define int long long

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

int32_t 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 z : v) {
					pii x = z.ff, y = z.ss;
					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 z : u1) {
					pii x = z.ff, y = z.ss;
					if ((((x.ff - x.ff % i) / i) & 1) == (((x.ss - x.ss % i) / i) & 1)) {
						cnt1 -= (y.ff - x.ff + 1) * (y.ss - x.ss + 1);
						cnt2 += (y.ff - x.ff + 1) * (y.ss - x.ss + 1);
					}
					else {
						cnt1 += (y.ff - x.ff + 1) * (y.ss - x.ss + 1);
						cnt2 -= (y.ff - x.ff + 1) * (y.ss - x.ss + 1);
					}
				}

				for (auto z : u2) {
					pii x = z.ff, y = z.ss;

					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 -= ((r & 1) && (c & 1) ? (tr ? 1 : -1) : 0) * i * i;
					cnt2 -= ((r & 1) && (c & 1) ? (tr ? -1 : 1) : 0) * i * i;
				}
			}
		
			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 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 504 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 2588 KB Output is correct
2 Correct 5 ms 848 KB Output is correct
3 Correct 11 ms 1616 KB Output is correct
4 Correct 12 ms 1872 KB Output is correct
5 Correct 15 ms 2128 KB Output is correct
6 Correct 10 ms 1360 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 10 ms 1556 KB Output is correct
9 Correct 25 ms 3152 KB Output is correct
10 Correct 15 ms 1872 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 336 KB Output is correct
4 Correct 2 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 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 2 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 336 KB Output is correct
4 Correct 2 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 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 2 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 12 ms 1104 KB Output is correct
17 Correct 21 ms 2896 KB Output is correct
18 Correct 34 ms 3408 KB Output is correct
19 Correct 161 ms 3152 KB Output is correct
20 Correct 166 ms 3528 KB Output is correct
21 Correct 27 ms 2896 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 25 ms 1780 KB Output is correct
24 Correct 35 ms 3256 KB Output is correct
25 Correct 6 ms 592 KB Output is correct
26 Correct 20 ms 2128 KB Output is correct
27 Correct 32 ms 2384 KB Output is correct
28 Correct 42 ms 3408 KB Output is correct
29 Correct 8 ms 1360 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 2588 KB Output is correct
2 Correct 5 ms 848 KB Output is correct
3 Correct 11 ms 1616 KB Output is correct
4 Correct 12 ms 1872 KB Output is correct
5 Correct 15 ms 2128 KB Output is correct
6 Correct 10 ms 1360 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 10 ms 1556 KB Output is correct
9 Correct 25 ms 3152 KB Output is correct
10 Correct 15 ms 1872 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 336 KB Output is correct
14 Correct 2 ms 336 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 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 2 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 12 ms 1104 KB Output is correct
27 Correct 21 ms 2896 KB Output is correct
28 Correct 34 ms 3408 KB Output is correct
29 Correct 161 ms 3152 KB Output is correct
30 Correct 166 ms 3528 KB Output is correct
31 Correct 27 ms 2896 KB Output is correct
32 Correct 2 ms 504 KB Output is correct
33 Correct 25 ms 1780 KB Output is correct
34 Correct 35 ms 3256 KB Output is correct
35 Correct 6 ms 592 KB Output is correct
36 Correct 20 ms 2128 KB Output is correct
37 Correct 32 ms 2384 KB Output is correct
38 Correct 42 ms 3408 KB Output is correct
39 Correct 8 ms 1360 KB Output is correct
40 Correct 2 ms 336 KB Output is correct
41 Correct 123 ms 2896 KB Output is correct
42 Correct 36 ms 3152 KB Output is correct
43 Correct 71 ms 3068 KB Output is correct
44 Correct 35 ms 3324 KB Output is correct
45 Correct 27 ms 3408 KB Output is correct
46 Correct 137 ms 3316 KB Output is correct
47 Correct 25 ms 2896 KB Output is correct
48 Correct 57 ms 3152 KB Output is correct
49 Correct 34 ms 3064 KB Output is correct
50 Correct 701 ms 3152 KB Output is correct
51 Correct 709 ms 3408 KB Output is correct
52 Correct 689 ms 3152 KB Output is correct
53 Correct 722 ms 3452 KB Output is correct
54 Correct 656 ms 3220 KB Output is correct
55 Correct 780 ms 3568 KB Output is correct
56 Correct 640 ms 3152 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 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 504 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 2588 KB Output is correct
10 Correct 5 ms 848 KB Output is correct
11 Correct 11 ms 1616 KB Output is correct
12 Correct 12 ms 1872 KB Output is correct
13 Correct 15 ms 2128 KB Output is correct
14 Correct 10 ms 1360 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 10 ms 1556 KB Output is correct
17 Correct 25 ms 3152 KB Output is correct
18 Correct 15 ms 1872 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 336 KB Output is correct
22 Correct 2 ms 336 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 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 2 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 12 ms 1104 KB Output is correct
35 Correct 21 ms 2896 KB Output is correct
36 Correct 34 ms 3408 KB Output is correct
37 Correct 161 ms 3152 KB Output is correct
38 Correct 166 ms 3528 KB Output is correct
39 Correct 27 ms 2896 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 25 ms 1780 KB Output is correct
42 Correct 35 ms 3256 KB Output is correct
43 Correct 6 ms 592 KB Output is correct
44 Correct 20 ms 2128 KB Output is correct
45 Correct 32 ms 2384 KB Output is correct
46 Correct 42 ms 3408 KB Output is correct
47 Correct 8 ms 1360 KB Output is correct
48 Correct 2 ms 336 KB Output is correct
49 Correct 123 ms 2896 KB Output is correct
50 Correct 36 ms 3152 KB Output is correct
51 Correct 71 ms 3068 KB Output is correct
52 Correct 35 ms 3324 KB Output is correct
53 Correct 27 ms 3408 KB Output is correct
54 Correct 137 ms 3316 KB Output is correct
55 Correct 25 ms 2896 KB Output is correct
56 Correct 57 ms 3152 KB Output is correct
57 Correct 34 ms 3064 KB Output is correct
58 Correct 701 ms 3152 KB Output is correct
59 Correct 709 ms 3408 KB Output is correct
60 Correct 689 ms 3152 KB Output is correct
61 Correct 722 ms 3452 KB Output is correct
62 Correct 656 ms 3220 KB Output is correct
63 Correct 780 ms 3568 KB Output is correct
64 Correct 640 ms 3152 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Incorrect 915 ms 3152 KB Output isn't correct
68 Halted 0 ms 0 KB -