oj.uz

답안 #555270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
555270 2022-04-30T11:00:37 Z ngpin04 Chessboard (IZhO18_chessboard) C++14
70 / 100
 2000 ms 4044 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 n,k;

int getc(int i, int j, int l, int val) {
	return (((i / l) ^ (j / l)) & 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 ((dy / l) & 1)
				res = (long long) dx * l * getv(x, y, l, val); 
		}
	} else {
		if ((dx / l) & (dy / l) & 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 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 = (x + l - 1) / l * l;
			int j = (y + l - 1) / l * l;
			int s = (u + 1) / l * l - 1;
			int t = (v + 1) / l * l - 1;
			vector <pair <int, int>> r, c;
			if ((x / l) == (u / l))
				r.push_back(mp(x, u));
			else {
				r.push_back(mp(x, i - 1));
				r.push_back(mp(i, s));
				r.push_back(mp(s + 1, u));
			}
			if ((y / l) == (v / l))
				c.push_back(mp(y, v));
			else {
				c.push_back(mp(y, j - 1));
				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

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 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 26 ms 1180 KB Output is correct
2 Correct 7 ms 468 KB Output is correct
3 Correct 19 ms 852 KB Output is correct
4 Correct 18 ms 1048 KB Output is correct
5 Correct 24 ms 1184 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 15 ms 880 KB Output is correct
9 Correct 38 ms 1720 KB Output is correct
10 Correct 23 ms 1108 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 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 0 ms 212 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 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 16 ms 724 KB Output is correct
17 Correct 29 ms 1520 KB Output is correct
18 Correct 57 ms 1852 KB Output is correct
19 Correct 278 ms 1692 KB Output is correct
20 Correct 295 ms 1744 KB Output is correct
21 Correct 29 ms 1616 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 41 ms 976 KB Output is correct
24 Correct 50 ms 1716 KB Output is correct
25 Correct 9 ms 460 KB Output is correct
26 Correct 32 ms 1172 KB Output is correct
27 Correct 53 ms 1368 KB Output is correct
28 Correct 52 ms 1800 KB Output is correct
29 Correct 12 ms 760 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 1180 KB Output is correct
2 Correct 7 ms 468 KB Output is correct
3 Correct 19 ms 852 KB Output is correct
4 Correct 18 ms 1048 KB Output is correct
5 Correct 24 ms 1184 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 15 ms 880 KB Output is correct
9 Correct 38 ms 1720 KB Output is correct
10 Correct 23 ms 1108 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 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 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 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 16 ms 724 KB Output is correct
27 Correct 29 ms 1520 KB Output is correct
28 Correct 57 ms 1852 KB Output is correct
29 Correct 278 ms 1692 KB Output is correct
30 Correct 295 ms 1744 KB Output is correct
31 Correct 29 ms 1616 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 41 ms 976 KB Output is correct
34 Correct 50 ms 1716 KB Output is correct
35 Correct 9 ms 460 KB Output is correct
36 Correct 32 ms 1172 KB Output is correct
37 Correct 53 ms 1368 KB Output is correct
38 Correct 52 ms 1800 KB Output is correct
39 Correct 12 ms 760 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 305 ms 1616 KB Output is correct
42 Correct 62 ms 1796 KB Output is correct
43 Correct 123 ms 1612 KB Output is correct
44 Correct 58 ms 1736 KB Output is correct
45 Correct 39 ms 1836 KB Output is correct
46 Correct 261 ms 1756 KB Output is correct
47 Correct 34 ms 1620 KB Output is correct
48 Correct 90 ms 1700 KB Output is correct
49 Correct 52 ms 1536 KB Output is correct
50 Correct 1226 ms 1728 KB Output is correct
51 Correct 1320 ms 1920 KB Output is correct
52 Correct 1229 ms 1740 KB Output is correct
53 Correct 1334 ms 1908 KB Output is correct
54 Correct 1262 ms 1696 KB Output is correct
55 Correct 1371 ms 1872 KB Output is correct
56 Correct 1223 ms 1656 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 26 ms 1180 KB Output is correct
10 Correct 7 ms 468 KB Output is correct
11 Correct 19 ms 852 KB Output is correct
12 Correct 18 ms 1048 KB Output is correct
13 Correct 24 ms 1184 KB Output is correct
14 Correct 15 ms 852 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 15 ms 880 KB Output is correct
17 Correct 38 ms 1720 KB Output is correct
18 Correct 23 ms 1108 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 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 16 ms 724 KB Output is correct
35 Correct 29 ms 1520 KB Output is correct
36 Correct 57 ms 1852 KB Output is correct
37 Correct 278 ms 1692 KB Output is correct
38 Correct 295 ms 1744 KB Output is correct
39 Correct 29 ms 1616 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 41 ms 976 KB Output is correct
42 Correct 50 ms 1716 KB Output is correct
43 Correct 9 ms 460 KB Output is correct
44 Correct 32 ms 1172 KB Output is correct
45 Correct 53 ms 1368 KB Output is correct
46 Correct 52 ms 1800 KB Output is correct
47 Correct 12 ms 760 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 305 ms 1616 KB Output is correct
50 Correct 62 ms 1796 KB Output is correct
51 Correct 123 ms 1612 KB Output is correct
52 Correct 58 ms 1736 KB Output is correct
53 Correct 39 ms 1836 KB Output is correct
54 Correct 261 ms 1756 KB Output is correct
55 Correct 34 ms 1620 KB Output is correct
56 Correct 90 ms 1700 KB Output is correct
57 Correct 52 ms 1536 KB Output is correct
58 Correct 1226 ms 1728 KB Output is correct
59 Correct 1320 ms 1920 KB Output is correct
60 Correct 1229 ms 1740 KB Output is correct
61 Correct 1334 ms 1908 KB Output is correct
62 Correct 1262 ms 1696 KB Output is correct
63 Correct 1371 ms 1872 KB Output is correct
64 Correct 1223 ms 1656 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 1971 ms 4012 KB Output is correct
68 Correct 1945 ms 4000 KB Output is correct
69 Correct 1670 ms 3544 KB Output is correct
70 Correct 1741 ms 3892 KB Output is correct
71 Correct 1800 ms 3836 KB Output is correct
72 Correct 1764 ms 3872 KB Output is correct
73 Correct 1827 ms 3676 KB Output is correct
74 Correct 1921 ms 3956 KB Output is correct
75 Correct 1814 ms 3812 KB Output is correct
76 Execution timed out 2015 ms 4044 KB Time limit exceeded
77 Halted 0 ms 0 KB -