oj.uz

답안 #634762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
634762 2022-08-24T20:47:09 Z lovrot Chessboard (IZhO18_chessboard) C++11
100 / 100
 1385 ms 8920 KB 
#include <bits/stdc++.h>

#define pii pair<ll, ll>
#define X first
#define Y second
#define ll long long

using namespace std; 

const int N = 2 * 1e5 + 10;
const ll INF = 1e12;

ll n, m, d;
pii rect[N][4];  
bool b;

bool getCol(ll x, ll y){ 
	if(((x & 1) == (y & 1))) return b;
	return !b;
}

ll rectangle(ll x, ll y){ 
	ll ret = ((x * y) / 2) * d * d;
	if((x & 1) && (y & 1))
		ret += b ? d * d : 0;
	return ret;
}

ll area(ll x, ll y){ 
	if((x & 1) && (y & 1)){ 
		if(b) return -(d * d);
		else return d * d;
	}
	return 0;
}

ll calcPart(ll w, ll h, bool col){ 
	if(col){ 
		return (h & 1) ? -(w * d) : 0; 
	} 
	return (h & 1) ? w * d : 0;
}

ll pref(pii p){
	ll x = p.X;
	ll y = p.Y; 
	ll lenx = x / d, leny = y / d;
	ll ret = area(lenx, leny);
	x = x % d;
	y = y % d;

	if(getCol(lenx, leny)) ret -= x * y;
	else ret += x * y;
	ret += calcPart(x, leny, getCol(lenx, 0));
	ret += calcPart(y, lenx, getCol(0, leny));
	return ret;
}

