Submission #382035

# Submission time Handle Problem Language Result Execution time Memory
382035 2021-03-26T10:02:58 Z vanic Red-blue table (IZhO19_stones) C++14
27 / 100
36 ms 1388 KB
#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

const int maxn=1005;


void solve(){
	int n, m;
	cin >> n >> m;
	int gran;
	if(n>m){
		gran=(m-1)/2;
		cout << n+gran << '\n';
		for(int i=0; i<n; i++){
			for(int j=0; j<m; j++){
				if(j<gran){
					cout << '-';
				}
				else{
					cout << '+';
				}
			}
			cout << '\n';
		}
	}
	else{
		gran=(n-1)/2;
		cout << m+gran << '\n';
		for(int i=0; i<n; i++){
			for(int j=0; j<m; j++){
				if(i<gran){
					cout << '+';
				}
				else{
					cout << '-';
				}
			}
			cout << '\n';
		}
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while(t--){
		solve();
	}
	return 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
# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
# 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 Incorrect 3 ms 364 KB Wrong answer in test 5 29: 31 < 32
# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 1388 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 1388 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -
# 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 Incorrect 3 ms 364 KB Wrong answer in test 5 29: 31 < 32