Submission #1205528

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205528		ofoz	Red-blue table (IZhO19_stones)	Pypy 3	11 / 100	204 ms	63348 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)]

    if (n & 1): d = 1
    else: d = 2

    for i in range(n-d, n):
        for j in range(m):
            grid[i][j] = 0
    
    for i in range(n-d):
        for j in range(m-d):
            if (i + j) & 1: grid[i][j] = 1
            else: grid[i][j] = 0

    if m <= 2*d:
        grid = [[1] * m for _ in range(n)]
        print(n)
    elif n <= 2*d:
        grid = [[0] * m for _ in range(n)]
        print(m)
    else:
        print(n + m - 2)
    for i, row in enumerate(grid):
        for c in row:
            print(("-" if not c else "+"), end = "")
        print()


    



"""
5 4
+ + - +
+ + - +
+ + - +
+ + + +
M + N - 2

if n odd: res += n-1
else: res += n-2

if m odd: res += m-1
else: res += m-2
"""




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

Compilation message (stdout)

Compiling 'stones.py'...

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

=======

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