Chess Tournament

Revision en1, by firedrakesin, 2021-09-13 09:20:56

This is the code I wrote for this problem mentioned above

def mat(a,b,two): l=[] prevind=-1;i=-1;ctwo=0 for t in b: i+=1;ii=-1;dcoder="" if t=="2": ctwo+=1 m=["0" for t in range(a)] l.append(m) n=0 for tt in b: ii+=1 if i==ii: l[i][ii]="X" elif t=="1" and tt=="2": l[i][ii]="+" elif t=="1" and tt=="1": l[i][ii]="=" elif two==ctwo and t=="2" and tt=="2" and n==0: l[i][ii]="+" n+=1 elif t=="2" and tt=="2" and n==0 and ii>prevind: n+=1 prevind=ii l[i][ii]="+" else: l[i][ii]="-" dcoder+=l[i][ii] print(dcoder) for _ in range(int(input())): a=int(input()) b=input() ll=list(map(str,b)) two=ll.count("2") if two<3 and two!=0: print("NO") continue print("YES")
mat(a,b,two)

It is correct I tried on different IDE, but not showing right on codeforces. Why like that and if any error , please help me by letting me know what is it.

Tags #constructive algorithms, chess and cps, 1569b

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English firedrakesin 2021-09-13 09:20:56 1253 Initial revision (published)