oj.uz

Submission #495155

# Submission time Handle Problem Language Result Execution time Memory
495155 2021-12-18T05:51:45 Z mansur Chessboard (IZhO18_chessboard) C++14
47 / 100
 222 ms 484 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 = 1e9, 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 1 ms 336 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 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 0 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 392 KB Output is correct
2 Correct 6 ms 372 KB Output is correct
3 Correct 12 ms 332 KB Output is correct
4 Correct 14 ms 380 KB Output is correct
5 Correct 20 ms 452 KB Output is correct
6 Correct 15 ms 328 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 10 ms 364 KB Output is correct
9 Correct 26 ms 388 KB Output is correct
10 Correct 17 ms 324 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 320 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 0 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 0 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 1 ms 324 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 328 KB Output is correct
16 Correct 14 ms 340 KB Output is correct
17 Correct 23 ms 436 KB Output is correct
18 Correct 44 ms 376 KB Output is correct
19 Correct 83 ms 364 KB Output is correct
20 Correct 94 ms 460 KB Output is correct
21 Correct 20 ms 360 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 25 ms 332 KB Output is correct
24 Correct 44 ms 364 KB Output is correct
25 Correct 5 ms 324 KB Output is correct
26 Correct 26 ms 332 KB Output is correct
27 Correct 34 ms 336 KB Output is correct
28 Correct 43 ms 332 KB Output is correct
29 Correct 9 ms 484 KB Output is correct
30 Correct 2 ms 332 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 392 KB Output is correct
2 Correct 6 ms 372 KB Output is correct
3 Correct 12 ms 332 KB Output is correct
4 Correct 14 ms 380 KB Output is correct
5 Correct 20 ms 452 KB Output is correct
6 Correct 15 ms 328 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 10 ms 364 KB Output is correct
9 Correct 26 ms 388 KB Output is correct
10 Correct 17 ms 324 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 320 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 0 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 0 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 1 ms 324 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 328 KB Output is correct
26 Correct 14 ms 340 KB Output is correct
27 Correct 23 ms 436 KB Output is correct
28 Correct 44 ms 376 KB Output is correct
29 Correct 83 ms 364 KB Output is correct
30 Correct 94 ms 460 KB Output is correct
31 Correct 20 ms 360 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 25 ms 332 KB Output is correct
34 Correct 44 ms 364 KB Output is correct
35 Correct 5 ms 324 KB Output is correct
36 Correct 26 ms 332 KB Output is correct
37 Correct 34 ms 336 KB Output is correct
38 Correct 43 ms 332 KB Output is correct
39 Correct 9 ms 484 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Incorrect 222 ms 332 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 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 0 ms 204 KB Output is correct
9 Correct 22 ms 392 KB Output is correct
10 Correct 6 ms 372 KB Output is correct
11 Correct 12 ms 332 KB Output is correct
12 Correct 14 ms 380 KB Output is correct
13 Correct 20 ms 452 KB Output is correct
14 Correct 15 ms 328 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 10 ms 364 KB Output is correct
17 Correct 26 ms 388 KB Output is correct
18 Correct 17 ms 324 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 320 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 0 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 0 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 1 ms 324 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 328 KB Output is correct
34 Correct 14 ms 340 KB Output is correct
35 Correct 23 ms 436 KB Output is correct
36 Correct 44 ms 376 KB Output is correct
37 Correct 83 ms 364 KB Output is correct
38 Correct 94 ms 460 KB Output is correct
39 Correct 20 ms 360 KB Output is correct
40 Correct 1 ms 312 KB Output is correct
41 Correct 25 ms 332 KB Output is correct
42 Correct 44 ms 364 KB Output is correct
43 Correct 5 ms 324 KB Output is correct
44 Correct 26 ms 332 KB Output is correct
45 Correct 34 ms 336 KB Output is correct
46 Correct 43 ms 332 KB Output is correct
47 Correct 9 ms 484 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Incorrect 222 ms 332 KB Output isn't correct
50 Halted 0 ms 0 KB -