답안 #93076 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93076	2019-01-06T11:37:40 Z	Makhsud	Chessboard (IZhO18_chessboard)	C++17	39 / 100	149 ms	1784 KB

chessboard

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

ll n, k, x, y, xx, yy;
ll 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) );
}
ll d[50000][5][5];
vector<ll>divs;
void subt3()
{
	for ( int i = 1; i < n; i ++ ){
		if ( n % i == 0 )
			divs.push_back((ll)i);
	}
	for ( int i = 1; i <= k; i ++ ) {
		cin >> x >> y >> xx >> yy;
		for ( auto e: divs ) {
			ll c, r;
			r = ( x / e ) + ( x % e && 1 );
			c = ( y / e ) + ( y % e && 1 );
			d[e][r%2][c%2] ++;
		}
	}
	ll cnt1 = 0, cnt2 = 0, mn = INT_MAX;
	for ( auto e: divs ){
		cnt1 = cnt2 = 0;
		for ( int i = 1; i <= n/e; i ++ ) {
			if ( i % 2 == 1 ) {
				cnt1 += ( (e*e) * ((n/e )/2) );
				cnt2 += ( (e*e) * (((n/e )+1)/2) );
			} else {
				cnt2 += ( (e*e) * ((n/e )/2) );
				cnt1 += ( (e*e) * (((n/e )+1)/2) );
			}
		}
		cnt1 += (d[e][1][1] + d[e][0][0]);
		cnt1 -= (d[e][1][0] + d[e][0][1]);

		cnt2 += (d[e][1][0] + d[e][0][1]);
		cnt2 -= (d[e][1][1] + d[e][0][0]);
		mn = min( mn, min( cnt1, cnt2 ) );
	}
	cout << mn;
}

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

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

	if ( k != 0 ) {
		subt3();
		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

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

Subtask #2
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	74 ms	1784 KB	Output is correct
2	Correct	19 ms	688 KB	Output is correct
3	Incorrect	51 ms	1244 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	3 ms	256 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	3 ms	256 KB	Output is correct
13	Correct	3 ms	256 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	29 ms	708 KB	Output is correct
17	Correct	73 ms	1220 KB	Output is correct
18	Correct	89 ms	1220 KB	Output is correct
19	Correct	127 ms	1272 KB	Output is correct
20	Correct	149 ms	1260 KB	Output is correct
21	Correct	71 ms	1144 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	43 ms	1016 KB	Output is correct
24	Correct	88 ms	1144 KB	Output is correct
25	Correct	11 ms	504 KB	Output is correct
26	Correct	54 ms	1248 KB	Output is correct
27	Correct	69 ms	1272 KB	Output is correct
28	Correct	89 ms	1144 KB	Output is correct
29	Correct	30 ms	888 KB	Output is correct
30	Correct	4 ms	376 KB	Output is correct

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	74 ms	1784 KB	Output is correct
2	Correct	19 ms	688 KB	Output is correct
3	Incorrect	51 ms	1244 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	252 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	74 ms	1784 KB	Output is correct
10	Correct	19 ms	688 KB	Output is correct
11	Incorrect	51 ms	1244 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

답안 #93076

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 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
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