oj.uz

답안 #335963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335963 2020-12-14T11:50:34 Z tengiz05 Red-blue table (IZhO19_stones) C++17
0 / 100
 42 ms 1620 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 1005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int n, m, k;
char a[N][N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
	if(n > m){
		swap(n, m);
		vector<int> cnt(m, 0);
		for(i=0;i<n;i++){
			for(j=0;j<m;j++){
				a[i][j] = '+';
			}
		}
		i=0,j=0;
		int lim = m/2+1;
		bool is = true;
		while(is){
			for(k=0;k<lim;k++){
				if(cnt[j]+1 > n/2){
					is = false;
					break;
				}
				cnt[j]++;
				a[i][j] = '-';
				j++;j%=m;
			}i++;
		}
		int ans = 0;
		for(i=0;i<n;i++){
			int s = 0;
			for(j=0;j<m;j++)s += (a[i][j]=='+');
			if(s > m/2)ans++;
		}
		for(j=0;j<m;j++){
			int s = 0;
			for(i=0;i<n;i++)s += (a[i][j]=='-');
			if(s > n/2)ans++;
		}cout << ans << '\n';
		for(i=0;i<n;i++){
			for(j=0;j<m;j++){
				cout << a[i][j];
			}cout << '\n';
		}
	}else {
		vector<int> cnt(m, 0);
		for(i=0;i<n;i++){
			for(j=0;j<m;j++){
				a[i][j] = '-';
			}
		}
		i=0,j=0;
		int lim = m/2+1;
		bool is = true;
		while(is){
			for(k=0;k<lim;k++){
				if(cnt[j]+1 > n/2){
					is = false;
					break;
				}
				cnt[j]++;
				a[i][j] = '+';
				j++;j%=m;
			}i++;
		}
		int ans = 0;
		for(i=0;i<n;i++){
			int s = 0;
			for(j=0;j<m;j++)s += (a[i][j]=='+');
			if(s > m/2)ans++;
		}
		for(j=0;j<m;j++){
			int s = 0;
			for(i=0;i<n;i++)s += (a[i][j]=='-');
			if(s > n/2)ans++;
		}cout << ans << '\n';
		for(i=0;i<n;i++){
			for(j=0;j<m;j++){
				cout << a[i][j];
			}cout << '\n';
		}
	}
	
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 1
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Wrong answer

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 42 ms 1620 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 1516 KB Wrong answer in test 24 24: 22 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer