oj.uz

Submission #495529

# Submission time Handle Problem Language Result Execution time Memory
495529 2021-12-19T09:21:16 Z AQ0212 Chessboard (IZhO18_chessboard) C++17
39 / 100
 81 ms 2588 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <sstream>
#include <cstring>

#define ll long long int
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define all(x) x.begin(), x.end()

using namespace std;

int inf2 = 2e9;

int x1[ 100111 ], x2[ 100111 ];
int y11[ 100111 ], y2[ 100111 ], ans = inf2;
vector < int > divv;
map < int , int > mp;

int white_first(int sz, int n, int m){
	int sqrs = n / sz;
	int cnt_move = (sqrs & 1) ? ((((sqrs >> 1) * ((sqrs >> 1) + 1)) << 1) * (sz * sz)) : (sqrs >> 1) * (sqrs) * (sz * sz);
	// cout << "w: " << cnt_move << " sz: " << sz << "\n";

	for(int i = 1; i <= m; i ++){
		if(x1[ i ] == x2[ i ] && y11[ i ] == y2[ i ]){
			if(((x1[ i ] + sz - 1) / sz) & 1)
				if(((y11[ i ] + sz - 1) / sz) & 1)
					cnt_move ++;
				else
					cnt_move --;
			else
				if(((y11[ i ] + sz - 1) / sz) & 1)
					cnt_move --;
				else
					cnt_move ++;
			continue;
		}
		for(int j = 1, j2 = 1; j <= n; j += sz, j2 ++){

			if(j <= x1[ i ] && x2[ i ] <= (j2 * sz)){
				for(int k = 1, k2 = 1; k <= n; k += sz, k2 ++){

					if(k <= y11[ i ] && y2[ i ] <= (k2 * sz)){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move += (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
						break;
					}else if(k <= y11[ i ] && y11[ i ] <= (k2 * sz) && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move += (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);

					}else if(y11[ i ] <= k && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - k + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move += (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - k + 1);

					}else{
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - k + 1);
							else
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - k + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - k + 1);
							else
								cnt_move += (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - k + 1);
						// break;
					}
				}

			}else if(j <= x1[ i ] && x1[ i ] <= (j2 * sz) && (j2 * sz) <= x2[ i ]){
				for(int k = 1, k2 = 1; k <= n; k += sz, k2 ++){

					if(k <= y11[ i ] && y2[ i ] <= (k2 * sz)){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
						break;
					}else if(k <= y11[ i ] && y11[ i ] <= (k2 * sz) && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);

					}else if(y11[ i ] <= k && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - k + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - k + 1);

					}else{
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - k + 1);
							else
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - k + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - k + 1);
							else
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - k + 1);
						// break;
					}
				}

			}else if(x1[ i ] <= j && (j2 * sz) <= x2[ i ]){
				for(int k = 1, k2 = 1; k <= n; k += sz, k2 ++){

					if(k <= y11[ i ] && y2[ i ] <= (k2 * sz)){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - j + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move -= ((j2 * sz) - j + 1) * (y2[ i ] - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - j + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move += ((j2 * sz) - j + 1) * (y2[ i ] - y11[ i ] + 1);
						break;
					}else if(k <= y11[ i ] && y11[ i ] <= (k2 * sz) && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - j + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move -= ((j2 * sz) - j + 1) * ((k2 * sz) - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - j + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move += ((j2 * sz) - j + 1) * ((k2 * sz) - y11[ i ] + 1);

					}else if(y11[ i ] <= k && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - j + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move -= ((j2 * sz) - j + 1) * ((k2 * sz) - k + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - j + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move += ((j2 * sz) - j + 1) * ((k2 * sz) - k + 1);

					}else{
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - j + 1) * (y2[ i ] - k + 1);
							else
								cnt_move -= ((j2 * sz) - j + 1) * (y2[ i ] - k + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - j + 1) * (y2[ i ] - k + 1);
							else
								cnt_move += ((j2 * sz) - j + 1) * (y2[ i ] - k + 1);
						// break;
					}
				}

			}else{
				for(int k = 1, k2 = 1; k <= n; k += sz, k2 ++){

					if(k <= y11[ i ] && y2[ i ] <= (k2 * sz)){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - j + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move -= (x2[ i ] - j + 1) * (y2[ i ] - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - j + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move += (x2[ i ] - j + 1) * (y2[ i ] - y11[ i ] + 1);
						break;
					}else if(k <= y11[ i ] && y11[ i ] <= (k2 * sz) && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - j + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move -= (x2[ i ] - j + 1) * ((k2 * sz) - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - j + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move += (x2[ i ] - j + 1) * ((k2 * sz) - y11[ i ] + 1);

					}else if(y11[ i ] <= k && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - j + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move -= (x2[ i ] - j + 1) * ((k2 * sz) - k + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - j + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move += (x2[ i ] - j + 1) * ((k2 * sz) - k + 1);

					}else{
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - j + 1) * (y2[ i ] - k + 1);
							else
								cnt_move -= (x2[ i ] - j + 1) * (y2[ i ] - k + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - j + 1) * (y2[ i ] - k + 1);
							else
								cnt_move += (x2[ i ] - j + 1) * (y2[ i ] - k + 1);
						// break;
					}
				}

			}
		}
	}

	return cnt_move;
}

int main(){
	int n, m;

	cin >> n >> m;

	for(int i = 1; i <= m; i ++){
		scanf("%d%d%d%d", &x1[ i ], &y11[ i ], &x2[ i ], &y2[ i ]);
	}

	divv.pb(1);
	for(int i = 2; i <= ((int)ceil(sqrt(n))); i ++){
		if(n % i == 0 && !mp[ i ] && i != n){
			divv.pb(i);
			mp[ i ] ++;
			if(!mp[ n / i ]){
				divv.pb(n / i);
				mp[ n / i ] ++;
			}
		}
	}

	sort(all(divv));

	for(int i = 0; i < divv.size(); i ++){
		int white = white_first(divv[ i ], n, m);
		
		ans = min(ans, min((n * n) - white, white));
		// cout << white << " " << (n * n) - white << "\n";
	}

	cout << ans;
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:294:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  294 |  for(int i = 0; i < divv.size(); i ++){
      |                 ~~^~~~~~~~~~~~~
chessboard.cpp:277:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  277 |   scanf("%d%d%d%d", &x1[ i ], &y11[ i ], &x2[ i ], &y2[ i ]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1928 KB Output is correct
2 Correct 6 ms 816 KB Output is correct
3 Incorrect 14 ms 1604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 308 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 9 ms 1080 KB Output is correct
17 Correct 25 ms 2368 KB Output is correct
18 Correct 32 ms 2588 KB Output is correct
19 Correct 63 ms 2428 KB Output is correct
20 Correct 81 ms 2524 KB Output is correct
21 Correct 23 ms 2292 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 21 ms 1564 KB Output is correct
24 Correct 29 ms 2416 KB Output is correct
25 Correct 4 ms 540 KB Output is correct
26 Correct 24 ms 1864 KB Output is correct
27 Correct 23 ms 2116 KB Output is correct
28 Correct 32 ms 2440 KB Output is correct
29 Correct 17 ms 1264 KB Output is correct
30 Correct 1 ms 332 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1928 KB Output is correct
2 Correct 6 ms 816 KB Output is correct
3 Incorrect 14 ms 1604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 21 ms 1928 KB Output is correct
10 Correct 6 ms 816 KB Output is correct
11 Incorrect 14 ms 1604 KB Output isn't correct
12 Halted 0 ms 0 KB -