Submission #1205521

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205521		ofoz	Red-blue table (IZhO19_stones)	Pypy 3	0 / 100	211 ms	56232 KiB

stones

from collections import deque
from sys import setrecursionlimit

def solve():
    n, m = map(int, input().split(" "))
    grid = [[1] * m for _ in range(n)] # 0 = blue, 1 = red
    if m <= n:
        for j in range(m//2):
            for i in range(n):
                grid[i][j] = 0
        print(n + m//2)
    
    else:
        grid = [[0] * m for _ in range(n)]
        for i in range(n//2):
            for j in range(m):
                grid[i][j] = 1
        print(m + n//2)
    
    
    for row in grid:
        for c in row:
            print(("-" if not c else "+"), end = "")
        print()


    



"""
+++++
+++++
+++++
+++++
+++++
"""




for _ in range(int(input())): solve()

Compilation message (stdout)

Compiling 'stones.py'...

=======
  adding: __main__.pyc (deflated 41%)

=======

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