oj.uz

Submission #93088

# Submission time Handle Problem Language Result Execution time Memory
93088 2019-01-06T12:09:37 Z Makhsud Chessboard (IZhO18_chessboard) C++17
16 / 100
 97 ms 392 KB 
#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 )/2)+1));
			} else {
				cnt2 += ( (e*e) * ((n/e )/2) );
				cnt1 += ( (e*e) * (((n/e )/2)+1));
			}
		}
		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 ){
		subt2();
		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

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 256 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 50 ms 392 KB Output is correct
4 Correct 44 ms 256 KB Output is correct
5 Correct 62 ms 376 KB Output is correct
6 Correct 41 ms 256 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 380 KB Output is correct
10 Correct 57 ms 376 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Incorrect 2 ms 256 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Incorrect 2 ms 256 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 256 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 50 ms 392 KB Output is correct
4 Correct 44 ms 256 KB Output is correct
5 Correct 62 ms 376 KB Output is correct
6 Correct 41 ms 256 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 380 KB Output is correct
10 Correct 57 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Incorrect 2 ms 256 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 71 ms 256 KB Output is correct
10 Correct 19 ms 376 KB Output is correct
11 Correct 50 ms 392 KB Output is correct
12 Correct 44 ms 256 KB Output is correct
13 Correct 62 ms 376 KB Output is correct
14 Correct 41 ms 256 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 380 KB Output is correct
18 Correct 57 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Incorrect 2 ms 256 KB Output isn't correct
25 Halted 0 ms 0 KB -