oj.uz

Submission #495156

# Submission time Handle Problem Language Result Execution time Memory
495156 2021-12-18T05:52:11 Z mansur Chessboard (IZhO18_chessboard) C++14
70 / 100
 513 ms 780 KB 
#include<bits/stdc++.h>	
 
/*
#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
*/

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e18, N = 2e5 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int n, k;

int cnt0[N], cnt1[N];

void f(int x, int y, int val) {
	x = (x + val - 1) / val;
	y = (y + val - 1) / val;
	if (x % 2 == y % 2) cnt0[val]++;
	else cnt1[val]++;
}

bool prime(int n) {
	for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return 0;
	return 1;
}

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	cin >> n >> k;
	if (prime(n)) {
		int cnt0 = 0, cnt1 = 0;
		for (int i = 1; i <= k; i++) {
			int x1, y1, x2, y2;
			cin >> x1 >> y1 >> x2 >> y2;
			if (x1 % 2 == y1 % 2) {
				cnt0++;
			}else {
				cnt1++;
	        }
		}
		cout << min(cnt0 + n * n / 2 - cnt1, cnt1 + n * n / 2 + 1 - cnt0);
		return 0;
	}
	for (int i = 1; i <= k; i++) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		for (int val = 1; val <= sqrt(n); val++) {
			if (n % val == 0) {
				f(x1, y1, val);
				if (n / val != val)
					f(x1, y1, n / val);
			}	
		}
	}
	int mn = inf;
	for (int i = 1; i < n; i++) {
		if (n % i) continue;
		mn = min(mn, min(cnt0[i] + (n / i * (n / i)) / 2 * i * i - cnt1[i], cnt1[i] + (n / i * (n / i) + 1) / 2 * i * i - cnt0[i]));
	}
	cout << mn;
}

Compilation message

chessboard.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main() {
      | ^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 308 KB Output is correct
2 Correct 8 ms 204 KB Output is correct
3 Correct 16 ms 316 KB Output is correct
4 Correct 19 ms 320 KB Output is correct
5 Correct 17 ms 204 KB Output is correct
6 Correct 19 ms 316 KB Output is correct
7 Correct 4 ms 204 KB Output is correct
8 Correct 10 ms 320 KB Output is correct
9 Correct 35 ms 204 KB Output is correct
10 Correct 14 ms 204 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 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 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 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 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 15 ms 340 KB Output is correct
17 Correct 22 ms 348 KB Output is correct
18 Correct 46 ms 360 KB Output is correct
19 Correct 90 ms 388 KB Output is correct
20 Correct 99 ms 384 KB Output is correct
21 Correct 26 ms 328 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 27 ms 364 KB Output is correct
24 Correct 52 ms 384 KB Output is correct
25 Correct 6 ms 332 KB Output is correct
26 Correct 35 ms 344 KB Output is correct
27 Correct 40 ms 356 KB Output is correct
28 Correct 55 ms 360 KB Output is correct
29 Correct 10 ms 384 KB Output is correct
30 Correct 3 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 308 KB Output is correct
2 Correct 8 ms 204 KB Output is correct
3 Correct 16 ms 316 KB Output is correct
4 Correct 19 ms 320 KB Output is correct
5 Correct 17 ms 204 KB Output is correct
6 Correct 19 ms 316 KB Output is correct
7 Correct 4 ms 204 KB Output is correct
8 Correct 10 ms 320 KB Output is correct
9 Correct 35 ms 204 KB Output is correct
10 Correct 14 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 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 204 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 15 ms 340 KB Output is correct
27 Correct 22 ms 348 KB Output is correct
28 Correct 46 ms 360 KB Output is correct
29 Correct 90 ms 388 KB Output is correct
30 Correct 99 ms 384 KB Output is correct
31 Correct 26 ms 328 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 27 ms 364 KB Output is correct
34 Correct 52 ms 384 KB Output is correct
35 Correct 6 ms 332 KB Output is correct
36 Correct 35 ms 344 KB Output is correct
37 Correct 40 ms 356 KB Output is correct
38 Correct 55 ms 360 KB Output is correct
39 Correct 10 ms 384 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 242 ms 456 KB Output is correct
42 Correct 242 ms 512 KB Output is correct
43 Correct 225 ms 504 KB Output is correct
44 Correct 241 ms 520 KB Output is correct
45 Correct 29 ms 460 KB Output is correct
46 Correct 268 ms 460 KB Output is correct
47 Correct 26 ms 472 KB Output is correct
48 Correct 224 ms 520 KB Output is correct
49 Correct 208 ms 508 KB Output is correct
50 Correct 491 ms 672 KB Output is correct
51 Correct 491 ms 664 KB Output is correct
52 Correct 473 ms 780 KB Output is correct
53 Correct 495 ms 668 KB Output is correct
54 Correct 442 ms 640 KB Output is correct
55 Correct 513 ms 628 KB Output is correct
56 Correct 436 ms 540 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 28 ms 308 KB Output is correct
10 Correct 8 ms 204 KB Output is correct
11 Correct 16 ms 316 KB Output is correct
12 Correct 19 ms 320 KB Output is correct
13 Correct 17 ms 204 KB Output is correct
14 Correct 19 ms 316 KB Output is correct
15 Correct 4 ms 204 KB Output is correct
16 Correct 10 ms 320 KB Output is correct
17 Correct 35 ms 204 KB Output is correct
18 Correct 14 ms 204 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 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 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 2 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 15 ms 340 KB Output is correct
35 Correct 22 ms 348 KB Output is correct
36 Correct 46 ms 360 KB Output is correct
37 Correct 90 ms 388 KB Output is correct
38 Correct 99 ms 384 KB Output is correct
39 Correct 26 ms 328 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 27 ms 364 KB Output is correct
42 Correct 52 ms 384 KB Output is correct
43 Correct 6 ms 332 KB Output is correct
44 Correct 35 ms 344 KB Output is correct
45 Correct 40 ms 356 KB Output is correct
46 Correct 55 ms 360 KB Output is correct
47 Correct 10 ms 384 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 242 ms 456 KB Output is correct
50 Correct 242 ms 512 KB Output is correct
51 Correct 225 ms 504 KB Output is correct
52 Correct 241 ms 520 KB Output is correct
53 Correct 29 ms 460 KB Output is correct
54 Correct 268 ms 460 KB Output is correct
55 Correct 26 ms 472 KB Output is correct
56 Correct 224 ms 520 KB Output is correct
57 Correct 208 ms 508 KB Output is correct
58 Correct 491 ms 672 KB Output is correct
59 Correct 491 ms 664 KB Output is correct
60 Correct 473 ms 780 KB Output is correct
61 Correct 495 ms 668 KB Output is correct
62 Correct 442 ms 640 KB Output is correct
63 Correct 513 ms 628 KB Output is correct
64 Correct 436 ms 540 KB Output is correct
65 Correct 0 ms 332 KB Output is correct
66 Incorrect 1 ms 204 KB Output isn't correct
67 Halted 0 ms 0 KB -