Submission #692909

#	Time	Username	Problem	Language	Result	Execution time	Memory
692909		tolbi	Chessboard (IZhO18_chessboard)	C++17	47 / 100	55 ms	4944 KiB

chessboard

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
#ifdef LOCAL
	#include "23.h"
#endif
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
using namespace std;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
bool isblack(int blok, int x, int y){
	return (((x/blok)%2)^((y/blok)%2));
}
int32_t main(){
	ios;
	int t=1;
	int tno = 0;
	if (!t) cin>>t;
	while (t-(tno++)){
		deci(n);deci(k);
		int say = 0;
		bool subt = true;
		for (int i = 2; i < n; i++) {
			if (n%i==0) subt=false;
		}
		vector<pair<pair<int,int>,pair<int,int>>> arr(k);
		for (int i = 0; i < k; i++){
			deci(x1);deci(y1);deci(x2);deci(y2);
			arr[i]={{x1,x2},{y1,y2}};
			if (x1!=x2 || y1!=y2) subt=false;
			say+=((x1-1)%2)^((y1-1)%2);
		}
		int blk = n*n/2;
		int whit = n*n-blk;
		if (subt){
			cout<<min(blk-say+k-say,say+whit-(k-say))<<endl;
			continue;
		}
		int all = 0;
		for (int i = 0; i < k; i++){
			arr[i].first.first--;
			arr[i].first.second--;
			arr[i].second.first--;
			arr[i].second.second--;
			all+=(arr[i].second.second-arr[i].second.first+1)*(arr[i].first.second-arr[i].first.first+1);
		}
		int ans = MOD;
		for (int i = 1; i < n; i++){
			if (n%i) continue;
			int say = 0;
			for (int j = 0; j < k; j++){
				for (int z = arr[j].first.first; z <= arr[j].first.second; z++){
					for (int tt = arr[j].second.first; tt<=arr[j].second.second;tt++){
						say+=isblack(i,z,tt);
					}
				}
			}
			int bls=(n/i)*(n/i)/2*(i*i);
			ans=min(ans,all-say+bls-say);
			ans=min(ans,say+n*n-bls-all+say);
		}
		cout<<ans<<endl;
	}
}

Compilation message (stderr)

chessboard.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      |

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