oj.uz

답안 #378685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378685 2021-03-17T03:11:03 Z Seanliu Chessboard (IZhO18_chessboard) C++14
100 / 100
 856 ms 5932 KB 
#include <iostream>
#include <cassert>
#define int long long int
#define ericxiao ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;

const int maxN = 1e5 + 326;

struct Rect{
	int l, r, d, u, A;
	Rect(){}
	Rect(int l, int r, int d, int u): l(l), r(r), d(d), u(u){
		A = (r - l + 1) * (u - d + 1);
	}
} rects[maxN];

inline bool onDiag(int x, int y, int d){
	return	(((x % (2 * d)) < d) == ((y % (2 * d)) < d)); 
}

inline int id(int x, int y, int d){
	return x / d * maxN + y / d;		
}

inline int getArea(int a, int b){
	if(a < 0 || b < 0) return 0;
	return a * b;
}

inline int Area(int l, int r, int d, int u, int div){
	if(l > r || d > u) return 0;
	if(div == 1){
		if(((r - l + 1) & 1) && ((u - d + 1) & 1) && onDiag(l, u, div)) return ((r - l + 1) * (u - d + 1) + 1)/ 2;
		return ((r - l + 1) * (u - d + 1))/ 2;
	}
	//cout << "running: " << l << " " << r << " " << d << " " << u << " " << div << endl;
	int _l = (l + div - 1) / div * div, _r = r / div * div, _u = u / div * div, _d = (d + div - 1) / div * div, res = 0;
	if((l / div == r / div) && (u / div == d / div)){
		return (u - d + 1) * (r - l + 1) * onDiag(l, u, div);
	}
	if(l / div == r / div){
		//cout << "u = " << u << ", _u = " << _u << ", d = " << d << ", _d = " << _d << endl;
		int k = 0;
		k += (u - _u + 1) * onDiag(l, u, div);
		k += (_d - d) * onDiag(l, d, div);
		if(onDiag(l, _d, div) && ((_u - _d) / div) & 1) k += ((_u - _d) / div / 2 + 1) * div;
		else k += ((_u - _d) / div / 2) * div; 
		return k * (r - l + 1);
	} 
	if(u / div == d / div){
		int k = 0;
		k += (_l - l) * onDiag(l, u, div);
		k += (r - _r + 1) * onDiag(r, u, div);
		if(onDiag(_l, u, div) && ((_r - _l) / div) & 1) k += ((_r - _l) / div / 2 + 1) * div;
		else k += ((_r - _l) / div / 2) * div; 
		return k * (u - d + 1);
	}
	res = (_r - _l) / div * (_u - _d) / div;
	if(onDiag(_l, _d, div) && (res & 1)) res = (res + 1) / 2; 
	else res = res / 2;
	res *= div * div;
	if(onDiag(l, u, div)){
		res += getArea((_l - l), (u - _u + 1));
	} 
	if(onDiag(r, u, div)){
		res += getArea((r - _r + 1), (u - _u + 1));
	} 
	if(onDiag(r, d, div)){
		res += getArea((r - _r + 1), (_d - d));
	}	
	if(onDiag(l, d, div)){
		res += getArea((_l - l), (_d - d));
	} 
	res += Area(_l, _r - 1, _u, u, div);
	res += Area(_l, _r - 1, d, _d - 1, div);
	res += Area(l, _l - 1, _d, _u - 1, div);
	res += Area(_r, r, _d, _u - 1, div);
	//cout <<  l << " " << r << " " << d << " " << u << " " << div << ", res = " << res << endl;
	return res;
}

int N, K;

inline int check(int d){
	//top left is black
	//cout << "d = " << d << endl;
	int _ans = maxN * maxN, tmp = ((N / d) * (N / d) + 1) / 2 * (d * d), tmp2 = ((N / d) * (N / d)) / 2 * (d * d);
	//cout << "1tmp = " << tmp << endl;
	for(int i = 0; i < K; i++){
		int A = Area(rects[i].l, rects[i].r, rects[i].d, rects[i].u, d), B = rects[i].A - A;
		//cout << "d = " << d << ",A = " << A << endl;
		tmp += B - A;
		tmp2 += A - B;
	}
	//cout << "d: " << min(tmp, tmp2) << endl;
	return min(tmp, tmp2);
	//top right is black
}

