oj.uz

답안 #500305

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500305 2021-12-30T16:48:34 Z Azamat_Kh Red-blue table (IZhO19_stones) Python 3
0 / 100
 769 ms 5268 KB 
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=1
    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.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 3020 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 3028 KB Wrong answer

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 3020 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 769 ms 5268 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 745 ms 5216 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 3020 KB Wrong answer
2 Halted 0 ms 0 KB -