Submission #171877

#	Time	Username	Problem	Language	Result	Execution time	Memory
171877		Dilshod_Imomov	Red-blue table (IZhO19_stones)	C++17	0 / 100	80 ms	1400 KiB

stones

# include <bits/stdc++.h>
# pragma GCC optimize("Ofast")
# define pb push_back
# define ll long long
# define fi first
# define se second
# define all(vc) vc.begin(),vc.end()
# define forn(i, n) for (int i = 0; i < int(n); i++)
# define ford(i, n) for (int i = int(n) - 1; i >= 0; i--)
# define fore(i, l, r) for (int i = int(l); i < int(r); i++)
# define fors(i, s) for (int i = 0; s[i]; i++)
# define in freopen("input.txt", "r", stdin)
# define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
# define time cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"
# define debug(x) cerr << #x << ": " << x << endl; 

using namespace std;
 
const ll INF = 1e18;
const int mod = 1e9 + 7;
const int N = 1e5 + 7;

void solve()
{
	int n, m;
	cin >> n >> m;
	if ( n >= m ) {
		int red = m / 2, blue = m / 2;
		cout << n + blue << endl;
		forn( i, n ) {
			forn( j, blue ) cout << "-";
			forn( j, red + 1 ) cout << "+";
			cout << endl;
		}
	}
	else {
		int red = n / 2, blue = n / 2;
		cout << m + red << endl;
		forn( i, blue + 1 ) {
			forn( j, m ) cout << "-";
			cout << endl;
		}
		forn( i, red ) {
			forn( j, m ) cout << "+";
			cout << endl;
		}
	}
}

int main()
{
	speed;
	int t;
	cin >> t;
	while ( t-- ) solve();
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31