Submission #341346

# Submission time Handle Problem Language Result Execution time Memory
341346 2020-12-29T14:11:25 Z Tosic Chessboard (IZhO18_chessboard) C++14
39 / 100
100 ms 2796 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 = 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 = 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;
}
# Verdict Execution time Memory 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
# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 2412 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 392 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 392 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 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 12 ms 1136 KB Output is correct
17 Correct 31 ms 2796 KB Output is correct
18 Correct 41 ms 2796 KB Output is correct
19 Correct 86 ms 2796 KB Output is correct
20 Correct 100 ms 2796 KB Output is correct
21 Correct 29 ms 2796 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 21 ms 1648 KB Output is correct
24 Correct 36 ms 2796 KB Output is correct
25 Correct 5 ms 620 KB Output is correct
26 Correct 23 ms 1776 KB Output is correct
27 Correct 31 ms 2540 KB Output is correct
28 Correct 39 ms 2796 KB Output is correct
29 Correct 13 ms 1520 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 2412 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 Incorrect 27 ms 2412 KB Output isn't correct
10 Halted 0 ms 0 KB -