oj.uz

답안 #712802

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
712802 2023-03-20T04:39:10 Z willychan Red-blue table (IZhO19_stones) C++14
17 / 100
 2000 ms 316 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds

int n,m;
int arr[4][4];
int cnt(){
	int ans = 0;
	for(int i=0;i<n;i++){
		int zcnt = 0;
		for(int j=0;j<m;j++){
			zcnt+=arr[i][j]==0;
		}
		if(zcnt>(m)/2) ans++;
	}
	for(int j=0;j<m;j++){
		int ocnt = 0;
		for(int i=0;i<n;i++){
			ocnt+=arr[i][j]==1;
		}
		if(ocnt>(n)/2) ans++;
	}
	return ans;
}

void solve(){
	cin>>n>>m;
	pair<int,int> maxn ={0,0};
	for(int mask=0;mask<(1<<(n*m));mask++){
		for(int i=0;i<n*m;i++){
			arr[i/m][i%m]=(mask>>i)&1;
		}
		maxn = max(make_pair(cnt(),mask),maxn);
	}
	cout<<maxn.first<<"\n";
	for(int i=0;i<n*m;i++){
		arr[i/m][i%m]=(maxn.second>>i)&1;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cout<<((arr[i][j])?('-'):('+'));
		}
		cout<<"\n";
	}
}

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int t;cin>>t;
	while(t--){
		solve();
	}

	return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 8 ms 316 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2074 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 8 ms 316 KB Output is correct
3 Execution timed out 2074 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2061 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2057 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 8 ms 316 KB Output is correct
3 Execution timed out 2074 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -