oj.uz

답안 #338438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338438 2020-12-23T06:11:35 Z kutbilim_one Chessboard (IZhO18_chessboard) C++14
16 / 100
 32 ms 512 KB 
/** kutbilim.one **/
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(),x.end()
#define int long long
#define endl '\n'
  /*                        
ifstream in("test.txt"); 
#define cin in              

const signed MAX = 1001;
vector< vector<signed> > a(MAX, vector<signed> (MAX, 0));	
*/
int n, k;

bool isprime(int n){
	if(n == 2) return true;
	for(int i = 2; i*i <= n; i++)
		if(n%i == 0) return false;
	return true;
}

void solve_1(){
	int result = INT_MAX;
	for(int i = 1; i < n; i++){
		if(n%i) continue;
		result = min(result, ((n*n)/(i*i)/2)*(i*i));
	}		
	cout << result;
}

void solve_2(){
	int cnt[2] = {0, 0};
	for(int i = 1; i <= k; i++){
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		for(int x = x1; x <= x2; x++)
		for(int y = y1; y <= y2; y++){
			//a[x][y] = 1;
			cnt[(x+y)%2]++;	
		} 				
	}
	
	cout << min(n*n/2-cnt[1] + cnt[0], n*n/2+1-cnt[0] + cnt[1]);
}

void solve_3_4(){
	vector<pair<int, int>> sides(n, {0, 0}); 
	vector<int> f;
	for(int i = 1; i*i <= n; i++){
		if(n % i == 0){
			f.push_back(i);
			if(i != 1) f.push_back(n/i);
		}
	}	

	for(int i = 1; i <= k; i++){
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		for(int x = x1; x <= x2; x++)
		for(int y = y1; y <= y2; y++){
			//a[x][y] = 1;	
			for(auto d : f){
				if(((x+d-1)/d+(y+d-1)/d) % 2) sides[d].first++;
				else sides[d].second++; 
			}
		} 				
	}

	int result = LONG_MAX;
	for(auto d : f){
		result = min(
			result,
			((n*n)/(d*d)/2)*(d*d) - sides[d].second + sides[d].first
		); 
		if((n*n)/(d*d) % 2 == 1) 
		result = min(
			result,
			((n*n)/(d*d)/2)*(d*d)+(d*d) - sides[d].first + sides[d].second
		);
	}
	cout << result;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> n >> k;
    
    if(k == 0){
    	solve_1();
    }else if(isprime(n)){
    	solve_2();
    }else{
    	solve_3_4();
    }
    
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 364 KB Output is correct
2 Correct 6 ms 392 KB Output is correct
3 Correct 14 ms 364 KB Output is correct
4 Correct 17 ms 364 KB Output is correct
5 Correct 19 ms 364 KB Output is correct
6 Correct 14 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 12 ms 364 KB Output is correct
9 Correct 32 ms 364 KB Output is correct
10 Correct 18 ms 512 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 22 ms 364 KB Output is correct
2 Correct 6 ms 392 KB Output is correct
3 Correct 14 ms 364 KB Output is correct
4 Correct 17 ms 364 KB Output is correct
5 Correct 19 ms 364 KB Output is correct
6 Correct 14 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 12 ms 364 KB Output is correct
9 Correct 32 ms 364 KB Output is correct
10 Correct 18 ms 512 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 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 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 22 ms 364 KB Output is correct
10 Correct 6 ms 392 KB Output is correct
11 Correct 14 ms 364 KB Output is correct
12 Correct 17 ms 364 KB Output is correct
13 Correct 19 ms 364 KB Output is correct
14 Correct 14 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 12 ms 364 KB Output is correct
17 Correct 32 ms 364 KB Output is correct
18 Correct 18 ms 512 KB Output is correct
19 Incorrect 1 ms 364 KB Output isn't correct
20 Halted 0 ms 0 KB -