oj.uz

답안 #495044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495044 2021-12-18T03:53:58 Z mansur Chessboard (IZhO18_chessboard) C++14
16 / 100
 28 ms 704 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 = 0, ans = 0;
	for (int i = 1; i <= n; i += s) {
		for (int j = 1; j <= n; j += s) {
        	for (int x = i; x <= i + s - 1; x++) {
        		for (int y = j; y <= j + s - 1; y++) {
        			if (cnt == p && !c[x][y]) {
        				ans++;	
        			}else if (cnt != p && c[x][y]) {
        				ans++;
        			}
        		}
        	}
        	cnt ^= 1;
        }
	}
	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:64:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   64 | main() {
      | ^~~~

Subtask #1
8.0 / 8.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 204 KB Output is correct
2 Correct 6 ms 500 KB Output is correct
3 Correct 13 ms 704 KB Output is correct
4 Correct 14 ms 500 KB Output is correct
5 Correct 16 ms 508 KB Output is correct
6 Correct 13 ms 448 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 11 ms 460 KB Output is correct
9 Correct 28 ms 504 KB Output is correct
10 Correct 16 ms 452 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 616 KB Output is correct
6 Incorrect 1 ms 588 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 616 KB Output is correct
6 Incorrect 1 ms 588 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 204 KB Output is correct
2 Correct 6 ms 500 KB Output is correct
3 Correct 13 ms 704 KB Output is correct
4 Correct 14 ms 500 KB Output is correct
5 Correct 16 ms 508 KB Output is correct
6 Correct 13 ms 448 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 11 ms 460 KB Output is correct
9 Correct 28 ms 504 KB Output is correct
10 Correct 16 ms 452 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 332 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 616 KB Output is correct
16 Incorrect 1 ms 588 KB Output isn't correct
17 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 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 0 ms 204 KB Output is correct
6 Correct 1 ms 260 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 18 ms 204 KB Output is correct
10 Correct 6 ms 500 KB Output is correct
11 Correct 13 ms 704 KB Output is correct
12 Correct 14 ms 500 KB Output is correct
13 Correct 16 ms 508 KB Output is correct
14 Correct 13 ms 448 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 11 ms 460 KB Output is correct
17 Correct 28 ms 504 KB Output is correct
18 Correct 16 ms 452 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 588 KB Output is correct
23 Correct 1 ms 616 KB Output is correct
24 Incorrect 1 ms 588 KB Output isn't correct
25 Halted 0 ms 0 KB -