Submission #92978

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
92978	2019-01-06T09:33:13 Z	Makhsud	Chessboard (IZhO18_chessboard)	C++17	47 / 100	128 ms	5268 KB

chessboard

#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll n, k, x, y, xx, yy;
ll d, mn = INT_MAX;

ll ch ( ll del ) {
	ll ans = 0;
	if ( del == 1 ) {
		return (n*n)/2;
	}
	for ( int i = 1; i <= (n/del); i ++ ) {
		if ( i % 2 == 1 ) {
			ans += (del*del) * ( (n/del) / 2 );

		}
		else {
			ans += (del*del) * ( ( ( n/del )+1) / 2 );

		}
	}
	return ans;
}
ll a[5][5];
void subt2()
{
	for ( int i = 1; i <= k; i ++ ) {
		cin >> x >> y >> xx >> yy;
		a[x%2][y%2]++;
	}
	ll a1 = 0, a2 = 0;
	a1 = (n*n) / 2;
	a2 = a1 + 1;

	a2 = a2 - (a[1][1] + a[0][0]);
	a2 = a2 + (a[1][0] + a[0][1]);

	a1 = a1 - (a[1][0] + a[0][1]);
	a1 = a1 + (a[1][1] + a[0][0]);

	cout << min ( (a1), (a2) );
}
bool used[10005][10005];
ll NumOfPainted( ll s, ll e, ll de ) {
	ll num = 0;
	for ( int i = s; i <= s+de-1; i ++ ){
		for ( int j = e; j <= e+de-1; j ++ ) {
			if ( used[i][j] ) num ++;
		}
	}
	return num;
}
ll subt3( ll del )
{
	ll cnt1 = 0, cnt2 = 0, c=0, d=0;
	for ( int i = 1; i <= n; i += del ) {
		c ++;
		for ( int j = 1; j <= n; j += del ) {
			d ++;
			if ( (c % 2 == 1 && d % 2 == 0) || (c % 2 == 0 && d % 2 == 1) ) {
				cnt1 += ( (del*del) - NumOfPainted(i,j,del) );
				cnt2 += NumOfPainted(i,j,del);
			}
			if ( (c % 2 == 1 && d % 2 == 1) || (c % 2 == 0 && d % 2 == 0) ) {
				cnt1 += NumOfPainted(i,j,del);
				cnt2 += ( (del*del) - NumOfPainted(i,j,del) );
			}
		}
		d = 0;
	}
	return min(cnt1,cnt2);
}

int main()
{
	cin >> n >> k;
	ll cnt = 0;
	for ( int i = 1; i <= n; i ++ )
		if ( n % i == 0 ) cnt ++;

	if ( cnt == 2 ){
		subt2();
		return 0;
	}

	if ( k != 0 ) {
		ll MN = INT_MAX;
		for ( int i = 1; i <= k; i ++ ) {
			cin >> x >> y >> xx >> yy;
			used[x][y] = true;
		}
		for ( int i = 1; i < n; i ++ ) {
			if ( n % i == 0 ) {
				ll an = subt3(i);
				//cout << an << '\n';
				MN = min (MN, an);
			}
		}
		cout << MN;
		return 0;
	}

	for ( int i = 1; i < n; i ++ ) {
		if ( n % i == 0 ) {
			ll an = ch(i);
			mn = min ( mn, an );
		}
	}
	cout << mn;
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct

Subtask #2
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	71 ms	376 KB	Output is correct
2	Correct	19 ms	256 KB	Output is correct
3	Correct	46 ms	364 KB	Output is correct
4	Correct	44 ms	256 KB	Output is correct
5	Correct	65 ms	252 KB	Output is correct
6	Correct	40 ms	360 KB	Output is correct
7	Correct	10 ms	376 KB	Output is correct
8	Correct	40 ms	376 KB	Output is correct
9	Correct	97 ms	256 KB	Output is correct
10	Correct	55 ms	256 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	632 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	632 KB	Output is correct
4	Correct	3 ms	632 KB	Output is correct
5	Correct	2 ms	632 KB	Output is correct
6	Correct	2 ms	632 KB	Output is correct
7	Correct	3 ms	632 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	2 ms	632 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	632 KB	Output is correct
14	Correct	2 ms	636 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct

Subtask #4
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	632 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	632 KB	Output is correct
4	Correct	3 ms	632 KB	Output is correct
5	Correct	2 ms	632 KB	Output is correct
6	Correct	2 ms	632 KB	Output is correct
7	Correct	3 ms	632 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	2 ms	632 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	632 KB	Output is correct
14	Correct	2 ms	636 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	35 ms	5024 KB	Output is correct
17	Correct	72 ms	356 KB	Output is correct
18	Correct	97 ms	5240 KB	Output is correct
19	Correct	118 ms	5096 KB	Output is correct
20	Correct	128 ms	5112 KB	Output is correct
21	Correct	66 ms	356 KB	Output is correct
22	Correct	29 ms	1784 KB	Output is correct
23	Correct	53 ms	5112 KB	Output is correct
24	Correct	89 ms	5268 KB	Output is correct
25	Correct	24 ms	4852 KB	Output is correct
26	Correct	60 ms	5112 KB	Output is correct
27	Correct	75 ms	5100 KB	Output is correct
28	Correct	97 ms	4984 KB	Output is correct
29	Correct	29 ms	256 KB	Output is correct
30	Correct	16 ms	4472 KB	Output is correct

Subtask #5
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	71 ms	376 KB	Output is correct
2	Correct	19 ms	256 KB	Output is correct
3	Correct	46 ms	364 KB	Output is correct
4	Correct	44 ms	256 KB	Output is correct
5	Correct	65 ms	252 KB	Output is correct
6	Correct	40 ms	360 KB	Output is correct
7	Correct	10 ms	376 KB	Output is correct
8	Correct	40 ms	376 KB	Output is correct
9	Correct	97 ms	256 KB	Output is correct
10	Correct	55 ms	256 KB	Output is correct
11	Correct	2 ms	632 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	632 KB	Output is correct
14	Correct	3 ms	632 KB	Output is correct
15	Correct	2 ms	632 KB	Output is correct
16	Correct	2 ms	632 KB	Output is correct
17	Correct	3 ms	632 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	632 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	504 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	2 ms	632 KB	Output is correct
24	Correct	2 ms	636 KB	Output is correct
25	Correct	2 ms	504 KB	Output is correct
26	Correct	35 ms	5024 KB	Output is correct
27	Correct	72 ms	356 KB	Output is correct
28	Correct	97 ms	5240 KB	Output is correct
29	Correct	118 ms	5096 KB	Output is correct
30	Correct	128 ms	5112 KB	Output is correct
31	Correct	66 ms	356 KB	Output is correct
32	Correct	29 ms	1784 KB	Output is correct
33	Correct	53 ms	5112 KB	Output is correct
34	Correct	89 ms	5268 KB	Output is correct
35	Correct	24 ms	4852 KB	Output is correct
36	Correct	60 ms	5112 KB	Output is correct
37	Correct	75 ms	5100 KB	Output is correct
38	Correct	97 ms	4984 KB	Output is correct
39	Correct	29 ms	256 KB	Output is correct
40	Correct	16 ms	4472 KB	Output is correct
41	Runtime error	5 ms	376 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
42	Halted	0 ms	0 KB	-

Subtask #6
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	71 ms	376 KB	Output is correct
10	Correct	19 ms	256 KB	Output is correct
11	Correct	46 ms	364 KB	Output is correct
12	Correct	44 ms	256 KB	Output is correct
13	Correct	65 ms	252 KB	Output is correct
14	Correct	40 ms	360 KB	Output is correct
15	Correct	10 ms	376 KB	Output is correct
16	Correct	40 ms	376 KB	Output is correct
17	Correct	97 ms	256 KB	Output is correct
18	Correct	55 ms	256 KB	Output is correct
19	Correct	2 ms	632 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	632 KB	Output is correct
22	Correct	3 ms	632 KB	Output is correct
23	Correct	2 ms	632 KB	Output is correct
24	Correct	2 ms	632 KB	Output is correct
25	Correct	3 ms	632 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	2 ms	632 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	504 KB	Output is correct
30	Correct	2 ms	256 KB	Output is correct
31	Correct	2 ms	632 KB	Output is correct
32	Correct	2 ms	636 KB	Output is correct
33	Correct	2 ms	504 KB	Output is correct
34	Correct	35 ms	5024 KB	Output is correct
35	Correct	72 ms	356 KB	Output is correct
36	Correct	97 ms	5240 KB	Output is correct
37	Correct	118 ms	5096 KB	Output is correct
38	Correct	128 ms	5112 KB	Output is correct
39	Correct	66 ms	356 KB	Output is correct
40	Correct	29 ms	1784 KB	Output is correct
41	Correct	53 ms	5112 KB	Output is correct
42	Correct	89 ms	5268 KB	Output is correct
43	Correct	24 ms	4852 KB	Output is correct
44	Correct	60 ms	5112 KB	Output is correct
45	Correct	75 ms	5100 KB	Output is correct
46	Correct	97 ms	4984 KB	Output is correct
47	Correct	29 ms	256 KB	Output is correct
48	Correct	16 ms	4472 KB	Output is correct
49	Runtime error	5 ms	376 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
50	Halted	0 ms	0 KB	-

Submission #92978

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 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
0 / 23.0

Subtask #6
0 / 30.0