oj.uz

Submission #555276

# Submission time Handle Problem Language Result Execution time Memory
555276 2022-04-30T11:09:05 Z ngpin04 Chessboard (IZhO18_chessboard) C++14
47 / 100
 2000 ms 3356 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
const int N = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

pair <int, int> a[N], b[N];

int par[2 * N];
int lim[2 * N];
int n,k;

int getc(int i, int j, int l, int val) {
	return ((par[i] ^ par[j]) & 1) ^ val;
}

int getv(int i, int j, int l, int val) {
	return (getc(i, j, l, val) > 0) ? -1 : 1;
}

long long calc(int x, int y, int u, int v, int l, int val) {
	if (x > u || y > v)
		return 0;	

	long long res = 0;
	int dx = (u - x + 1);
	int dy = (v - y + 1);
	if (dx > dy)
		swap(dx, dy);

	if (dx < l) {
		if (dy < l) 
			res = (long long) dx * dy * getv(x, y, l, val);
		else {
			if (par[dy] & 1)
				res = (long long) dx * l * getv(x, y, l, val); 
		}
	} else {
		if (par[dx] & par[dy] & 1)
			res = (long long) l * l * getv(x, y, l, val);
	}
	return res;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	#ifdef ONLINE_JUDGE
	// freopen(TASK".inp","r",stdin);
	// freopen(TASK".out","w",stdout);
	#endif
	cin >> n >> k;

	for (int i = 1; i <= k; i++) {
		cin >> a[i].fi >> a[i].se >> b[i].fi >> b[i].se;
		a[i].fi--; a[i].se--;
		b[i].fi--; b[i].se--;
	}

	long long ans = ooo;
	for (int l = 1; l < n; l++) if (n % l == 0) 
	for (int val = 0; val < 2; val++) {
		int d = (n / l);
		long long res = ((1LL * d * d + val) >> 1) * l * l;
		for (int i = 0; i < 2 * n; i++) {
			par[i] = (i / l);
			lim[i] = par[i] * l;
		}

		for (int id = 1; id <= k; id++) {
			int x = a[id].fi;
			int y = a[id].se;
			int u = b[id].fi;
			int v = b[id].se;

			int i = lim[x + l - 1];
			int j = lim[y + l - 1];
			int s = lim[u + 1] - 1;
			int t = lim[v + 1] - 1;
			vector <pair <int, int>> r, c;
			if (par[x] == par[u])
				r.push_back(mp(x, u));
			else {
				r.push_back(mp(x, i - 1));
				if (i <= s) 
					r.push_back(mp(i, s));
				r.push_back(mp(s + 1, u));
			}
			if (par[y] == par[v])
				c.push_back(mp(y, v));
			else {
				c.push_back(mp(y, j - 1));
				if (j <= t) 
					c.push_back(mp(j, t));
				c.push_back(mp(t + 1, v));
			}

			for (pair <int, int> a : r)
			for (pair <int, int> b : c)
				res += calc(a.fi, b.fi, a.se, b.se, l, val);
		}
		// cerr << "split: " << l << " " << val << " " << res << "\n";
		mini(ans, res);
	}

	cout << ans;
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2268 KB Output is correct
2 Correct 7 ms 724 KB Output is correct
3 Correct 21 ms 2140 KB Output is correct
4 Correct 17 ms 980 KB Output is correct
5 Correct 24 ms 2076 KB Output is correct
6 Correct 18 ms 1632 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 16 ms 1620 KB Output is correct
9 Correct 37 ms 2172 KB Output is correct
10 Correct 21 ms 1620 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 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 784 KB Output is correct
17 Correct 29 ms 1540 KB Output is correct
18 Correct 54 ms 1824 KB Output is correct
19 Correct 267 ms 1716 KB Output is correct
20 Correct 314 ms 1900 KB Output is correct
21 Correct 28 ms 1556 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 43 ms 1004 KB Output is correct
24 Correct 52 ms 1748 KB Output is correct
25 Correct 9 ms 468 KB Output is correct
26 Correct 33 ms 1236 KB Output is correct
27 Correct 58 ms 1400 KB Output is correct
28 Correct 55 ms 1744 KB Output is correct
29 Correct 13 ms 852 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2268 KB Output is correct
2 Correct 7 ms 724 KB Output is correct
3 Correct 21 ms 2140 KB Output is correct
4 Correct 17 ms 980 KB Output is correct
5 Correct 24 ms 2076 KB Output is correct
6 Correct 18 ms 1632 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 16 ms 1620 KB Output is correct
9 Correct 37 ms 2172 KB Output is correct
10 Correct 21 ms 1620 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 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 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 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 784 KB Output is correct
27 Correct 29 ms 1540 KB Output is correct
28 Correct 54 ms 1824 KB Output is correct
29 Correct 267 ms 1716 KB Output is correct
30 Correct 314 ms 1900 KB Output is correct
31 Correct 28 ms 1556 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 43 ms 1004 KB Output is correct
34 Correct 52 ms 1748 KB Output is correct
35 Correct 9 ms 468 KB Output is correct
36 Correct 33 ms 1236 KB Output is correct
37 Correct 58 ms 1400 KB Output is correct
38 Correct 55 ms 1744 KB Output is correct
39 Correct 13 ms 852 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 345 ms 3172 KB Output is correct
42 Correct 81 ms 3252 KB Output is correct
43 Correct 168 ms 3076 KB Output is correct
44 Correct 70 ms 3248 KB Output is correct
45 Correct 45 ms 3356 KB Output is correct
46 Correct 348 ms 3328 KB Output is correct
47 Correct 45 ms 3148 KB Output is correct
48 Correct 124 ms 3204 KB Output is correct
49 Correct 63 ms 3156 KB Output is correct
50 Correct 1878 ms 3044 KB Output is correct
51 Execution timed out 2013 ms 3140 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 2268 KB Output is correct
10 Correct 7 ms 724 KB Output is correct
11 Correct 21 ms 2140 KB Output is correct
12 Correct 17 ms 980 KB Output is correct
13 Correct 24 ms 2076 KB Output is correct
14 Correct 18 ms 1632 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 16 ms 1620 KB Output is correct
17 Correct 37 ms 2172 KB Output is correct
18 Correct 21 ms 1620 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 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 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 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 784 KB Output is correct
35 Correct 29 ms 1540 KB Output is correct
36 Correct 54 ms 1824 KB Output is correct
37 Correct 267 ms 1716 KB Output is correct
38 Correct 314 ms 1900 KB Output is correct
39 Correct 28 ms 1556 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 43 ms 1004 KB Output is correct
42 Correct 52 ms 1748 KB Output is correct
43 Correct 9 ms 468 KB Output is correct
44 Correct 33 ms 1236 KB Output is correct
45 Correct 58 ms 1400 KB Output is correct
46 Correct 55 ms 1744 KB Output is correct
47 Correct 13 ms 852 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 345 ms 3172 KB Output is correct
50 Correct 81 ms 3252 KB Output is correct
51 Correct 168 ms 3076 KB Output is correct
52 Correct 70 ms 3248 KB Output is correct
53 Correct 45 ms 3356 KB Output is correct
54 Correct 348 ms 3328 KB Output is correct
55 Correct 45 ms 3148 KB Output is correct
56 Correct 124 ms 3204 KB Output is correct
57 Correct 63 ms 3156 KB Output is correct
58 Correct 1878 ms 3044 KB Output is correct
59 Execution timed out 2013 ms 3140 KB Time limit exceeded
60 Halted 0 ms 0 KB -