Submission #1156338

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156338		UmairAhmadMirza	Red-blue table (IZhO19_stones)	C++20	0 / 100	2095 ms	440 KiB

stones

#include <bits/stdc++.h>
using namespace std;

#define ll long long
int const N=2e5+5;
int const mod=1e9+7;

int n,m;

int calcu(vector<vector<bool>> v){
	// cout<<n<<' '<<m<<endl;
	int a=0;
	for(int i=0;i<n;i++){
		int c=0;
		for(int j=0;j<m;j++)
			if(v[i][j]==1)
				c++;
		if(c*2>m)
			a++;
	}
	for(int j=0;j<m;j++){
		int c=0;
		for(int i=0;i<n;i++){
			if(v[i][j]==0)
				c++;
		}
		if(c*2>n)
			a++;
	}
	return a;
}

void solve(){
	// int n,m;
	cin>>n>>m;
	int k=(n*m);
	int an=-1;
	vector<vector<bool>> ans;
	for(int mask=0;mask<(1<<k);mask++){
		vector<vector<bool>> v;
		for(int i=0;i<n;i++){
			v.push_back({});
			for(int j=0;j<m;j++){
				int d=(i*n)+j;
				v[i].push_back(bool((1<<d)&mask));
			}
		}
		// cout<<mask<<endl;
		int a=calcu(v);
		if(a>an){
			an=a;
			ans=v;
		}
		// break;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++)
			cout<<ans[i][j]<<' ';
		cout<<endl;
	}
}
int main(){
	int t;
	cin>>t;
	while(t--)
		solve();
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31