signed main(){
	ericxiao;
	cin >> N >> K;
	int l, r, d, u;
	for(int i = 0; i < K; i++){
		cin >> l >> d >> r >> u;
		l--; d--; r--; u--;
		rects[i] = Rect(l, r, d, u);
		//cout << "rects[i] a = " << rects[i].A << endl;
	}
	int ans = maxN * maxN;
	for(int div = 1; div * div <= N; div++){
		if(!(N % div)){
			ans = min(ans, check(div));
			if(div != 1) ans = min(ans, check(N / div));
		}
	}
	cout << ans << endl;
}

/*
 * 
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6
*/

Compilation message

chessboard.cpp: In function 'long long int check(long long int)':
chessboard.cpp:87:6: warning: unused variable '_ans' [-Wunused-variable]
   87 |  int _ans = maxN * maxN, tmp = ((N / d) * (N / d) + 1) / 2 * (d * d), tmp2 = ((N / d) * (N / d)) / 2 * (d * d);
      |      ^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 2796 KB Output is correct
2 Correct 7 ms 1284 KB Output is correct
3 Correct 16 ms 2284 KB Output is correct
4 Correct 18 ms 2540 KB Output is correct
5 Correct 21 ms 3096 KB Output is correct
6 Correct 17 ms 2028 KB Output is correct
7 Correct 5 ms 748 KB Output is correct
8 Correct 14 ms 2028 KB Output is correct
9 Correct 36 ms 4588 KB Output is correct
10 Correct 20 ms 2924 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 13 ms 1644 KB Output is correct
17 Correct 29 ms 4332 KB Output is correct
18 Correct 45 ms 4972 KB Output is correct
19 Correct 144 ms 4460 KB Output is correct
20 Correct 159 ms 5356 KB Output is correct
21 Correct 38 ms 3948 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 32 ms 2284 KB Output is correct
24 Correct 39 ms 4332 KB Output is correct
25 Correct 6 ms 876 KB Output is correct
26 Correct 24 ms 2924 KB Output is correct
27 Correct 36 ms 3308 KB Output is correct
28 Correct 41 ms 4588 KB Output is correct
29 Correct 12 ms 1960 KB Output is correct
30 Correct 2 ms 492 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 2796 KB Output is correct
2 Correct 7 ms 1284 KB Output is correct
3 Correct 16 ms 2284 KB Output is correct
4 Correct 18 ms 2540 KB Output is correct
5 Correct 21 ms 3096 KB Output is correct
6 Correct 17 ms 2028 KB Output is correct
7 Correct 5 ms 748 KB Output is correct
8 Correct 14 ms 2028 KB Output is correct
9 Correct 36 ms 4588 KB Output is correct
10 Correct 20 ms 2924 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 13 ms 1644 KB Output is correct
27 Correct 29 ms 4332 KB Output is correct
28 Correct 45 ms 4972 KB Output is correct
29 Correct 144 ms 4460 KB Output is correct
30 Correct 159 ms 5356 KB Output is correct
31 Correct 38 ms 3948 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 32 ms 2284 KB Output is correct
34 Correct 39 ms 4332 KB Output is correct
35 Correct 6 ms 876 KB Output is correct
36 Correct 24 ms 2924 KB Output is correct
37 Correct 36 ms 3308 KB Output is correct
38 Correct 41 ms 4588 KB Output is correct
39 Correct 12 ms 1960 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 139 ms 4208 KB Output is correct
42 Correct 47 ms 4588 KB Output is correct
43 Correct 75 ms 4236 KB Output is correct
44 Correct 46 ms 4624 KB Output is correct
45 Correct 38 ms 4972 KB Output is correct
46 Correct 147 ms 4696 KB Output is correct
47 Correct 39 ms 4332 KB Output is correct
48 Correct 61 ms 4460 KB Output is correct
49 Correct 41 ms 4204 KB Output is correct
50 Correct 633 ms 4676 KB Output is correct
51 Correct 669 ms 4984 KB Output is correct
52 Correct 626 ms 4600 KB Output is correct
53 Correct 688 ms 4804 KB Output is correct
54 Correct 627 ms 4524 KB Output is correct
55 Correct 697 ms 4948 KB Output is correct
56 Correct 598 ms 4460 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 26 ms 2796 KB Output is correct
10 Correct 7 ms 1284 KB Output is correct
11 Correct 16 ms 2284 KB Output is correct
12 Correct 18 ms 2540 KB Output is correct
13 Correct 21 ms 3096 KB Output is correct
14 Correct 17 ms 2028 KB Output is correct
15 Correct 5 ms 748 KB Output is correct
16 Correct 14 ms 2028 KB Output is correct
17 Correct 36 ms 4588 KB Output is correct
18 Correct 20 ms 2924 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 13 ms 1644 KB Output is correct
35 Correct 29 ms 4332 KB Output is correct
36 Correct 45 ms 4972 KB Output is correct
37 Correct 144 ms 4460 KB Output is correct
38 Correct 159 ms 5356 KB Output is correct
39 Correct 38 ms 3948 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 32 ms 2284 KB Output is correct
42 Correct 39 ms 4332 KB Output is correct
43 Correct 6 ms 876 KB Output is correct
44 Correct 24 ms 2924 KB Output is correct
45 Correct 36 ms 3308 KB Output is correct
46 Correct 41 ms 4588 KB Output is correct
47 Correct 12 ms 1960 KB Output is correct
48 Correct 2 ms 492 KB Output is correct
49 Correct 139 ms 4208 KB Output is correct
50 Correct 47 ms 4588 KB Output is correct
51 Correct 75 ms 4236 KB Output is correct
52 Correct 46 ms 4624 KB Output is correct
53 Correct 38 ms 4972 KB Output is correct
54 Correct 147 ms 4696 KB Output is correct
55 Correct 39 ms 4332 KB Output is correct
56 Correct 61 ms 4460 KB Output is correct
57 Correct 41 ms 4204 KB Output is correct
58 Correct 633 ms 4676 KB Output is correct
59 Correct 669 ms 4984 KB Output is correct
60 Correct 626 ms 4600 KB Output is correct
61 Correct 688 ms 4804 KB Output is correct
62 Correct 627 ms 4524 KB Output is correct
63 Correct 697 ms 4948 KB Output is correct
64 Correct 598 ms 4460 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 801 ms 4832 KB Output is correct
68 Correct 803 ms 5396 KB Output is correct
69 Correct 701 ms 4972 KB Output is correct
70 Correct 856 ms 5228 KB Output is correct
71 Correct 764 ms 5288 KB Output is correct
72 Correct 729 ms 5108 KB Output is correct
73 Correct 776 ms 5040 KB Output is correct
74 Correct 779 ms 5360 KB Output is correct
75 Correct 754 ms 5100 KB Output is correct
76 Correct 803 ms 5560 KB Output is correct
77 Correct 134 ms 5656 KB Output is correct
78 Correct 47 ms 5228 KB Output is correct
79 Correct 95 ms 4972 KB Output is correct
80 Correct 101 ms 5100 KB Output is correct
81 Correct 94 ms 4972 KB Output is correct
82 Correct 77 ms 5612 KB Output is correct
83 Correct 66 ms 4972 KB Output is correct
84 Correct 484 ms 5612 KB Output is correct
85 Correct 824 ms 5612 KB Output is correct
86 Correct 2 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 832 ms 5932 KB Output is correct
89 Correct 180 ms 1516 KB Output is correct
90 Correct 1 ms 364 KB Output is correct