oj.uz

Submission #495092

# Submission time Handle Problem Language Result Execution time Memory
495092 2021-12-18T04:43:41 Z armashka Chessboard (IZhO18_chessboard) C++17
47 / 100
 156 ms 6432 KB 
#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e9;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
                     
struct node {
	ll x1, y1, x2, y2;
};
                                               
ll n, k, ans = inf;
bool bl[1005][1005];
node que[100005]; 

void check(int razmer) {
	ll cnt = 0;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= n; ++ j) {
			int num = ((i - 1) / razmer) + ((j - 1) / razmer);
			if (even(num) && !bl[i][j]) ++ cnt;
			if (odd(num) && bl[i][j]) ++ cnt; 
		}
	}
	//cout << razmer << " " << min(cnt, n * n - cnt) << "\n";
	ans = min(ans, min(cnt, n * n - cnt));
	return;
}
 
const void solve(/*Armashka*/) {
	cin >> n >> k;
	ll c1 = (n * n) / 2, c2 = (n * n) - c1, cnt1 = 0, cnt2 = 0;
	bool ok = 1;
	for (int i = 1; i <= k; ++ i) {
		ll x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		que[i] = {x1, y1, x2, y2};
		if (x1 % 2 == y1 % 2) ++ cnt2;
		else ++ cnt1;
	}
	for (int i = 2; i * i <= n; ++ i) {
		if (n % i == 0) { ok = 0; break; }
	}
	if (ok) {
		cout << min((c1 - cnt1) + cnt2, (c2 - cnt2) + cnt1) << "\n";
		return;
	}
	for (int i = 1; i <= k; ++ i) {
		for (int j = que[i].y1; j <= que[i].y2; ++ j) {
			for (int h = que[i].x1; h <= que[i].x2; ++ h) bl[j][h] = 1;
		}
	}
	for (int i = 1; i * i <= n; ++ i) {
		if (n % i == 0) {
			check(i);
			if (n / i != i && i > 1) check(n / i);
		}
	}
	cout << ans << "\n";
}
 
signed main() {
    fast;
	//freopen("divide.in", "r", stdin);
	//freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
    	solve();
	}
}
 
/*
 
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
 
*/
 
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
 
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 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 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2380 KB Output is correct
2 Correct 5 ms 764 KB Output is correct
3 Correct 11 ms 1484 KB Output is correct
4 Correct 13 ms 1704 KB Output is correct
5 Correct 16 ms 1952 KB Output is correct
6 Correct 10 ms 1296 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 10 ms 1356 KB Output is correct
9 Correct 26 ms 3112 KB Output is correct
10 Correct 15 ms 1768 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 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 332 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 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 332 KB Output is correct
16 Correct 24 ms 2116 KB Output is correct
17 Correct 21 ms 2940 KB Output is correct
18 Correct 42 ms 4340 KB Output is correct
19 Correct 156 ms 4012 KB Output is correct
20 Correct 155 ms 4320 KB Output is correct
21 Correct 19 ms 2764 KB Output is correct
22 Correct 81 ms 1180 KB Output is correct
23 Correct 49 ms 2596 KB Output is correct
24 Correct 38 ms 4092 KB Output is correct
25 Correct 41 ms 1484 KB Output is correct
26 Correct 30 ms 3012 KB Output is correct
27 Correct 43 ms 3376 KB Output is correct
28 Correct 41 ms 4228 KB Output is correct
29 Correct 8 ms 1356 KB Output is correct
30 Correct 18 ms 1356 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2380 KB Output is correct
2 Correct 5 ms 764 KB Output is correct
3 Correct 11 ms 1484 KB Output is correct
4 Correct 13 ms 1704 KB Output is correct
5 Correct 16 ms 1952 KB Output is correct
6 Correct 10 ms 1296 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 10 ms 1356 KB Output is correct
9 Correct 26 ms 3112 KB Output is correct
10 Correct 15 ms 1768 KB Output is correct
11 Correct 1 ms 332 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 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 24 ms 2116 KB Output is correct
27 Correct 21 ms 2940 KB Output is correct
28 Correct 42 ms 4340 KB Output is correct
29 Correct 156 ms 4012 KB Output is correct
30 Correct 155 ms 4320 KB Output is correct
31 Correct 19 ms 2764 KB Output is correct
32 Correct 81 ms 1180 KB Output is correct
33 Correct 49 ms 2596 KB Output is correct
34 Correct 38 ms 4092 KB Output is correct
35 Correct 41 ms 1484 KB Output is correct
36 Correct 30 ms 3012 KB Output is correct
37 Correct 43 ms 3376 KB Output is correct
38 Correct 41 ms 4228 KB Output is correct
39 Correct 8 ms 1356 KB Output is correct
40 Correct 18 ms 1356 KB Output is correct
41 Runtime error 31 ms 6432 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 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 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 20 ms 2380 KB Output is correct
10 Correct 5 ms 764 KB Output is correct
11 Correct 11 ms 1484 KB Output is correct
12 Correct 13 ms 1704 KB Output is correct
13 Correct 16 ms 1952 KB Output is correct
14 Correct 10 ms 1296 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 10 ms 1356 KB Output is correct
17 Correct 26 ms 3112 KB Output is correct
18 Correct 15 ms 1768 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 24 ms 2116 KB Output is correct
35 Correct 21 ms 2940 KB Output is correct
36 Correct 42 ms 4340 KB Output is correct
37 Correct 156 ms 4012 KB Output is correct
38 Correct 155 ms 4320 KB Output is correct
39 Correct 19 ms 2764 KB Output is correct
40 Correct 81 ms 1180 KB Output is correct
41 Correct 49 ms 2596 KB Output is correct
42 Correct 38 ms 4092 KB Output is correct
43 Correct 41 ms 1484 KB Output is correct
44 Correct 30 ms 3012 KB Output is correct
45 Correct 43 ms 3376 KB Output is correct
46 Correct 41 ms 4228 KB Output is correct
47 Correct 8 ms 1356 KB Output is correct
48 Correct 18 ms 1356 KB Output is correct
49 Runtime error 31 ms 6432 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -