Submission #500310

#	Time	Username	Problem	Language	Result	Execution time	Memory
500310		Azamat_Kh	Red-blue table (IZhO19_stones)	Cpython 3	0 / 100	679 ms	4328 KiB

stones

T=int(input())
for h in range (T):
    v,g=[],[]
    N,M=list(map(int,input().split()))
    if N>1:
        A=N
    else :
        A=0
    if M%2==0 and M!=0:
        B=int(M/2-1)
    elif M>1  and A!=0:
        B=int(M/2)
    else :
        B=1
    if A==0:
        B=M
    print(A+B)
    for i in range (N):
        for j in range (M):
            g.append('+')
        v.append(g)
        g=[]
    if M%2==0 and N%2==0 and N!=1:
        for uu in range(0,int(N/2)+1):
            for rr in range(int(M/2)-1):
                v[uu][rr]='-'
    elif M%2==1 and N%2==1 and N!=1:
        for hh in range(0,int(M/2)):
            for ll in range(int((len(v))/2)+1):
                v[ll][hh]='-'
    elif M%2==0 and N%2==1 and N!=1:
        for ol in range(int(N/2)+1):
            for op in range (int(M/2)-1):
                v[ol][op]='-'
    elif M%2==1 and N%2==0 and N!=1:
        for mol in range(int(N/2)+1):
            for omp in range(int(M/2)):
                v[mol][omp]='-'
    elif N==1:
        for oiu in range(M):
            v[0][oiu]='-'
    for j1 in range(len(v)):
        for i1 in range(len(v[0])):
            print(v[j1][i1],end='')
        print()

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