Submission #523300

#	Time	Username	Problem	Language	Result	Execution time	Memory
523300		Azamat_Kh	Red-blue table (IZhO19_stones)	Cpython 3	100 / 100	874 ms	12720 KiB

stones

t = int(input())
while t:
    n, m = map(int, input().split())

    # (n,m) <-> (m,n)
    # by "n>=m" we will solve (n,m) and (m,n)

    swapped = False
    if n<m:
        n, m = m, n
        swapped = True

    a = []
    for y in range(n):
        a.append([])
        for x in range(m):
            a[y].append('+')

    answer = n

    '''
        0-++
        1-++
        2+-+
         012

        (m-1)//2
            x
         n//2+1

         o'zgartirishlar chegarasi

         1 3
         +n
         +
         +
         m
         
    '''

    x = 0; c = 0
    for _ in range((m-1)//2):
        for y in range(n):
            a[y][x] = '-'
            c += 1
            if c >= n//2+1:
                answer += 1
                x += 1
                c = 0

    print(answer)

    if not swapped:
        for y in range(n):
            for x in range(m):
                print(a[y][x], end='')
            print()

    else:
        # n -> m, m -> n
        for x in range(m):
            for y in range(n):
                if a[y][x] == '+':
                    print('-', end='')
                else:
                    print('+', end='')
            print()
            
    t -= 1


    # o'zgatirish chegarasi - (m-1)//2

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