Submission #1154008

#	Time	Username	Problem	Language	Result	Execution time	Memory
1154008		KluydQ	Chessboard (IZhO18_chessboard)	C++20	0 / 100	1 ms	584 KiB

chessboard

#include <bits/stdc++.h>

#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
//#define int long long
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
 
using namespace std;
 
const int N = 3e5 + 123;
const int inf = 1e9;
const int mod = 1e9 + 7;
 
int a[N], b[N], c[N], n, m, q, k, z, w, x, y, ans;
int rc[1005][1005];

mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
 
int rand( int l, int r )
{
    uniform_int_distribution <int> uid( l, r );
    return uid( rng );
}
void check( int gap )
{
	if( gap == n ) return;
	
	int wb = 0, bw = 0;
	
	FOR( i, 1, n, 1 )
	{
		FOR( j, 1, n, 1 )
		{
			int bi = (i - 1) / gap + 1, bj = (j - 1) / gap + 1;
			
			if( (bi + bj) % 2 != rc[i][j] ) wb ++;
			else bw ++;
		}
	}
	ans = min( ans, min(wb, bw) );
}
void solve()
{
	cin >> n >> k;
	
	FOR( pldf, 1, k, 1 )
	{
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		
		FOR( i, x1, x2, 1 )
		{
			FOR( j, y1, y2, 1 ) rc[i][j] = 1;
		}
	}
	FOR( i, 1, n, 1 )
	{
		FOR( j, 1, n, 1 ) cout << rc[i][j];
		cout << '\n';
	}
	ans = inf;
	
	FOR( i, 1, sqrt(n), 1 )
	{
		if( n % i == 0 ) check(i), check(n / i);
	}
	cout << ans;
}
signed main() 
{
//	freopen("connect.in", "r", stdin);
//	freopen("connect.out", "w", stdout);
	    
    respagold
    
    int test = 1;
    
    if( !test ) cin >> test;
	
	while( test -- )
	{
		solve();
	}
}
// solved by KluydQ

/*
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4 
2 1 2 1
3 6 3 6
*/

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