Submission #338394

#	Time	Username	Problem	Language	Result	Execution time	Memory
338394		kutbilim_one	Chessboard (IZhO18_chessboard)	C++14	0 / 100	1 ms	492 KiB

chessboard

/** 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 int MAX = 1010;
int n, k;
int a[MAX][MAX];

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 cnt[2] = {};
	for(int i = 1; i <= n; i++){
		if(n % i) continue;
		if(i%2 == 0){
			cnt[0] = min(cnt[0], (i*i)/2);
			cnt[1] = min(cnt[1], (i*i)/2);		
		}else{
			cnt[0] = min(cnt[0], (i*i)/2);
			cnt[1] = min(cnt[1], (i*i)/2+1);
		}			
	}

	cout << min(cnt[0], cnt[1]);
}

void solve_2(){
	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;	
		} 				
	}

	int cnt[2] = {};
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			cnt[0] += a[i][j] == (i+j)%2;
			cnt[1] += a[i][j] != (i+j)%2;	
		}
	}

	cout << min(cnt[1], cnt[0]) << endl;
}

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 if(n <= 1000){
    //	solve_3_4();
    }
    
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 23
• Subtask 6: 0 / 30