답안 #341348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341348 2020-12-29T14:14:50 Z Tosic Chessboard (IZhO18_chessboard) C++14
39 / 100
94 ms 1536 KB
#include <bits/stdc++.h>

using namespace std;

int n, k;
long long ans;
vector<pair<int, int> > allW;

void tryFor(int d){
	if(d == n){
		return;
	}
	// 0 0 is black
	long long blArea = 1LL*d*d*(((n/d)*(n/d)+1)/2);
	for(auto i : allW){
		if( (i.first/d + i.second/d)%2 ){
			blArea++;
		} else {
			blArea--;
		}
	}
	ans = min(ans, blArea);
	// 0 0 is BUANA
	blArea = 1ll*d*d*(((n/d)*(n/d))/2);
	for(auto i : allW){
		//cerr << i.first/d + i.second/d << '\n';
		if( (i.first/d + i.second/d)%2 ){
			blArea--;
		} else {
			blArea++;
		}
	}
	ans = min(ans, blArea);
	return;
}

int main(){
	ios_base::sync_with_stdio(0);
	cout.tie(0);
	cin.tie(0);
	cin >> n >> k;
	ans = 1e10;
	for(int i = 0; i < k; ++i){
		int x, y;
		cin >> x >> y;
		cin >> x >> y;
		--x,--y;
		allW.push_back({x,y});
	}
	for(int i = 1; i*i <= n; ++i){
		if(n%i == 0){
			tryFor(n/i);
			tryFor(i);
		}
	}
	cout<<ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 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 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 1008 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 14 ms 748 KB Output is correct
17 Correct 29 ms 1516 KB Output is correct
18 Correct 40 ms 1516 KB Output is correct
19 Correct 84 ms 1516 KB Output is correct
20 Correct 94 ms 1536 KB Output is correct
21 Correct 28 ms 1516 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 21 ms 1008 KB Output is correct
24 Correct 37 ms 1516 KB Output is correct
25 Correct 5 ms 492 KB Output is correct
26 Correct 23 ms 1008 KB Output is correct
27 Correct 31 ms 1532 KB Output is correct
28 Correct 38 ms 1516 KB Output is correct
29 Correct 12 ms 1008 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 1008 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 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 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Incorrect 27 ms 1008 KB Output isn't correct
10 Halted 0 ms 0 KB -