답안 #1002501

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002501	2024-06-19T15:31:13 Z	Tob	Chessboard (IZhO18_chessboard)	C++14	70 / 100	208 ms	4232 KB

chessboard

#include <bits/stdc++.h>

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;

const int N = 1e5 + 7;

ll n, m;
pair <pii, pii> re[N];

int main () {
	FIO;
	cin >> n >> m;
	
	for (int i = 0; i < m; i++) {
		int x, y, x2, y2; cin >> x >> y >> x2 >> y2; x--; y--; x2--; y2--;
		re[i] = {{x, y}, {x2, y2}};
	}
	
	ll mn = 1e18;
	for (ll i = 1; i < n; i++) {
		if (n % i) continue;
		ll cnt[2] = {0};
		for (int j = 0; j < m; j++) {
			ll a = re[j].F.F, b = re[j].F.S, c = re[j].S.F, d = re[j].S.S;
			ll aa = a/i*i+i, bb = b/i*i+i, cc = c/i*i-1, dd = d/i*i-1;
			ll ro = (cc-aa+1)/i, co = (dd-bb+1)/i;
			int o = (aa/i+bb/i)%2;
			if (ro < 0 && co < 0) {
				cnt[o] += (c-a+1)*(d-b+1);
				continue;
			}
			if (ro < 0) {
				ro = c-a+1;
				cnt[o] += ro*(bb-b);
				cnt[(o+co+1)&1] += ro*(d-dd);
				cnt[0] += ro*(co/2+(co&1&&o==1));
				cnt[1] += ro*(co/2+(co&1&&o==0));
				continue;
			}
			if (co < 0) {
				co = d-b+1;
				cnt[o] += co*(aa-a);
				cnt[(o+ro+1)&1] += co*(c-cc);
				cnt[0] += co*(ro/2+(ro&1&&o==1));
				cnt[1] += co*(ro/2+(ro&1&&o==0));
				continue;
			}
			
			cnt[0] += ro*co/2*i*i; cnt[1] += ro*co/2*i*i;
			if (ro*co&1) cnt[o] += i*i;
			
			cnt[0] += (ro/2+(o&&ro&1))*(bb-b)*i + (ro/2+((o+co)%2==0&&ro&1))*(d-dd)*i;
			cnt[1] += (ro/2+(o^1&&ro&1))*(bb-b)*i + (ro/2+((o+co)%2==1&&ro&1))*(d-dd)*i;
			
			cnt[0] += (co/2+(o&&co&1))*(aa-a)*i + (co/2+((o+ro)%2==0&&co&1))*(c-cc)*i;
			cnt[1] += (co/2+(o^1&&co&1))*(aa-a)*i + (co/2+((o+ro)%2==1&&co&1))*(c-cc)*i;
			
			cnt[o] += (aa-a)*(bb-b);
			cnt[(o+co-1)&1] += (aa-a)*(d-dd);
			cnt[(o+ro-1)&1] += (c-cc)*(bb-b);
			cnt[(o+ro+co)&1] += (c-cc)*(d-dd);
		}
		ll dod = (n/i&1)*i*i;
		ll cost = min((n*n-dod)/2+dod - cnt[0] + cnt[1], (n*n-dod)/2 - cnt[1] + cnt[0]);
		mn = min(mn, cost);
	}
	cout << mn;

	return 0;
}

