Submission #500607

#	Time	Username	Problem	Language	Result	Execution time	Memory
500607		asakh	Red-blue table (IZhO19_stones)	C++17	100 / 100	24 ms	2260 KiB

stones

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define ppb pop_back
#define clr clear
#define len size()
#define beg begin()
#define end end()
#define ins insert
#define f first
#define s second
#define y1 y123456789
#define forn(i, l, r) for(int i = l; i <= r; ++i)
#define fastio ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)

using namespace std;
using namespace __gnu_pbds;

typedef tree < int, null_type, greater_equal < int >, 
				rb_tree_tag, tree_order_statistics_node_update > ordered_set;

int t, n, m;

const int MAXN = 1020;

int cnt[MAXN];
char a[MAXN][MAXN];

int add(int y)
{
	if (y == n)
		return 1;
	return y + 1;
}

int main()
{
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);

	fastio;

	cin >> t;
	
	while (t--)
	{
		memset(cnt, 0, sizeof(cnt));
		
		cin >> n >> m;
		
		bool tr = n < m;
		
		if (tr)
			swap(n, m);
		
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= m; ++j)
				a[i][j] = '+';
		
		int y = 1, x = 1, ans = n, c = 0;
		while (true)
		{
			if (c == n * ((m - 1) / 2))
				break;
			a[y][x] = '-';
			++cnt[x];
			++c;
			if (cnt[x] == n / 2 + 1)
				++x, ++ans;
			y = add(y);
		}
		
		cout << ans << '\n';
		if (tr)
		{
			for (int i = 1; i <= m; ++i)
			{
				for (int j = 1; j <= n; ++j)
					cout << (a[j][i] == '+' ? '-' : '+');
				cout << '\n';
			}
		}
		else
		{
			for (int i = 1; i <= n; ++i)
			{
				for (int j = 1; j <= m; ++j)
					cout << a[i][j];
				cout << '\n';
			}
		}
	}

	return 0;
}

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