oj.uz

답안 #495055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495055 2021-12-18T04:03:07 Z mansur Chessboard (IZhO18_chessboard) C++14
47 / 100
 237 ms 15860 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 c[1001][1001];

int n, k;

int get(int s, int p) {
	int cnt = p, ans = 0, b[n + 1][n + 1];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) b[i][j] = c[i][j];
	}
	for (int i = 1; i <= n; i += s) {
		for (int j = 1; j <= n; j += s) {
			if (i != 1) {
				if (b[i - 1][j]) cnt = 0;
				else cnt = 1;
			}
			if (j != 1) {
				if (b[i][j - 1]) cnt = 0;
				else cnt = 1;
			}
        	for (int x = i; x <= i + s - 1; x++) {
        		for (int y = j; y <= j + s - 1; y++) {
        			if (cnt && !c[x][y]) {
        				ans++;	
        				b[x][y] = 1;
        			}else if (!cnt && c[x][y]) {
        				ans++;
        				b[x][y] = 0;
        			}
        		}
        	}
        }
	}
	return ans;
}

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;
		c[x1][y1] = 1;
	}
	int mn = inf;
	for (int val = 1; val < n; val++) {
		if (n % val) continue;
		mn = min(mn, min(get(val, 0), get(val, 1)));		
	}
	cout << mn;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 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 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 320 KB Output is correct
2 Correct 5 ms 204 KB Output is correct
3 Correct 14 ms 204 KB Output is correct
4 Correct 13 ms 204 KB Output is correct
5 Correct 15 ms 316 KB Output is correct
6 Correct 10 ms 204 KB Output is correct
7 Correct 3 ms 204 KB Output is correct
8 Correct 11 ms 320 KB Output is correct
9 Correct 25 ms 204 KB Output is correct
10 Correct 20 ms 316 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 460 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 46 ms 14796 KB Output is correct
17 Correct 28 ms 204 KB Output is correct
18 Correct 62 ms 15736 KB Output is correct
19 Correct 236 ms 15052 KB Output is correct
20 Correct 237 ms 15052 KB Output is correct
21 Correct 26 ms 296 KB Output is correct
22 Correct 85 ms 9808 KB Output is correct
23 Correct 75 ms 15272 KB Output is correct
24 Correct 57 ms 15860 KB Output is correct
25 Correct 58 ms 15180 KB Output is correct
26 Correct 44 ms 14932 KB Output is correct
27 Correct 73 ms 15136 KB Output is correct
28 Correct 62 ms 14992 KB Output is correct
29 Correct 8 ms 204 KB Output is correct
30 Correct 26 ms 13712 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 320 KB Output is correct
2 Correct 5 ms 204 KB Output is correct
3 Correct 14 ms 204 KB Output is correct
4 Correct 13 ms 204 KB Output is correct
5 Correct 15 ms 316 KB Output is correct
6 Correct 10 ms 204 KB Output is correct
7 Correct 3 ms 204 KB Output is correct
8 Correct 11 ms 320 KB Output is correct
9 Correct 25 ms 204 KB Output is correct
10 Correct 20 ms 316 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 46 ms 14796 KB Output is correct
27 Correct 28 ms 204 KB Output is correct
28 Correct 62 ms 15736 KB Output is correct
29 Correct 236 ms 15052 KB Output is correct
30 Correct 237 ms 15052 KB Output is correct
31 Correct 26 ms 296 KB Output is correct
32 Correct 85 ms 9808 KB Output is correct
33 Correct 75 ms 15272 KB Output is correct
34 Correct 57 ms 15860 KB Output is correct
35 Correct 58 ms 15180 KB Output is correct
36 Correct 44 ms 14932 KB Output is correct
37 Correct 73 ms 15136 KB Output is correct
38 Correct 62 ms 14992 KB Output is correct
39 Correct 8 ms 204 KB Output is correct
40 Correct 26 ms 13712 KB Output is correct
41 Runtime error 1 ms 464 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 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 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 24 ms 320 KB Output is correct
10 Correct 5 ms 204 KB Output is correct
11 Correct 14 ms 204 KB Output is correct
12 Correct 13 ms 204 KB Output is correct
13 Correct 15 ms 316 KB Output is correct
14 Correct 10 ms 204 KB Output is correct
15 Correct 3 ms 204 KB Output is correct
16 Correct 11 ms 320 KB Output is correct
17 Correct 25 ms 204 KB Output is correct
18 Correct 20 ms 316 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 716 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 716 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 1 ms 716 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 588 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 588 KB Output is correct
32 Correct 1 ms 588 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 46 ms 14796 KB Output is correct
35 Correct 28 ms 204 KB Output is correct
36 Correct 62 ms 15736 KB Output is correct
37 Correct 236 ms 15052 KB Output is correct
38 Correct 237 ms 15052 KB Output is correct
39 Correct 26 ms 296 KB Output is correct
40 Correct 85 ms 9808 KB Output is correct
41 Correct 75 ms 15272 KB Output is correct
42 Correct 57 ms 15860 KB Output is correct
43 Correct 58 ms 15180 KB Output is correct
44 Correct 44 ms 14932 KB Output is correct
45 Correct 73 ms 15136 KB Output is correct
46 Correct 62 ms 14992 KB Output is correct
47 Correct 8 ms 204 KB Output is correct
48 Correct 26 ms 13712 KB Output is correct
49 Runtime error 1 ms 464 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -