oj.uz

답안 #379153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379153 2021-03-17T10:55:38 Z Fireball0424 Chessboard (IZhO18_chessboard) C++14
16 / 100
 39 ms 3180 KB 
#include <bits/stdc++.h>
#define int long long 
#define INF INT_MAX
#define ld long double
#define fr first
#define sc second
using namespace std;
 
struct rec{
	int x1, y1, x2, y2;
};
 
void solve(){
	int n, k;
	cin >> n >> k;
	vector<rec> v(k);
	for(int i = 0; i < k; i++){
		cin >> v[i].x1 >> v[i].y1 >> v[i].x2 >> v[i].y2; 
	}
	auto cal = [&](int x, int y, int len){
		int sum[4] = {};
		int res = 0, tx = x % len, ty = y % len;
		sum[0] = (x / len) * (y / len) / 2 * len * len;
        if(x % (2 * len) < len) sum[1] = tx * (y / len) / 2 * len;
        else sum[1] = tx * (y / len + 1) / 2 * len;
        sum[2] = ty * ((x / len + (y % (2 * len) < len ? 0 : 1)) / 2) * len;
        if((x % (2 * len) < len) != (y % (2 * len) < len)) sum[3] = tx * ty;
		for(int i = 0; i < 4; i++) res += sum[i];
		return res;
	};
	int mn = n * n;
	for(int i = 1; i < n; i++){
		if(n % i != 0) continue;
		int sum[3] = {};
		for(auto j : v){
			int x1 = j.x1, x2 = j.x2, y1 = j.y1, y2 = j.y2;
			int tmp = cal(x2, y2, i) - cal(x2, y1 - 1, i) - cal(x1 - 1, y2, i) + cal(x1 - 1, y1 - 1, i);
			sum[0] += tmp; // cal black
			sum[1] += (x2 - x1 + 1) * (y2 - y1 + 1) - tmp; // cal white
		}
		sum[2] = cal(n, n, i) - sum[0];
		mn = min(mn, sum[1] + sum[2]);
		mn = min(mn, n * n - sum[1] - sum[2]);
	}
	cout << mn;
}
 
main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) solve();
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2284 KB Output is correct
2 Correct 7 ms 876 KB Output is correct
3 Correct 18 ms 1516 KB Output is correct
4 Correct 19 ms 1772 KB Output is correct
5 Correct 24 ms 2028 KB Output is correct
6 Correct 15 ms 1388 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 16 ms 1388 KB Output is correct
9 Correct 39 ms 3180 KB Output is correct
10 Correct 22 ms 1900 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2284 KB Output is correct
2 Correct 7 ms 876 KB Output is correct
3 Correct 18 ms 1516 KB Output is correct
4 Correct 19 ms 1772 KB Output is correct
5 Correct 24 ms 2028 KB Output is correct
6 Correct 15 ms 1388 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 16 ms 1388 KB Output is correct
9 Correct 39 ms 3180 KB Output is correct
10 Correct 22 ms 1900 KB Output is correct
11 Incorrect 1 ms 364 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 27 ms 2284 KB Output is correct
10 Correct 7 ms 876 KB Output is correct
11 Correct 18 ms 1516 KB Output is correct
12 Correct 19 ms 1772 KB Output is correct
13 Correct 24 ms 2028 KB Output is correct
14 Correct 15 ms 1388 KB Output is correct
15 Correct 4 ms 620 KB Output is correct
16 Correct 16 ms 1388 KB Output is correct
17 Correct 39 ms 3180 KB Output is correct
18 Correct 22 ms 1900 KB Output is correct
19 Incorrect 1 ms 364 KB Output isn't correct
20 Halted 0 ms 0 KB -