Submission #892288

#	Time	Username	Problem	Language	Result	Execution time	Memory
892288		dilshod9890	Red-blue table (IZhO19_stones)	Cpython 3	0 / 100	139 ms	3920 KiB

stones

def solve_test_case(N, M):
    total_rows = N + 1
    max_AB = (total_rows // 2) * M + (total_rows // 2 + total_rows % 2) * (M // 2)

    print(max_AB)

    # Generate the pattern
    for i in range(N):
        row = ['+' if (i % 2 == 0 and j % 2 == 0) or (i % 2 == 1 and j % 2 == 1) else '-' for j in range(M)]
        print("".join(row))

# Read the number of test cases
T = int(input().strip())

for _ in range(T):
    # Read the dimensions of the table
    N, M = map(int, input().strip().split())

    # Solve the test case
    solve_test_case(N, M)

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