Submission #333661

# Submission time Handle Problem Language Result Execution time Memory
333661 2020-12-07T10:41:11 Z kutbilim_one Red-blue table (IZhO19_stones) C++14
27 / 100
4 ms 1388 KB
/** @kutbilimone **/
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int t;
	cin >> t;
	while(t--){
		int n, m;
		cin >> n >> m;
		
		if(n > m){
			cout << n+(m-m/2-1) << endl;
			string res = string(m/2+1, '+') + string(m-m/2-1, '-');
			for(int i = 0; i < n; i++) cout << res << endl;
		}else{
			string res1(m, '+'), res2(m, '-');
			int i;
			cout << m+(n-n/2-1) << endl;
			for(i = 0; i < n/2+1; i++)
				cout << res2 << endl;
			for(; i < n; i++) cout << res1 << endl; 
		}
	}

	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 1 ms 384 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 1 ms 384 KB Output is correct
4 Incorrect 1 ms 364 KB Wrong answer in test 5 29: 31 < 32
# Verdict Execution time Memory Grader output
1 Incorrect 4 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 3 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 1 ms 384 KB Output is correct
4 Incorrect 1 ms 364 KB Wrong answer in test 5 29: 31 < 32