Submission #1205746

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

stones

from collections import deque
from sys import setrecursionlimit
import heapq

def solve():
    n, m = map(int, input().split(" "))
    grid = [[1] * m for _ in range(n)]
    q = []
    for i in range(n): heapq.heappush(q, (0, i))
    j = 0
    cur = 0
    while j < m:
        cnt, i = heapq.heappop(q)
        if cnt >= (m-1)//2: break
        grid[i][j] = 0
        heapq.heappush(q, (cnt+1, i))
        cur += 1
        if cur > n//2:
            cur = 0
            j += 1

    if (n & 1): d = 2
    else: d = 3
    res = n + m - d
    if n >= m and m <= d:
        grid = [[1] * m for _ in range(n)]
        res = n

    if m >= n and n <= d:
        grid = [[0] * m for _ in range(n)] 
        res = m
    print(res)
    for row in grid:
        for c in row:
            print("+" if c else "-", end = "")
        print()


"""

"""




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

Compilation message (stdout)

Compiling 'stones.py'...

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

=======

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