oj.uz

Submission #336002

# Submission time Handle Problem Language Result Execution time Memory
336002 2020-12-14T13:13:34 Z amunduzbaev Red-blue table (IZhO19_stones) C++14
54 / 100
 38 ms 2924 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define int long long
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 1e3+5;
int n, m, q;
char a[N][N], ans[N][N];
void solve(){
	cin>>n>>m;
	bool sw = 0;
	if(n > m){
		swap(n, m);
		sw = 1;
	}
	if(n == 1 || n == 2){
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				a[i][j] = '-';
			}
		}
		cout<<m<<"\n";
	}
	else if(n == 3 || n == 4){
		for(int i=0;i<n-1;i++){
			for(int j=0;j<m;j++){
				a[i][j] = '-';
			}
		}for(int i=0;i<m;i++){
			a[n-1][i] = '+';
		}cout<<1 + m<<"\n";
	}else{
		vector<int>cnt(m, 0);
		int j = 0, i = 0, need = m/2 +1, done = 0, cur = 0;
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++) a[i][j] = '-';
		}
		
		while(cnt[j] < n/2){
			a[i][j] = '+';
			cnt[j]++;
			j++;
			j%=m;
			done++;
			if(done == need) done = 0, i++, cur++;
		}
		
		cout<<cur + m<<"\n";
	}
	
	if(sw){
		for(int i=0;i<m;i++){
			for(int j=0;j<n;j++){
				ans[i][j] = a[j][i];
				if(ans[i][j] == '-') ans[i][j] = '+';
				else ans[i][j] = '-';
			}
		}
		swap(n, m);
	}else{
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				ans[i][j] = a[i][j];
			}
		}
	}
	
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cout<<ans[i][j];
		}cout<<"\n";
	}
	return;
}

signed main(){
	fastios
	int t = 1;
	cin>>t;
	while(t--) solve();
	return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 524 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1644 KB Output is correct
2 Correct 36 ms 2796 KB Output is correct
3 Correct 38 ms 2924 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 1792 KB in the table A+B is not equal to 46
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 524 KB Output is correct
5 Correct 38 ms 1644 KB Output is correct
6 Correct 36 ms 2796 KB Output is correct
7 Correct 38 ms 2924 KB Output is correct
8 Incorrect 38 ms 1792 KB in the table A+B is not equal to 46
9 Halted 0 ms 0 KB -