Submission #1156475

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156475		KaleemRazaSyed	Red-blue table (IZhO19_stones)	C++20	0 / 100	37 ms	1352 KiB

stones

#include<bits/stdc++.h>

using namespace std;

void solve()
{
  int n, m;
  cin >> n >> m;
  int a, b;
  int apb = 0;
  for(int A = 0; A <= n; A++)
    for(int B = 0; B <= m; B++)
      if(A + B <= 2 * n * m - A * m - B * n)
	if(A + B > apb)
	  {
	    a = A, b = B;
	    apb = A + B;
	  }

  deque<char> deq;

  for(int i = 0; i < m / 2 + 1; i++)
    deq.push_back('+');

  for(int i = m/2 + 1; i < m; i ++)
    deq.push_back('-');
  
  cout << apb << endl;
  for(int i = 0; i < a; i ++)
    {
      for(char j : deq)
	cout << j;
      cout << endl;

      for(int j = 0; j < m/2+1; j++)
	deq.push_front(deq.back()), deq.pop_back(); 
    }
  
  for(int i = a; i < n; i ++)
    {
      for(int j = 0; j < m; j++)
	cout << '-';
      cout << endl;
    }
}

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

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