Submission #1205523

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205523		ofoz	Red-blue table (IZhO19_stones)	Pypy 3	27 / 100	203 ms	56212 KiB

stones

from collections import deque
from sys import setrecursionlimit

def solve():
    n, m = map(int, input().split(" "))
    
    if m <= n:
        grid = [[1] * m for _ in range(n)]
        for j in range((m-1)//2):
            for i in range(n):
                grid[i][j] = 0
        print(n + (m-1)//2)
    
    else:
        grid = [[0] * m for _ in range(n)]
        for i in range((n-1)//2):
            for j in range(m):
                grid[i][j] = 1
        print(m + (n-1)//2)
    
    
    for i, row in enumerate(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: 17 / 17
• Subtask 2: 10 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31