int main(){ 
	scanf("%lld%d", &n, &m);

	for(int i = 0; i < m; i++){ 
		ll x, y, x2, y2;
		scanf("%lld%lld%lld%lld", &x, &y, &x2, &y2);
		rect[i][0] = {x2, y2};
		rect[i][2] = {x - 1, y - 1};
		rect[i][1] = {x - 1 , y2};		
		rect[i][3] = {x2, y - 1};
	}

	ll ans = INF;
	for(int i = 1; i < n; i++){ 
		if(n % i) continue;
		d = i;
		for(int nb = 0; nb < 2; nb++){
			b = nb;
			ll res = rectangle(n / d, n / d);
			for(int j = 0; j < m; j++){
				res += pref(rect[j][0]) - pref(rect[j][1]) + pref(rect[j][2]) - pref(rect[j][3]); 	
				// if(i == 5) cout << pref(rect[j][0]) - pref(rect[j][1]) + pref(rect[j][2]) - pref(rect[j][3]) << " +\n";
			}
			// printf("%d %d %d %d\n", i, nb, rectangle(n / d, n / d), res);
			ans = min(ans, res);
		}	
	}
	cout << ans << "\n";
	return 0;
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:60:14: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
   60 |  scanf("%lld%d", &n, &m);
      |             ~^       ~~
      |              |       |
      |              int*    long long int*
      |             %lld
chessboard.cpp:60:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |  scanf("%lld%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~
chessboard.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |   scanf("%lld%lld%lld%lld", &x, &y, &x2, &y2);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 304 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 312 KB Output is correct
6 Correct 1 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 37 ms 5588 KB Output is correct
2 Correct 8 ms 1620 KB Output is correct
3 Correct 24 ms 3592 KB Output is correct
4 Correct 20 ms 4032 KB Output is correct
5 Correct 27 ms 4992 KB Output is correct
6 Correct 16 ms 3292 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 17 ms 3284 KB Output is correct
9 Correct 41 ms 7912 KB Output is correct
10 Correct 23 ms 4520 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 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 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 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 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 16 ms 2388 KB Output is correct
17 Correct 35 ms 6860 KB Output is correct
18 Correct 58 ms 8008 KB Output is correct
19 Correct 258 ms 7244 KB Output is correct
20 Correct 298 ms 8100 KB Output is correct
21 Correct 30 ms 6588 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 43 ms 3540 KB Output is correct
24 Correct 52 ms 7424 KB Output is correct
25 Correct 9 ms 980 KB Output is correct
26 Correct 35 ms 4740 KB Output is correct
27 Correct 52 ms 5580 KB Output is correct
28 Correct 55 ms 7776 KB Output is correct
29 Correct 14 ms 2876 KB Output is correct
30 Correct 2 ms 468 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 5588 KB Output is correct
2 Correct 8 ms 1620 KB Output is correct
3 Correct 24 ms 3592 KB Output is correct
4 Correct 20 ms 4032 KB Output is correct
5 Correct 27 ms 4992 KB Output is correct
6 Correct 16 ms 3292 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 17 ms 3284 KB Output is correct
9 Correct 41 ms 7912 KB Output is correct
10 Correct 23 ms 4520 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 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 212 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 16 ms 2388 KB Output is correct
27 Correct 35 ms 6860 KB Output is correct
28 Correct 58 ms 8008 KB Output is correct
29 Correct 258 ms 7244 KB Output is correct
30 Correct 298 ms 8100 KB Output is correct
31 Correct 30 ms 6588 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 43 ms 3540 KB Output is correct
34 Correct 52 ms 7424 KB Output is correct
35 Correct 9 ms 980 KB Output is correct
36 Correct 35 ms 4740 KB Output is correct
37 Correct 52 ms 5580 KB Output is correct
38 Correct 55 ms 7776 KB Output is correct
39 Correct 14 ms 2876 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 229 ms 7340 KB Output is correct
42 Correct 74 ms 8304 KB Output is correct
43 Correct 132 ms 7480 KB Output is correct
44 Correct 61 ms 8172 KB Output is correct
45 Correct 45 ms 8676 KB Output is correct
46 Correct 258 ms 8380 KB Output is correct
47 Correct 40 ms 7756 KB Output is correct
48 Correct 95 ms 7812 KB Output is correct
49 Correct 55 ms 7544 KB Output is correct
50 Correct 1208 ms 8252 KB Output is correct
51 Correct 1294 ms 8652 KB Output is correct
52 Correct 1208 ms 8144 KB Output is correct
53 Correct 1290 ms 8672 KB Output is correct
54 Correct 1199 ms 7976 KB Output is correct
55 Correct 1353 ms 8916 KB Output is correct
56 Correct 1187 ms 7736 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 304 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 312 KB Output is correct
6 Correct 1 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 37 ms 5588 KB Output is correct
10 Correct 8 ms 1620 KB Output is correct
11 Correct 24 ms 3592 KB Output is correct
12 Correct 20 ms 4032 KB Output is correct
13 Correct 27 ms 4992 KB Output is correct
14 Correct 16 ms 3292 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 17 ms 3284 KB Output is correct
17 Correct 41 ms 7912 KB Output is correct
18 Correct 23 ms 4520 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 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 212 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 316 KB Output is correct
34 Correct 16 ms 2388 KB Output is correct
35 Correct 35 ms 6860 KB Output is correct
36 Correct 58 ms 8008 KB Output is correct
37 Correct 258 ms 7244 KB Output is correct
38 Correct 298 ms 8100 KB Output is correct
39 Correct 30 ms 6588 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 43 ms 3540 KB Output is correct
42 Correct 52 ms 7424 KB Output is correct
43 Correct 9 ms 980 KB Output is correct
44 Correct 35 ms 4740 KB Output is correct
45 Correct 52 ms 5580 KB Output is correct
46 Correct 55 ms 7776 KB Output is correct
47 Correct 14 ms 2876 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 229 ms 7340 KB Output is correct
50 Correct 74 ms 8304 KB Output is correct
51 Correct 132 ms 7480 KB Output is correct
52 Correct 61 ms 8172 KB Output is correct
53 Correct 45 ms 8676 KB Output is correct
54 Correct 258 ms 8380 KB Output is correct
55 Correct 40 ms 7756 KB Output is correct
56 Correct 95 ms 7812 KB Output is correct
57 Correct 55 ms 7544 KB Output is correct
58 Correct 1208 ms 8252 KB Output is correct
59 Correct 1294 ms 8652 KB Output is correct
60 Correct 1208 ms 8144 KB Output is correct
61 Correct 1290 ms 8672 KB Output is correct
62 Correct 1199 ms 7976 KB Output is correct
63 Correct 1353 ms 8916 KB Output is correct
64 Correct 1187 ms 7736 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 1288 ms 8372 KB Output is correct
68 Correct 1267 ms 8332 KB Output is correct
69 Correct 1110 ms 7304 KB Output is correct
70 Correct 1244 ms 8012 KB Output is correct
71 Correct 1223 ms 7960 KB Output is correct
72 Correct 1175 ms 7812 KB Output is correct
73 Correct 1165 ms 7628 KB Output is correct
74 Correct 1259 ms 8268 KB Output is correct
75 Correct 1239 ms 7884 KB Output is correct
76 Correct 1288 ms 8416 KB Output is correct
77 Correct 193 ms 8920 KB Output is correct
78 Correct 62 ms 7956 KB Output is correct
79 Correct 137 ms 7600 KB Output is correct
80 Correct 137 ms 7968 KB Output is correct
81 Correct 127 ms 7360 KB Output is correct
82 Correct 106 ms 8412 KB Output is correct
83 Correct 78 ms 7716 KB Output is correct
84 Correct 763 ms 8624 KB Output is correct
85 Correct 1385 ms 8808 KB Output is correct
86 Correct 2 ms 212 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1367 ms 8900 KB Output is correct
89 Correct 263 ms 1900 KB Output is correct
90 Correct 1 ms 300 KB Output is correct