Subtask #1
8.0 / 8.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	2908 KB	Output is correct
2	Correct	4 ms	848 KB	Output is correct
3	Correct	9 ms	1880 KB	Output is correct
4	Correct	9 ms	1884 KB	Output is correct
5	Correct	12 ms	2540 KB	Output is correct
6	Correct	8 ms	1660 KB	Output is correct
7	Correct	2 ms	604 KB	Output is correct
8	Correct	8 ms	1696 KB	Output is correct
9	Correct	19 ms	3792 KB	Output is correct
10	Correct	11 ms	2396 KB	Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	6 ms	1116 KB	Output is correct
17	Correct	15 ms	3148 KB	Output is correct
18	Correct	21 ms	3460 KB	Output is correct
19	Correct	50 ms	3160 KB	Output is correct
20	Correct	53 ms	3440 KB	Output is correct
21	Correct	15 ms	3160 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	11 ms	1780 KB	Output is correct
24	Correct	19 ms	3164 KB	Output is correct
25	Correct	3 ms	600 KB	Output is correct
26	Correct	12 ms	2196 KB	Output is correct
27	Correct	16 ms	2396 KB	Output is correct
28	Correct	20 ms	3460 KB	Output is correct
29	Correct	6 ms	1448 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	2908 KB	Output is correct
2	Correct	4 ms	848 KB	Output is correct
3	Correct	9 ms	1880 KB	Output is correct
4	Correct	9 ms	1884 KB	Output is correct
5	Correct	12 ms	2540 KB	Output is correct
6	Correct	8 ms	1660 KB	Output is correct
7	Correct	2 ms	604 KB	Output is correct
8	Correct	8 ms	1696 KB	Output is correct
9	Correct	19 ms	3792 KB	Output is correct
10	Correct	11 ms	2396 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	6 ms	1116 KB	Output is correct
27	Correct	15 ms	3148 KB	Output is correct
28	Correct	21 ms	3460 KB	Output is correct
29	Correct	50 ms	3160 KB	Output is correct
30	Correct	53 ms	3440 KB	Output is correct
31	Correct	15 ms	3160 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	11 ms	1780 KB	Output is correct
34	Correct	19 ms	3164 KB	Output is correct
35	Correct	3 ms	600 KB	Output is correct
36	Correct	12 ms	2196 KB	Output is correct
37	Correct	16 ms	2396 KB	Output is correct
38	Correct	20 ms	3460 KB	Output is correct
39	Correct	6 ms	1448 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	43 ms	3676 KB	Output is correct
42	Correct	24 ms	3980 KB	Output is correct
43	Correct	29 ms	3652 KB	Output is correct
44	Correct	31 ms	4020 KB	Output is correct
45	Correct	21 ms	4184 KB	Output is correct
46	Correct	48 ms	4036 KB	Output is correct
47	Correct	24 ms	3676 KB	Output is correct
48	Correct	26 ms	3672 KB	Output is correct
49	Correct	20 ms	3672 KB	Output is correct
50	Correct	163 ms	3932 KB	Output is correct
51	Correct	188 ms	4176 KB	Output is correct
52	Correct	155 ms	4000 KB	Output is correct
53	Correct	173 ms	4232 KB	Output is correct
54	Correct	166 ms	3928 KB	Output is correct
55	Correct	183 ms	4176 KB	Output is correct
56	Correct	151 ms	3668 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	14 ms	2908 KB	Output is correct
10	Correct	4 ms	848 KB	Output is correct
11	Correct	9 ms	1880 KB	Output is correct
12	Correct	9 ms	1884 KB	Output is correct
13	Correct	12 ms	2540 KB	Output is correct
14	Correct	8 ms	1660 KB	Output is correct
15	Correct	2 ms	604 KB	Output is correct
16	Correct	8 ms	1696 KB	Output is correct
17	Correct	19 ms	3792 KB	Output is correct
18	Correct	11 ms	2396 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	6 ms	1116 KB	Output is correct
35	Correct	15 ms	3148 KB	Output is correct
36	Correct	21 ms	3460 KB	Output is correct
37	Correct	50 ms	3160 KB	Output is correct
38	Correct	53 ms	3440 KB	Output is correct
39	Correct	15 ms	3160 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	11 ms	1780 KB	Output is correct
42	Correct	19 ms	3164 KB	Output is correct
43	Correct	3 ms	600 KB	Output is correct
44	Correct	12 ms	2196 KB	Output is correct
45	Correct	16 ms	2396 KB	Output is correct
46	Correct	20 ms	3460 KB	Output is correct
47	Correct	6 ms	1448 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	43 ms	3676 KB	Output is correct
50	Correct	24 ms	3980 KB	Output is correct
51	Correct	29 ms	3652 KB	Output is correct
52	Correct	31 ms	4020 KB	Output is correct
53	Correct	21 ms	4184 KB	Output is correct
54	Correct	48 ms	4036 KB	Output is correct
55	Correct	24 ms	3676 KB	Output is correct
56	Correct	26 ms	3672 KB	Output is correct
57	Correct	20 ms	3672 KB	Output is correct
58	Correct	163 ms	3932 KB	Output is correct
59	Correct	188 ms	4176 KB	Output is correct
60	Correct	155 ms	4000 KB	Output is correct
61	Correct	173 ms	4232 KB	Output is correct
62	Correct	166 ms	3928 KB	Output is correct
63	Correct	183 ms	4176 KB	Output is correct
64	Correct	151 ms	3668 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Incorrect	208 ms	4024 KB	Output isn't correct
68	Halted	0 ms	0 KB	-

답안 #1002501

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 8.0 / 8.0

Subtask #3 15.0 / 15.0

Subtask #4 16.0 / 16.0

Subtask #5 23.0 / 23.0

Subtask #6 0 / 30.0

Subtask #1
8.0 / 8.0

Subtask #2
8.0 / 8.0

Subtask #3
15.0 / 15.0

Subtask #4
16.0 / 16.0

Subtask #5
23.0 / 23.0

Subtask #6
0 / 30.0