oj.uz

Submission #334389

# Submission time Handle Problem Language Result Execution time Memory
334389 2020-12-09T05:47:36 Z tengiz05 Chessboard (IZhO18_chessboard) C++17
39 / 100
 94 ms 2664 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, m, k;

void solve(int test_case){
	int i, j;
	cin >> n >> k;
	vector<pii> v;
	for(i=0;i<k;i++){
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		v.pb({x1, y1});
	}
	int ans = mod;
	
	for(int s=1; (int)s*s<=n; s++){
		if(n%s == 0){
			{
				int tmp = (int)s*s;
				int sum = ((int)(n*n/tmp)/2ll)*tmp;
				int sz = (s);
				int ans1=sum;
				for(i=0;i<k;i++){
					auto [x, y] = v[i];
					x+=sz-1, y+=sz-1;
					x/=sz, y/=sz;
					if((x+y)%2 == 0){
						ans1++;
					}else ans1--;
				}
				ans = min(ans, ans1);
			//	cout << ans << ' ';
				if((n*n/tmp)%2!=0)sum += tmp;
				ans1 = sum;
				
				for(i=0;i<k;i++){
					auto [x, y] = v[i];
					x+=sz-1, y+=sz-1;
					x/=sz, y/=sz;
					if((x+y)%2 == 1){
						ans1++;
					}else ans1--;
				}
				ans = min(ans, ans1);
			//	cout << ans << ' ';
			}
			if((int)s*s != n && s != 1){
				int sz = (n/s);
				int tmp = (int)(sz)*(sz);
				int sum = ((int)(n*n/tmp)/2ll)*tmp;
				int ans1=sum;
				for(i=0;i<k;i++){
					auto [x, y] = v[i];
					x+=sz-1, y+=sz-1;
					x/=sz, y/=sz;
					if((x+y)%2 == 0){
						ans1++;
					}else ans1--;
				}
				ans = min(ans, ans1);
			//	cout << ans << ' ';
				if((int)(n*n/tmp)%2ll!=0)sum += tmp;
				ans1 = sum;
				
				for(i=0;i<k;i++){
					auto [x, y] = v[i];
					x+=sz-1, y+=sz-1;
					x/=sz, y/=sz;
					if((x+y)%2 == 1){
						ans1++;
					}else ans1--;
				}
				ans = min(ans, ans1);
			//	cout << ans << ' ';
			}
		}
	}
	cout << ans << '\n';
	return;
}
/*

4 4
4 1 4 1
4 2 4 2
4 3 4 3
4 4 4 4


6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6

5 4
1 2 1 2
1 3 1 3
1 4 1 4
2 2 2 2

3 9
1 1 1 1
2 2 2 2
3 3 3 3
1 2 1 2
1 3 1 3
2 1 2 1
3 1 3 1
3 2 3 2
2 3 2 3


*/
signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Compilation message

chessboard.cpp: In function 'void solve(long long int)':
chessboard.cpp:17:9: warning: unused variable 'j' [-Wunused-variable]
   17 |  int i, j;
      |         ^

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 1516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 11 ms 1008 KB Output is correct
17 Correct 29 ms 2664 KB Output is correct
18 Correct 38 ms 2536 KB Output is correct
19 Correct 85 ms 2536 KB Output is correct
20 Correct 94 ms 2536 KB Output is correct
21 Correct 28 ms 2536 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 25 ms 1516 KB Output is correct
24 Correct 35 ms 2536 KB Output is correct
25 Correct 5 ms 748 KB Output is correct
26 Correct 24 ms 1644 KB Output is correct
27 Correct 30 ms 2536 KB Output is correct
28 Correct 42 ms 2536 KB Output is correct
29 Correct 12 ms 1516 KB Output is correct
30 Correct 2 ms 492 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 1516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Incorrect 29 ms 1516 KB Output isn't correct
10 Halted 0 ms 0 KB -